scientific article; zbMATH DE number 1500527
From MaRDI portal
Publication:4501545
zbMATH Open0962.68121MaRDI QIDQ4501545FDOQ4501545
Authors: Petr Jančar, Antonin Kučera, Faron Moller 
Publication date: 4 September 2000
Title of this publication is not available (Why is that?)
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (13)
- The complexity of bisimilarity-checking for one-counter processes.
- Bisimulation equivalence is decidable for one-counter processes
- Constrained simulations, nested simulation semantics and counting bisimulations
- DP lower bounds for equivalence-checking and model-checking of one-counter automata
- Trace inclusion for one-counter nets revisited
- Countdown games, and simulation on (succinct) one-counter nets
- Simulation preorder over simple process algebras
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
- Trace Inclusion for One-Counter Nets Revisited
- Process Bisimulation Via a Graphical Encoding
- Title not available (Why is that?)
- Title not available (Why is that?)
- A general approach to comparing infinite-state systems with their finite-state specifications
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)
