Deciding bisimulation equivalences for a class of non-finite-state programs
From MaRDI portal
Publication:5096175
DOI10.1007/BFb0029004zbMath1492.68086OpenAlexW1838042250MaRDI QIDQ5096175
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0029004
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Observation equivalence as a testing equivalence
- Calculi for synchrony and asynchrony
- A calculus of communicating systems
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Testing equivalences for processes
- Algebraic specification and verification of communication protocols
- A Theory of Communicating Sequential Processes
- Even Simple Programs Are Hard To Analyze
- Bisimulation can't be traced
- Unnamed Item
This page was built for publication: Deciding bisimulation equivalences for a class of non-finite-state programs