Conditions for Petri net solvable binary words
From MaRDI portal
Publication:5268428
DOI10.1007/978-3-662-53401-4_7zbMATH Open1366.68199OpenAlexW2512939597WikidataQ104379698 ScholiaQ104379698MaRDI QIDQ5268428FDOQ5268428
Authors: Kamila Barylska, Eike Best, Evgeny Erofeev, Łukasz Mikulski, Marcin Piatkowski 
Publication date: 20 June 2017
Published in: Transactions on Petri Nets and Other Models of Concurrency XI (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53401-4_7
Recommendations
Cites Work
- Introduction to algorithms.
- Marked directed graphs
- Understanding Petri Nets
- Properties of Conflict-Free and Persistent Petri Nets
- Characterisation of the state spaces of marked graph Petri nets
- Synthesis of bounded choice-free Petri nets
- Petri net synthesis
- Characterising Petri net solvable binary words
- Conditions for Petri net solvable binary words
Cited In (11)
- Target-oriented Petri net synthesis
- The power of prime cycles
- Conditions for Petri net solvable binary words
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- Investigating reversibility of steps in Petri nets
- Generating all minimal Petri net unsolvable binary words
- Characterising Petri net solvable binary words
- An efficient characterization of Petri net solvable binary words
- Reversing Steps in Petri Nets
- A characterization of solvability for a class of networks
- A graph-theoretical characterisation of state separation
Uses Software
This page was built for publication: Conditions for Petri net solvable binary words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268428)
