Net processes correspond to derivation processes in graph grammars

DOI10.1016/0304-3975(86)90124-6zbMath0607.68058OpenAlexW1969395632MaRDI QIDQ1085621

Anne Wilharm, Hans-Joerg Kreowski

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90124-6

zbMATH Keywords

Petri netssimulationsgraph grammarsconflict-free processesnet processesnon-sequential behaviour

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

Concurrent graph and term graph rewriting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item