Aspects mathématiques des réseaux de pétri
Explore this paper's citation graph
- Type
- article
- Published
- 1988-01-01
- Cited by
- 42
- References
- 0
- OpenAlex
- https://openalex.org/W583660155
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:119039036
Keywords
Philosophy
References
No references recorded for this paper.
Cited by
- Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs
- Grammaires de graphes et langages formels. (Graph grammars and formal languages)
- Chip-Firing Games on Directed Graphs
- Groupe modulaire et cartes combinatoires : génération et comptage
- A System of Interaction and Structure IV: The Exponentials
- On Decidability of the Control Reachability Problem in the Asynchronous pi-Calculus
- Blocking a transition in a free choice net and what it tells about its throughput
- Abstraction and abstraction refinement in the verification of graph transformation systems
- On message deliverability and non-uniform receptivity
- Decidability of single-rate hybrid Petri nets
- On the Decidability of Fragments of the Asynchronous pi-Calculus
- Multiple conjugacy problem in graphs of free abelian groups
- A system of interaction and structure IV: The exponentials and decomposition
- Resource control graphs
- Petri Net Languages and Infinite Subsets of m
- Decidability results in First–Order Hybrid Petri Nets
- Incremental construction of coverability graphs
- Alternating two-way AC-tree automata
- On the Petri net realization of context-free graphs
- Cycles and communicating classes in membrane systems and molecular dynamics
Related papers
- Parallel Program Schemata
- An Algorithm for the General Petri Net Reachability Problem
- On Context-Free Languages
- Petri nets: Properties, analysis and applications
- Linear Logic
- Vector addition tree automata
- Decidability of reachability in vector addition systems (Preliminary Version)
- Semigroups, Presburger formulas, and languages.