On the Petri net realization of context-free graphs

Theoretical Computer Science

Volumn 258, Issue 1-2, 2001, Pages 573-598

  Darondeau, Philippe ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Graph grammars; Petri nets; Polyhedral cones; Regions; Semi linear sets

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; CONTEXT FREE GRAMMARS; THEOREM PROVING;

CONTEXT-FREE GRAPHS;

PETRI NETS;

EID: 0034915489     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00162-6     Document Type: Article

References (25)

1. Polynomial algorithms for the synthesis of bounded nets
2. On the synthesis of general Petri nets
3. Application des techniques de synthèse de réseaux de Petri bornés à la répartition d'automates réactifs
4. On the regular structure of prefix rewriting
5. Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
6. Complete state encoding based on the theory of regions
7. Deriving unbounded Petri nets from formal languages
8. Petri nets and automata with concurrency relations - An adjunction
9. Partial (set) 2-structures; Part I: Basic notions and the representation problem
10. Partial (set) 2-structures; Part II: State spaces of concurrent systems
11. Rational sets in commutative monoids
12. Bounded algol-like languages
13. Semigroups, Presburger formulas, and languages
14. Petri nets and step transition systems
15. The theory of ends, pushdown automata, and second-order logic
16. Language-generating devices
17. On context-free languages
18. A library for doing polyhedral operations