Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
- 13 November 2001
- book chapter
- Published by Springer Nature
- p. 166-180
- https://doi.org/10.1007/3-540-45635-x_19
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Constraint Database Models Characterizing Timed BisimilarityPublished by Springer Nature ,2001
- An Introduction to the π-CalculusPublished by Elsevier ,2001
- A System for Tabled Constraint Logic ProgrammingPublished by Springer Nature ,2000
- XMC: A Logic-Programming-Based Verification ToolsetPublished by Springer Nature ,2000
- Computing Strong/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing ProcessesPublished by Springer Nature ,1999
- Symbolic transition graph with assignmentPublished by Springer Nature ,1996
- Symbolic bisimulationsTheoretical Computer Science, 1995
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987