[图书][B] Petri net synthesis
E Badouel, L Bernardinello, P Darondeau - 2015 - Springer
Eric Badouel · Luca Bernardinello Philippe Darondeau Page 1 Texts in Theoretical Computer
Science An EATCS Series Petri Net Synthesis Eric Badouel · Luca Bernardinello Philippe …
Science An EATCS Series Petri Net Synthesis Eric Badouel · Luca Bernardinello Philippe …
Elementary net synthesis remains NP-complete even for extremely simple inputs
R Tredup, C Rosenke, K Wolf - Application and Theory of Petri Nets and …, 2018 - Springer
Elementary net systems (ENS) are the most fundamental class of Petri nets. Their synthesis
problem has important applications in the design of digital hardware and commercial …
problem has important applications in the design of digital hardware and commercial …
The complexity of synthesis for 43 boolean petri net types
R Tredup, C Rosenke - Theory and Applications of Models of Computation …, 2019 - Springer
Synthesis for a type of Petri nets is the problem of finding, for a given transition system A, a
Petri net N of this type having a state graph that is isomorphic to A, if such a net exists. This …
Petri net N of this type having a state graph that is isomorphic to A, if such a net exists. This …
The Complexity of Synthesizing -Equipped Boolean Petri Nets from g-Bounded Inputs
R Tredup - Transactions on Petri Nets and Other Models of …, 2021 - Springer
Boolean Petri nets equipped with nop nop allow places and transitions to be independent by
being related by nop nop. We characterize for any fixed g ∈ N g∈ N the computational …
being related by nop nop. We characterize for any fixed g ∈ N g∈ N the computational …
[PDF][PDF] On the Hardness of Synthesizing Boolean Nets.
R Tredup, C Rosenke - ATAED@ Petri Nets/ACSD, 2019 - ceur-ws.org
Boolean Petri nets are differentiated by types of nets based on which of the interactions nop,
inp, out, set, res, swap, used, and free they apply or spare. From the 256 thinkable types only …
inp, out, set, res, swap, used, and free they apply or spare. From the 256 thinkable types only …
Non-atomic transition firing in contextual nets
The firing rule for Petri nets assumes instantaneous and simultaneous consumption and
creation of tokens. In the context of ordinary Petri nets, this poses no particular problem …
creation of tokens. In the context of ordinary Petri nets, this poses no particular problem …
Reaction mining for reaction systems
Reaction systems are a formal model for computational processing in which reactions
operate on sets of entities (molecules) providing a framework for dealing with qualitative …
operate on sets of entities (molecules) providing a framework for dealing with qualitative …
The complexity of synthesizing NOP-equipped Boolean nets from G-bounded inputs (technical report)
R Tredup - arXiv preprint arXiv:1911.05834, 2019 - arxiv.org
Boolean Petri nets equipped with nop allow places and transitions to be independent by
being related by nop. We characterize for any fixed natural number g the computational …
being related by nop. We characterize for any fixed natural number g the computational …
Tracking down the bad guys: reset and set make feasibility for flip-flop net derivatives NP-complete
R Tredup - arXiv preprint arXiv:1909.05968, 2019 - arxiv.org
Boolean Petri nets are differentiated by types of nets $\tau $ based on which of the
interactions nop, inp, out, set, res, swap, used, and free they apply or spare. The synthesis …
interactions nop, inp, out, set, res, swap, used, and free they apply or spare. The synthesis …
Towards completely characterizing the complexity of boolean nets synthesis
R Tredup, C Rosenke - arXiv preprint arXiv:1806.03703, 2018 - arxiv.org
Boolean nets are Petri nets that permit at most one token per place. Research has
approached this important subject in many ways which resulted in various different classes …
approached this important subject in many ways which resulted in various different classes …