Petri net synthesis
From MaRDI portal
Publication:897109
DOI10.1007/978-3-662-47967-4zbMath1351.68003MaRDI QIDQ897109
Philippe Darondeau, Eric Badouel, Luca Bernardinello
Publication date: 16 December 2015
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01237142/file/Badouel_Petri%20Net%20Synthesis_Front%20matter.pdf
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
Synthesis of Persistent Systems, Conditions for Petri Net Solvable Binary Words, Characterisation of the state spaces of marked graph Petri nets, Applying regions, Sufficient conditions for the marked graph realisability of labelled transition systems, Factorisation of transition systems, Signal set tissue systems and overlapping localities, Bounded choice-free Petri net synthesis: algorithmic issues, Characterising Petri Net Solvable Binary Words, The Power of Prime Cycles, Petri Net Synthesis for Restricted Classes of Nets, A Graph-Theoretical Characterisation of State Separation, Synthesis of Petri Nets with Whole-Place Operations and Localities
