Compositional generation of home states in free choice nets-Reference-Cited by-同舟云学术

Compositional generation of home states in free choice nets

Published:1992-11 Issue:6 Volume:4 Page:572-581
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Best Eike¹,Cherkasova Ludmila²,Desel Jörg³

Affiliation:

1. Institut für Informatik, UniversitÄt Hildesheim, D-3200, Hildesheim, Germany

2. Institute of Informatics Systems, USSR Academy of Sciences, USSR

3. Institut für Informatik, Technische UniversitÄt München, München, Germany

Abstract

Abstract Free choice nets are a class of Petri nets which allow the modelling of concurrency and nondeterministic choice, but with the restriction that choices cannot be influenced externally. Home states are initial states which lead to a strongly connected state graph, that is, a home state can be reached from any of its successor states. The main result of this paper characterises the home states of a well-formed free choice net compositionally by recourse to its decomposition into T-components.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01211475.pdf

Reference7 articles.

1. Partial order behaviour and structure of Petri nets

2. Best E. Desel J. and Esparza J.: Traps Characterise Home States in Free Choice Systems. To appear in Theoretical Computer Science (1992).

3. Marked directed graphs

4. Desel J. and Esparza J.: Reachability in Reversible Free Choice Systems. Proc. STACS 91 G. Choffrut and M. Jantzen (eds) Lecture Notes in Computer Science 480 384–397 Springer-Verlag (1991).

5. Synchronisationsgraphen

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Composition of Functional Petri Nets;Formal Methods in Manufacturing Systems;2013