On the Petri net realization of context-free graphs

DOI10.1016/S0304-3975(00)00162-6zbMath0973.68171OpenAlexW2094825155MaRDI QIDQ5941208

Philippe Darondeau

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00162-6

zbMATH Keywords

regionsPetri netsgraph grammarspolyhedral conessemi-linear sets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (3)

The synthesis of Petri nets from path-automatic specifications ⋮ Regions of Petri nets with a/sync connections ⋮ Applying regions

Uses Software

• PolyLib
• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the regular structure of prefix rewriting
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Partial (set) 2-structures. II: State spaces of concurrent systems
• The theory of ends, pushdown automata, and second-order logic
• The synthesis of Petri nets from path-automatic specifications
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• PETRI NETS AND STEP TRANSITION SYSTEMS
• A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
• Bounded Algol-Like Languages
• On Context-Free Languages
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities

This page was built for publication: On the Petri net realization of context-free graphs