A note on decidability of reachability for conditional Petri nets

Acta Cybernetica

Volumn 14, Issue 3, 1999, Pages 455-459

  Ţiplea, Ferucio Laurenţiu ^a   Bǎdǎrǎu, Cristina ^a  

^a ALEXANDRU IOAN CUZA UNIVERSITY OF IASI   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30844472407     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. H.D. Burkhard. Ordered Firing in Petri Nets, Journal of Information Processing and Cybernetics EIK 17, 1981, 71-86.
2. H.D. Burkhard. What Gives Petri Nets More Computational Power, Preprint 45, Sektion Mathematik, Humboldt-Universität zu Berlin, 1982.
3. E.W. Mayr. An Algorithm for the General Petri Net Reachability Problem, Proceedings of the 13rd Annual ACM STOC, 1981, 238-246.
4. J.L. Peterson. Petri Net Theory and the Modeling of Systems, Prentice-Hall, 1981.
5. F.L. Ţiplea, T. Jucan, C. Masalagiu. Conditional Petri net languages, Journal of Information Processing and Cybernetics EIK 27, 1991, 55-66.
6. F.L. Ţiplea. On Conditional Grammars and Conditional Petri Nets, in Mathematical Aspects of Natural and Formal Languages (Gh. Pǎun, ed.), World Scientific Series in Computer Science vol. 43, Singapore, 1994, 431-456.