Determinate STG decomposition of marked graphs

DSpace/Manakin Repository

aaK citaci nebo jako odkaz na tento záznam použijte identifikátor:

Show simple item record Schäfer, Mark Vogler, Walter Jančar, Petr 2006-10-04T07:46:54Z 2006-10-04T07:46:54Z 2005
dc.identifier.citation Applications and theory of Petri Nets 2005 : 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005. Proceedings. 2005, p. 365-384. Lecture notes in computer science, vol. 3536. en
dc.identifier.isbn 978-3-540-26301-2
dc.identifier.issn 0302-9743
dc.description.abstract STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondeterministic algorithm for decomposing STGs was suggested by Chu and improved by one of the present authors. To find the best possible result the algorithm might produce, it would be important to know to what extent nondeterminism influences the result, i.e. to what extent the algorithm is determinate. The result of the algorithm clearly depends on the partition of output signals that has to be chosen initially. In general, it also depends on the order of computation steps. We prove that for live marked graphs — a subclass of Petri nets of definite practical importance in the area of circuit design — the decomposition result depends only on the signal partition. In the proof, we also characterise redundant places in these marked graphs as shortcut places; this easy-to-apply graph-theoretic characterisation is of independent interest. en
dc.language.iso en en
dc.publisher Springer en
dc.relation.ispartofseries Applications and theory of Petri nets 2005 : 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005. Proceedings en
dc.relation.uri en
dc.title Determinate STG decomposition of marked graphs en
dc.type article en
dc.identifier.location Není ve fondu ÚK en
dc.identifier.doi 10.1007/11494744_21
dc.identifier.wos 000230367400021

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search



My Account