Deciding bisimulation equivalences for a class of non-finite-state programs
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 421-433
- https://doi.org/10.1007/bfb0029004
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Deciding bisimulation equivalences for a class of non-finite-state programsPublished by Springer Nature ,2005
- Verifying a protocol using relativized bisimulationLecture Notes in Computer Science, 1987
- Observation equivalence as a testing equivalenceTheoretical Computer Science, 1987
- Algebraic specification and verification of communication protocolsScience of Computer Programming, 1985
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- CCS expressions, finite state processes, and three problems of equivalencePublished by Association for Computing Machinery (ACM) ,1983
- Automatic verification of finite state concurrent system using temporal logic specificationsPublished by Association for Computing Machinery (ACM) ,1983
- A formal description of the UNIX operating systemPublished by Association for Computing Machinery (ACM) ,1983
- Verification of HDLCIEEE Transactions on Communications, 1982
- Even Simple Programs Are Hard To AnalyzeJournal of the ACM, 1977