Equivalence and Preorder Checking for Finite-State Systems
Authors:
- Rance CleavelandRCRance Cleaveland
- Oleg SokolskyOSOleg Sokolsky
- 1 January 2001
- book chapter
- Published by Elsevier
- p. 391-424
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Branching time and abstraction in bisimulation semanticsJournal of the ACM, 1996
- Generating diagnostic information for behavioral preordersDistributed Computing, 1995
- Testing equivalence as a bisimulation equivalenceFormal Aspects of Computing, 1993
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Introduction to the ISO specification language LOTOSComputer Networks and ISDN Systems, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- A Calculus of Communicating Systems1980