On reachability equivalence for BPP-nets

DOI10.1016/S0304-3975(96)00147-8zbMath0901.68070MaRDI QIDQ1391745

Hsu-Chun Yen

Publication date: 22 July 1998

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

zbMATH Keywords

BPP-netreachability equivalence problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Context-free commutative grammars with integer counters and resets ⋮ A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application ⋮ Flatness and Complexity of Immediate Observation Petri Nets

Cites Work

• Normal Petri nets
• The polynomial-time hierarchy
• Commutative grammars: The complexity of uniform word problems
• The complexity of equivalence problems for commutative grammars
• Petri nets, commutative context-free grammars, and basic parallel processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On reachability equivalence for BPP-nets