Some complexity results on transition systems and elementary net systems

DOI10.1016/0304-3975(94)90112-0zbMath0829.68090OpenAlexW2027775564MaRDI QIDQ1346631

Kunihiko Hiraishi

Publication date: 6 April 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90112-0

zbMATH Keywords

transition systemsnet systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15)

Related Items (7)

Polynomial algorithms for the synthesis of bounded nets ⋮ The synthesis problem for elementary net systems is NP-complete ⋮ 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 ⋮ The complexity of synthesizing elementary net systems relative to natural parameters ⋮ The Complexity of Synthesis of b-Bounded Petri Nets

Cites Work

• Partial (set) 2-structures. I: Basic notions and the representation problems
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Elementary transition systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Some complexity results on transition systems and elementary net systems