{"id":92,"date":"2015-11-24T15:55:48","date_gmt":"2015-11-24T15:55:48","guid":{"rendered":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/?p=92"},"modified":"2016-07-11T15:56:12","modified_gmt":"2016-07-11T14:56:12","slug":"concepts-iii-initial-states","status":"publish","type":"post","link":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/2015\/11\/24\/concepts-iii-initial-states\/","title":{"rendered":"Concepts III: Initial States"},"content":{"rendered":"

Initial States
\n<\/span><\/p>\n

Now we have introduced a couple of simple gates, a buffer<\/a> and an inverter<\/a>, we should now discuss an important part of Signal Transition Graphs, and their implementation using Concepts. These are initial states. \u00a0<\/em><\/p>\n

Initial states are used in Signal Transition Graphs to show what state a signal is in, high or low, when the system being designed starts. This is important as STGs require initial states for simulation, verification and synthesis.<\/p>\n

In the previous posts, we have assumed that all signals involved in the STGs are initially set to 0, and this has been indicated by placing a token <\/em>in the places which are before each signals +\u00a0<\/strong>transition (as above), but this assumption cannot be applied to every STG.<\/p>\n

Example – A Handshake<\/span><\/p>\n

So now let’s use a previous example, a Handshake, and discuss what we can do to ensure there are initial states in an STG produced using concepts.<\/p>\n

The concept used to describe a\u00a0handshake is as follows:<\/p>\n

handshake(a,b) = buffer(a,b)\u00a0\u22c4 inverter(b,a)<\/strong><\/p>\n

This concept captures the interactions of signals\u00a0a<\/strong> and\u00a0b<\/strong>, using previously defined buffer<\/strong> and inverter<\/strong> concepts, but this does not explain the state of these signals when the handshake starts.<\/p>\n

Initial state concepts can be defined similarly to other concepts, and thus can be composed with other concepts as normal. For this example, let’s say the two signals involved in handshake are both initially 0.<\/p>\n

initialState = initialise(a,0)\u00a0\u22c4 initialise(b,0)<\/strong><\/p>\n

There is some syntax to discuss here:<\/p>\n

initialise(a,0) – This is used to express an initial state.\u00a0The state of the signal, a, will be initially set to 0.<\/p>\n

The concept, initialState,<\/strong> implies that the initial state of signals\u00a0a\u00a0<\/strong>and\u00a0b\u00a0<\/strong>will be 0, so the first transition of each can be +<\/strong>, from low to high.<\/p>\n

Now we can include this concept with the handshake concept:<\/p>\n

system = handshake(a,b)\u00a0\u22c4 initialState<\/strong><\/p>\n

Passing this concept into the algorithm will produce the same STG as in the previous post:<\/p>\n

\"bufferAndInverter00\"<\/a><\/p>\n

And this can be resynthesized to produce the same handshake STG:<\/p>\n

\"handshake00\"<\/a><\/p>\n

However, what if the initial states are not both 0? For this, let’s redefine the initial state concept and compose this with a handshake concept:<\/p>\n

initialState = initial(a,0)\u00a0\u22c4 initial(b,1)
\nsystem = handshake(a,b)\u00a0\u22c4 initialState<\/strong><\/p>\n

Now,\u00a0a<\/strong>\u00a0should initially be 0, and\u00a0b<\/strong> should initialy be 1. The STG produced from these concepts is:<\/p>\n

\"BufferAndInverter01\"<\/a>This is the same as the previous version, but the tokens have shifted. After resynthesis, the STG is as follows:\"BufferAndInvertorRe01\"<\/a>Again, very similar to the previous post-resynthesis STG. But in this case, we can see that\u00a0b-<\/strong> is the first transition, instead of\u00a0a+<\/strong>.<\/p>\n

No initial state concepts<\/span><\/p>\n

So, what if a set of concepts doesn’t contain any initial state concepts. In this case, the STG produced may still be a correct implementation of the system, but a user may wish to do some testing with options for initial states open.<\/p>\n

When this occurs, the algorithm has the option of adding some extra transitions to allow a user some options. So, for example, let’s define a handshake, but no initial states:<\/p>\n

system = handshake(a,b)<\/strong><\/p>\n

In this case, we make no assumptions of initial states, but how does this affect the STG produced?<\/p>\n

\"BufferInverterNoInit\"<\/a><\/p>\n

The STG produced is very similar to the previous STG, the concepts used to describe which features initial states. In this case however, the places a_0<\/strong>, a_1<\/strong>, b_0<\/strong> and b_1 <\/strong>are all free from tokens. In order to select an initial state, the algorithm adds in an extra place and two extra transitions per signal, in order to allow\u00a0 a choice of each signal’s initial state.<\/p>\n

Using this example, when a user starts the simulation, the first transitions to be enabled will be the transitions either high or low from the initial state selections, allowing the user to select a- <\/strong>to set this signal to 0 initially, or a+ <\/strong>to set it to 1 initially, and this is the same as with signal b<\/strong>.<\/p>\n

After this choice is made, the initial state selection will no longer be usable until the simulation is started again. The user can test how the system runs using these initial states, and then\u00a0restart to test another combination of initial states. After the initial states have been selected, the user can either change this STG, removing the initial state selections and adding tokens into the correct place, or they can add the initial states to the list of concepts, and re-compose these for a new STG.<\/p>\n

DISCLAIMER<\/strong> –\u00a0An STG featuring initial state selection is not a correct STG, it violates properties of STGs which are necessary in order to be used with tools which perform useful functions like synthesis, for example.\u00a0Currently, this method of testing for initial states should be used only for simulation, to test how differing initial states can affect a system. Any future developments are made on how to include a choice \u00a0of initial state in a correct STG, a follow-up post will be made.<\/p><\/blockquote>\n

Finally<\/span><\/p>\n

In this and the previous two posts, we have covered the basics of concepts, and the design process of various simple gates.\u00a0 Now we can move onto discussing some more complicated designs, and how we can use pre-existing concepts, and define new ones.<\/p>\n

The next blog post will be Concepts IV: A C-element. This will be the first in a set of posts describing some standard logic gates, and from this we will work up to some more complex examples, using\u00a0some of the previously described gates.<\/p>\n","protected":false},"excerpt":{"rendered":"

Initial States Now we have introduced a couple of simple gates, a buffer and an inverter, we should now discuss an important part of Signal Transition Graphs, and their implementation using Concepts. These are initial states. \u00a0 Initial states are used in Signal Transition Graphs to show what state a signal is in, high or … Continue reading Concepts III: Initial States<\/span> →<\/span><\/a><\/p>\n","protected":false},"author":6010,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,5,2,7],"tags":[],"class_list":["post-92","post","type-post","status-publish","format-standard","hentry","category-asynchronous","category-buffer","category-concepts","category-inverter"],"_links":{"self":[{"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/posts\/92","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/users\/6010"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/comments?post=92"}],"version-history":[{"count":10,"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/posts\/92\/revisions"}],"predecessor-version":[{"id":102,"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/posts\/92\/revisions\/102"}],"wp:attachment":[{"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/media?parent=92"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/categories?post=92"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ncl.ac.uk\/jrbeaumont\/wp-json\/wp\/v2\/tags?post=92"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}