Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
DOI10.1051/ITA/1994280200731zbMATH Open0890.68088OpenAlexW183048101MaRDI QIDQ4362279FDOQ4362279
Authors: Laure Petrucci, Alain Finkel 
Publication date: 3 December 1997
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92471
Recommendations
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The equality problem for vector addition systems is undecidable
- Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
- Title not available (Why is that?)
Cited In (17)
- Compositional analysis of Petri nets
- Decomposition of Petri nets
- Union decomposition of Petri net
- Covering steps graphs of time Petri nets
- On the Petri net realization of context-free graphs
- Compositional reachability in Petri nets
- Automatic decomposition of Petri nets into automata networks -- a synthetic account
- Title not available (Why is that?)
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic
- Factorisation of transition systems
- Title not available (Why is that?)
- The ins and outs of Petri net composition
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
- Petri net reactive modules
- Dynamic feature research into simplifying technology of Petri nets
- Simple Composition of Nets
- Title not available (Why is that?)
This page was built for publication: Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4362279)
