The Power of Prime Cycles
From MaRDI portal
Publication:2822651
DOI10.1007/978-3-319-39086-4_5zbMath1346.68126MaRDI QIDQ2822651
Publication date: 4 October 2016
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39086-4_5
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Characterisation of the state spaces of marked graph Petri nets
- Petri net synthesis
- Partial (set) 2-structures. I: Basic notions and the representation problems
- A decomposition theorem for finite persistent transition systems
- The synthesis problem for elementary net systems is NP-complete
- Distributing finite automata through Petri net synthesis
- Marked directed graphs
- On Distributability of Petri Nets
- Petri Net Distributability
- Finding All the Elementary Circuits of a Directed Graph
- Conditions for Petri Net Solvable Binary Words
- Deadlock-Freeness Analysis of Continuous Mono-T-Semiflow Petri Nets
- Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
- Lectures on Concurrency and Petri Nets