Step semantics of Boolean nets
From MaRDI portal
Publication:2376982
DOI10.1007/s00236-012-0170-2zbMath1272.68307OpenAlexW1983695368MaRDI QIDQ2376982
Marta Pietkiewicz-Koutny, H. C. M. Kleijn, Maciej Koutny, Grzegorz Rozenberg
Publication date: 26 June 2013
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-012-0170-2
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
Step semantics of Boolean nets ⋮ Non-atomic Transition Firing in Contextual Nets ⋮ Signal set tissue systems and overlapping localities ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs ⋮ The Complexity of Synthesis of b-Bounded Petri Nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial (set) 2-structures. I: Basic notions and the representation problems
- The synthesis problem for elementary net systems is NP-complete
- The synthesis problem of Petri nets
- Contextual nets
- Step semantics of Boolean nets
- A Connector Algebra for P/T Nets Interactions
- Representations of Petri Net Interactions
- Flip-flop nets
- Logic Synthesis for Asynchronous Controllers and Interfaces
- Synthesis of Nets with Step Firing Policies
This page was built for publication: Step semantics of Boolean nets
