Conditions for Petri Net Solvable Binary Words

DOI10.1007/978-3-662-53401-4_7zbMATH Open1366.68199OpenAlexW2512939597WikidataQ104379698 ScholiaQ104379698MaRDI QIDQ5268428FDOQ5268428

Marcin Piatkowski, Eike Best, Evgeny Erofeev, Kamila Barylska, Łukasz Mikulski

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

zbMATH Keywords

synthesisPetri netslabelled transition systemsbinary words

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Marked directed graphs
• Understanding Petri Nets
• Properties of Conflict-Free and Persistent Petri Nets
• Characterisation of the state spaces of marked graph Petri nets
• Petri net synthesis
• Characterising Petri Net Solvable Binary Words
• Conditions for Petri Net Solvable Binary Words

Cited In (9)

• Conditions for Petri Net Solvable Binary Words
• Investigating Reversibility of Steps in Petri Nets
• A Graph-Theoretical Characterisation of State Separation
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Generating all minimal Petri net unsolvable binary words
• The Power of Prime Cycles
• Target-oriented Petri Net Synthesis
• Reversing Steps in Petri Nets
• Characterising Petri Net Solvable Binary Words

Uses Software

• APT
• GitHub

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)