A tool set for deciding behavioral equivalences
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Bounded-memory algorithms for verification on-the-flyLecture Notes in Computer Science, 1992
- “On the fly” verification of behavioural equivalences and preordersLecture Notes in Computer Science, 1992
- Error diagnosis in finite communicating systemsLecture Notes in Computer Science, 1992
- Safety for branching time semanticsLecture Notes in Computer Science, 1991
- An implementation of an efficient algorithm for bisimulation equivalenceScience of Computer Programming, 1990
- The concurrency workbenchLecture Notes in Computer Science, 1990
- On-line model-checking for finite linear temporal logic specificationsLecture Notes in Computer Science, 1990
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984