Factorisation of transition systems
From MaRDI portal
Recommendations
- Factorisation of Petri net solvable transition systems
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Decomposition of Petri nets
- scientific article; zbMATH DE number 1305002
- Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
Cites work
- scientific article; zbMATH DE number 3471613 (Why is no real title available?)
- scientific article; zbMATH DE number 557977 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Comparing transition systems with independence and asynchronous transition systems
- Petri net synthesis
- Synthesis of bounded choice-free Petri nets
Cited in
(9)- A decomposition theorem for finite persistent transition systems
- Multiplicative transition systems
- Decomposition and factorization of chemical reaction transducers
- scientific article; zbMATH DE number 3917745 (Why is no real title available?)
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- scientific article; zbMATH DE number 1059332 (Why is no real title available?)
- Factorisation of Petri net solvable transition systems
- Articulation of Transition Systems and Its Application to Petri Net Synthesis
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
This page was built for publication: Factorisation of transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647774)