Transition systems of Elementary Net Systems with inhibitor arcs

DOI10.1007/3-540-63139-9_43MaRDI QIDQ6487381zbMATH OpenFDO

Authors Marta Pietkiewicz-Koutny

Publication date 9 December 2022

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1786642
• scientific article; zbMATH DE number 1435986
• Synthesis of nets with inhibitor arcs
• Process semantics of general inhibitor nets
• scientific article; zbMATH DE number 1696460

Cites work

• scientific article; zbMATH DE number 4193145 (Why is no real title available?)
• scientific article; zbMATH DE number 107452 (Why is no real title available?)
• scientific article; zbMATH DE number 821282 (Why is no real title available?)
• Concurrent Machines
• Contextual nets
• Elementary transition systems
• Formal verification of parallel programs
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Semantics of inhibitor nets

Cited in

(9)

• The Complexity of Synthesis of b-Bounded Petri Nets
• scientific article; zbMATH DE number 1786642 (Why is no real title available?)
• Synthesis of nets with inhibitor arcs
• On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
• scientific article; zbMATH DE number 1059332 (Why is no real title available?)
• On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
• On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
• Reconfigurable Petri nets with transition priorities and inhibitor arcs

This page was built for publication: Transition systems of Elementary Net Systems with inhibitor arcs

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