Subset languages of Petri nets. I: The relationship to string languages and normal forms

DOI10.1016/0304-3975(83)90021-XzbMath0531.68029MaRDI QIDQ788496

R. Verraedt, Grzegorz Rozenberg

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

normal formPetri netsstring languagefiring sequencesubset language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Concurrent bisimulations in Petri nets ⋮ Classifying invariant structures of step traces ⋮ Step semantics for ``true concurrency with recursion ⋮ Petri net semantics of priority systems ⋮ Maximality preserving bisimulation ⋮ Structure of concurrency ⋮ Step failures semantics and a complete proof system ⋮ Subset languages of Petri nets. II. Closure properties

Cites Work

• Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979. Ed. by Wilfried Brauer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subset languages of Petri nets. I: The relationship to string languages and normal forms