Deciding bisimulation equivalences for a class of non-finite-state programs
From MaRDI portal
Publication:1317428
DOI10.1006/inco.1993.1069zbMath0799.68133OpenAlexW1997387389MaRDI QIDQ1317428
Publication date: 24 March 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/63ec76ee608a90cd9866058dc0550496ae96071c
NP-hardbisimulationsobservation equivalencestrong equivalenceautomatic program verificationinfinite-state programs
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Inferring Canonical Register Automata, Minimal transition systems for history-preserving bisimulation, On the decidability of process equivalences for the π-calculus, On the decidability of process equivalences for the \(\pi\)-calculus, Automated analysis of mutual exclusion algorithms using CCS, Symbolic bisimulations, Well-structured transition systems everywhere!, Ensuring completeness of symbolic verification methods for infinite-state systems, Equivalence Checking for a Finite Higher Order π-Calculus, Deciding bisimulation equivalences for a class of non-finite-state programs, A complexity analysis of bisimilarity for value-passing processes, Asynchronous process calculi: The first- and higher-order paradigms, Model checking of systems with many identical timed processes, A partition refinement algorithm for the \(\pi\)-calculus, Undecidable verification problems for programs with unreliable channels
