scientific article; zbMATH DE number 1500527
From MaRDI portal
Publication:4501545
Recommendations
Cited in
(18)- Trace inclusion for one-counter nets revisited
- Constrained simulations, nested simulation semantics and counting bisimulations
- Countdown games, and simulation on (succinct) one-counter nets
- The complexity of bisimilarity-checking for one-counter processes.
- Bisimulation equivalence and regularity for real-time one-counter automata
- Simulation problems over one-counter nets
- Process Bisimulation Via a Graphical Encoding
- Simulation over one-counter nets is PSPACE-complete
- Trace inclusion for one-counter nets revisited
- Bisimulation equivalence is decidable for one-counter processes
- EXPSPACE-complete variant of countdown games, and simulation on succinct one-counter nets
- scientific article; zbMATH DE number 1696434 (Why is no real title available?)
- scientific article; zbMATH DE number 2087430 (Why is no real title available?)
- A general approach to comparing infinite-state systems with their finite-state specifications
- Simulation preorder over simple process algebras
- Decidability of weak simulation on one-counter nets
- DP lower bounds for equivalence-checking and model-checking of one-counter automata
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501545)
