On simulation-checking with sequential systems

DOI10.1007/3-540-44464-5_11MaRDI QIDQ2766532zbMATH OpenFDO

Authors Antonin Kučera

Publication date 28 January 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44464-5_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Simulation and bisimulation over one-counter processes
• The complexity of bisimilarity-checking for one-counter processes.
• Simulation over one-counter nets is PSPACE-complete
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
• Simulation problems over one-counter nets

Cited in

(9)

• The complexity of bisimilarity-checking for one-counter processes.
• DP lower bounds for equivalence-checking and model-checking of one-counter automata
• On simulation, subtyping and substitutability in sequential object systems
• Model checking downward simulations
• scientific article; zbMATH DE number 2087430 (Why is no real title available?)
• Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
• On history-deterministic one-counter nets
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
• EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system

This page was built for publication: On simulation-checking with sequential systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766532)