Flip-flop nets

DOI10.1007/3-540-60922-9_42zbMath1379.68247OpenAlexW1500168942MaRDI QIDQ4593957

Vincent Schmitt

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_42

Mathematics Subject Classification ID

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

Related Items (14)

Step semantics of Boolean nets ⋮ Synthesis of Petri Nets with Whole-Place Operations and Localities ⋮ The synthesis problem for elementary net systems is NP-complete ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Hardness Results for the Synthesis of b-bounded Petri Nets ⋮ Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Regions of Petri nets with a/sync connections ⋮ The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs ⋮ Applying regions ⋮ The complexity of synthesizing elementary net systems relative to natural parameters ⋮ The Complexity of Synthesis of b-Bounded Petri Nets

This page was built for publication: Flip-flop nets