View source for Publications:Long-run order-independence of vector-based transition systems

<div style='display: none'>
== Do not edit this section ==
</div>
{{PublicationSetupTemplate|Author=Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema
|PID=583422
|Name=Raffelsieper, Matthias (TU Eindhoven, Dept Comp Sci, NL-5600 MB Eindhoven, Netherlands);Mousavi, Mohammad Reza [mohmou] (TU Eindhoven, Dept Comp Sci, NL-5600 MB Eindhoven, Netherlands);Zantema, Hans (TU Eindhoven, Dept Comp Sci, NL-5600 MB Eindhoven, Netherlands)
|Title=Long-run order-independence of vector-based transition systems
|PublicationType=Journal Paper
|ContentType=Refereegranskat
|Language=eng
|Journal=IET Computers & Digital Techniques
|JournalISSN=1751-861X
|Status=published
|Volume=5
|Issue=
|HostPublication=
|Conference=
|StartPage=468
|EndPage=478
|Year=2011
|Edition=
|Pages=
|City=
|Publisher=
|Series=
|SeriesISSN=
|ISBN=
|Urls=
|ISRN=
|DOI=
|ISI=000298115900005
|PMID=
|ScopusId=
|NBN=urn:nbn:se:hh:diva-20331
|LocalId=
|ArchiveNumber=
|Keywords=interleaving semantics;long run order independence;macro step transition;specification languages;state-space exploration;state-space generation;vector based transition systems
|Categories=Data- och informationsvetenskap (102)
|ResearchSubjects=
|Projects=
|Notes=
|Abstract=<p>Semantics of many specification languages, particularly those used in the domain of hardware, is described in terms of vector-based transition systems. In such transition systems, each macro-step transition is labeled by a vector of inputs in which several inputs may change simultaneously. Each macro-step can thus be decomposed into a number of micro-steps, considering one input change at a time. This is akin to an interleaving semantics, where a concurrent step is represented by an interleaving of its constituting components. In this paper, the authors present abstract criteria on vector-based transition systems, which guarantee the next state computation to be independent of the execution order of micro-steps. If these abstract criteria are satisfied, then state-space generation or exploration algorithms only need to consider one representative among all possible permutations of micro-steps. For most practical applications only the system's long-run behaviour is of relevance and the transient start-up phase can be ignored. Hence, the authors customise their generic techniques to focus on the long-run behaviour and identify orders of interleaving input changes that may behave differently during start-up, but compute the same next states in the long-run behaviour. Applicability of the developed abstract criteria is demonstrated for specifications of transistor netlists. ©2011, IEEE.</p>
|Opponents=
|Supervisors=
|Examiners=
|Patent=
|ThesisLevel=
|Credits=
|Programme=
|Subject=
|Uppsok=
|DefencePlace=
|DefenceLanguage=
|DefenceDate=
|CreatedDate=2013-01-08
|PublicationDate=2013-01-08
|LastUpdated=2013-02-26
|diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:583422}}
<div style='display: none'>

== Keep all hand-made modifications below ==
</div>{{PublicationDisplayTemplate}}