Trace Inclusion for One-Counter Nets Revisited

DOI10.1007/978-3-319-11439-2_12zbMath1393.68117OpenAlexW1746460710MaRDI QIDQ3447702

Patrick Totzke, Piotr Hofman

Publication date: 28 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11439-2_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Trace Inclusion for One-Counter Nets Revisited ⋮ On history-deterministic one-counter nets ⋮ Universality Problem for Unambiguous VASS ⋮ Complexity Hierarchies beyond Elementary ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Undecidability of bisimilarity for Petri nets and some related problems
• Deterministic one-counter automata
• Petri nets and regular processes
• LTL with the freeze quantifier and register automata
• Simulation Over One-counter Nets is PSPACE-Complete
• Trace Inclusion for One-Counter Nets Revisited
• Decidability of Weak Simulation on One-Counter Nets
• Equivalences of Pushdown Systems Are Hard
• Equivalence of deterministic one-counter automata is NL-complete

This page was built for publication: Trace Inclusion for One-Counter Nets Revisited