View source for Publications:Order-independence of vector-based transition systems

<div style='display: none'>
== Do not edit this section ==
</div>
{{PublicationSetupTemplate|Author=M. Raffelsieper, Mohammad Reza Mousavi, H. Zantema
|PID=584488
|Name=Raffelsieper, M. (Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, Netherlands);Mousavi, Mohammad Reza [mohmou] ( Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, Netherlands);Zantema, H. ( Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, Netherlands)
|Title=Order-independence of vector-based transition systems
|PublicationType=Conference Paper
|ContentType=Refereegranskat
|Language=eng
|Journal=
|JournalISSN=
|Status=
|Volume=
|Issue=
|HostPublication=Proceedings 10th International Conference on Application of Concurrency to System Design (ACSD’10, Braga, Portugal, June 21-25, 2010)
|Conference=The 10th International Conference on Application of Concurrency to System Design
|StartPage=115
|EndPage=123
|Year=2010
|Edition=
|Pages=
|City=Los Alamitos, Calif.
|Publisher=IEEE Computer Society
|Series=International Conference on Application of Concurrency to System Design. Proceedings
|SeriesISSN=1550-4808
|ISBN=978-076954066-5
|Urls=
|ISRN=
|DOI=http://dx.doi.org/10.1109/ACSD.2010.24
|ISI=
|PMID=
|ScopusId=2-s2.0-77957558045
|NBN=urn:nbn:se:hh:diva-20521
|LocalId=
|ArchiveNumber=
|Keywords=Interleaving semantics;Micro-steps;State-space generation;Step transitions;Transition system;Vector-based
|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 a transition system, each macro-step transition is labeled by a vector of inputs. When performing a macro-step, several inputs may potentially change. Each macro-step can thus be decomposed in a number of micro-steps, taking one input change at a time into account. This is akin to an interleaving semantics, where a concurrent step is represented by an interleaving of its constituting components. We present abstract criteria on vector-based transition systems, which guarantee that the next state computation is independent of the order in which these micro-steps are executed. If our abstract criteria are satisfied by the semantic definition of a certain specification, then its state-space generation or exploration algorithm needs to only consider one representative among all possible permutations of such micro-steps. We demonstrate the applicability of our abstract criteria to the specification of transistor netlists. © 2010 IEEE.</p>
|Opponents=
|Supervisors=
|Examiners=
|Patent=
|ThesisLevel=
|Credits=
|Programme=
|Subject=
|Uppsok=
|DefencePlace=
|DefenceLanguage=
|DefenceDate=
|CreatedDate=2013-01-08
|PublicationDate=2013-01-09
|LastUpdated=2013-02-26
|diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:584488}}
<div style='display: none'>

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