Local and symbolic bisimulation using tabled constraint logic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2237, Issue , 2001, Pages 166-180

  Basu, Samik ^a   Mukund, Madhavan ^b   Ramakrishnan, C R ^a   Ramakrishnan, I V ^a   Verma, Rakesh ^c  

^a Stony Brook University   (United States)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

^c University of Houston   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; ENCODING (SYMBOLS); SIGNAL ENCODING; SPACE RESEARCH;

BEHAVIORAL EQUIVALENCE; CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT LOGIC PROGRAMS; INFINITE STATE CONCURRENT SYSTEMS; INFINITE STATE SYSTEMS; STATE SPACE EXPLORATION; SYMBOLIC BISIMULATION; SYMBOLIC TRANSITION SYSTEMS;

LOGIC PROGRAMMING;

EID: 84937200470     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_19     Document Type: Conference Paper

References (13)

1. CADP. Caesar/Aldebaran Development Package c1.112, 2001. Available from http://www.inrialpes.fr/vasy/cadp.html.
2. B. Cui and D. S. Warren. A system for tabledconstrain t logic programming. In Computational Logic, pages 478–492, 2000.
3. CWB-NC. The Concurrency Workbench of New Century v1.1.1, 2001. Available from www.cs.sunysb.edu/∼cwb.
4. M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353–389, 1995.
5. P.C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, andthree problems of equivalence. Information and Computation, 86(1):43–68, May 90.
6. Z. Li and H. Chen. Computing strong/weak bisimulation equivalences andobservation congruence for value-passing processes. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 300–314, 1999.
7. H. Lin. Symbolic transition graphs with assignments. In Concurrency Theory (CONCUR), pages 50–65, 1996.
8. S. Mukhopadhyay and A. Podelski. Constraint database models characterizing timedbisimilarity. In Practical Applications of Declarative Language, 2001.
9. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973–989, December 1987.
10. J. Parrow. An introduction to π-calculus. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, chapter 8, pages 479–544. North- Holland, 2001.
11. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabledresolution. In Proceedings of the 9th International Conference on Computer-Aided Verification (CAV’97), Haifa, Israel, July 1997. Springer-Verlag.
12. C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, Y. Dong, X. Du, A. Roychoudhury, and V. N. Venkatakrishnan. XMC: A logic-programming-basedv erification toolset. In Computer Aided Verification (CAV), 2000.
13. XSB. The XSB logic programming system v2.3, 2001. Available from http://www.cs.sunysb.edu/∼sbprolog.