Conditions for Petri net solvable binary words

DOI10.1007/978-3-662-53401-4_7MaRDI QIDQ5268428zbMATH OpenOpenAlexWikidataFDO

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

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)

Recommendations

• Characterising Petri net solvable binary words
• An efficient characterization of Petri net solvable binary words
• Generating all minimal Petri net unsolvable binary words
• A complexity characteristic of Petri net languages
• Groups whose word problem is a Petri net language

Cites work

• Characterisation of the state spaces of marked graph Petri nets
• Characterising Petri net solvable binary words
• Conditions for Petri net solvable binary words
• Introduction to algorithms.
• Marked directed graphs
• Petri net synthesis
• Properties of Conflict-Free and Persistent Petri Nets
• Synthesis of bounded choice-free Petri nets
• Understanding Petri Nets

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
• A characterization of solvability for a class of networks
• Reversing Steps in Petri Nets
• A graph-theoretical characterisation of state separation

Describes a project that uses

Uses Software

• GitHub
• APT

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)