hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Long-run order-independence of vector-based transition systems
TU Eindhoven, Dept Comp Sci, NL-5600 MB Eindhoven, Netherlands.
TU Eindhoven, Dept Comp Sci, NL-5600 MB Eindhoven, Netherlands.ORCID iD: 0000-0002-4869-6794
TU Eindhoven, Dept Comp Sci, NL-5600 MB Eindhoven, Netherlands.
2011 (English)In: IET Computers & Digital Techniques, ISSN 1751-861X, Vol. 5, 468-478 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2011. Vol. 5, 468-478 p.
Keyword [en]
interleaving semantics, long run order independence, macro step transition, specification languages, state-space exploration, state-space generation, vector based transition systems
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:hh:diva-20331ISI: 000298115900005OAI: oai:DiVA.org:hh-20331DiVA: diva2:583422
Available from: 2013-01-08 Created: 2013-01-08 Last updated: 2014-11-11Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Mousavi, Mohammad Reza
In the same journal
IET Computers & Digital Techniques
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 72 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf