The concurrency workbench
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Deciding bisimulation equivalences for a class of non-finite-state programsPublished by Springer Nature ,2005
- Tableau-based model checking in the propositional mu-calculusActa Informatica, 1990
- Bisimulation through probabilistic testing (preliminary report)Published by Association for Computing Machinery (ACM) ,1989
- Local model checking in the modal mu-calculusLecture Notes in Computer Science, 1989
- Characteristic formulaePublished by Springer Nature ,1989
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Submodule construction as equation solving in CCSPublished by Springer Nature ,1987
- Modal logics for communicating systemsTheoretical Computer Science, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Testing equivalences for processesTheoretical Computer Science, 1984