Flip-flop nets

DOI10.1007/3-540-60922-9_42MaRDI QIDQ4593957zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The synthesis problem for elementary net systems is NP-complete
• Polynomial algorithms for the synthesis of bounded nets
• scientific article; zbMATH DE number 1302048
• scientific article; zbMATH DE number 512821
• The synthesis problem of Petri nets

Cited in

(16)

• The synthesis problem for elementary net systems is NP-complete
• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
• On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
• The complexity of synthesizing elementary net systems relative to natural parameters
• Step semantics of Boolean nets
• Synthesis of Petri nets with whole-place operations and localities
• Narrowing down the hardness barrier of synthesizing elementary net systems
• On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
• The Complexity of Synthesis of b-Bounded Petri Nets
• Dualities between nets and automata induced by schizophrenic objects
• Boolean algebra of nets, their synthesis and analysis
• 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
• Regions of Petri nets with a/sync connections
• Applying regions

This page was built for publication: Flip-flop nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593957)