Unfolding and finite prefix for nets with read arcs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1466, Issue , 1998, Pages 501-516

  Vogler, Walter ^a   Semenov, Alex ^b   Yakovlev, Alex ^b  

^a UNIVERSITY OF AUGSBURG   (Germany)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Asynchronous circuits; Branching processes; Concurrency semantics; Hazards; Petri nets with read arcs; Read persistence; Unfolding

Indexed keywords

HAZARDS; PETRI NETS; PROBABILITY DISTRIBUTIONS; SEMANTICS;

ASYNCHRONOUS CIRCUITS; BRANCHING PROCESS; CONCURRENCY SEMANTICS; READ ARCS; READ-PERSISTENCE; UNFOLDING;

COMPUTER CIRCUITS;

EID: 84945928892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055644     Document Type: Conference Paper

References (17)

1. P. Baldan, A. Corradini and U. Montanari. An event structure semantics for P/T contextual nets: asymmetric event structures, to appear in Proc. FoSSaCS’98, April 1998, Lisbon.
2. N. Busi and R. Gorrieri. A Petri net semantics for 7r-calculus. In L. Insup and S. Smolka, editors, CONCUR 95, Lect. Notes Comp. Sci. 962, 145-159. Springer, 1995.
3. N. Busi and M. Pinna. Non-sequential semantics for contextual P/T-nets. In J. Billington and W. Reisig, editors, Applications and Theory of Petri Nets 1996, Lect. Notes Comp. Sci. 1091, 113-132. Springer, 1996.
4. S. Christensen and N.D. Hansen. Coloured Petri nets extended with place capacities, test arcs, and inhibitor arcs. In M. Ajmone-Marsan, editor, Applications and Theory of Petri Nets 1993, Lect. Notes Comp. Sci. 691, 186-205. Springer, 1993.
5. J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28: 575-591, 1991.
6. J. Esparza and G. Bruns. Trapping mutual exclusion in the box calculus. Theor. Comput. Sci., 153: 95-128, 1996.
7. J. Esparza and S. Melzer. Model Checking LTL Using Constraint Programming In P. Azema and G. Balbo, editors, Applications and Theory of Petri Nets 1997, Lect. Notes Comp. Sci. 1248, 1-20. Springer, 1997.
8. J. Esparza, S. Romer, and W. Vogler. An improvement of McMillan’s unfolding algorithm. In T. Margaria and B. Steffen, editors, TACAS 96, Lect. Notes Comp. Sci. 1055, 87-106. Springer, 1996.
9. R. Janicki and M. Koutny. Semantics of inhibitor nets. Information and Computation, 123: 1-16, 1995.
10. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, 1993.
11. U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32: 545-596, 1995.
12. M. Nielsen, G.D. Plotkin, and G. Winskel. Petri nets, event structures and domains I. Theor. Comput. Sci., 13: 85-108, 1981.
13. A. Semenov and A. Yakovlev. Contextual net unfolding and asynchronous circuit verification Technical Report Series № 572, Computing Science, University of Newcastle upon Tyne, April 1997. See http://www.cs.ncl.ac.uk/research/trs/lists/97.html.
14. W. Vogler. Executions: A New Partial Order Semantics of Petri Nets. Theor. Comput. Sci., 91: 205-238, 1991.
15. W. Vogler. Partial order semantics and read arcs. Technical Report 19971, Inst. f. Informatik, Univ. Augsburg, 1997. See http://www.math.uni-augsburg.de/~vogler/; extended abstract in MFCS 97, LNCS 1295, 508-517.
16. W. Vogler, A. Semenov and A. Yakovlev. Unfolding and finite prefix for nets with read arcs. Technical Report Series № 634, Computing Science, University of Newcastle upon Tyne, February 1998 (can be obtained from: ftp://sadko.ncl.ac.uk/pub/incoming/TRs/).
17. A. Yakovlev, A.M. Koelmans, A. Semenov and D.J. Kinniment. Modelling, analysis and synthesis of asynchronous control circuits using Petri nets. INTEGRATION: the VLSI Journal, 21: 143-170, 1996.