Minimizing transition systems for name passing calculi: A co-algebraic formulation

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

Volumn 2303, Issue , 2002, Pages 129-143

  Ferrari, Gianluigi ^a   Montanari, Ugo ^a   Pistore, Marco ^b  

^a UNIVERSITY OF PISA   (Italy)

^b ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; COMPUTATION THEORY;

LABELLED TRANSITION SYSTEMS; MINIMIZATION ALGORITHMS; NAME PASSING CALCULI; NAME-PASSING PROCESS CALCULI; NUMBER OF STATE; TRANSITION SYSTEM;

PATHOLOGY;

EID: 84948955465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_10     Document Type: Conference Paper

References (21)

1. P. Aczel, N. Mendler, A Final Coalgebra Theorem, in Category Theory and Computer Science, LNCS 389, 1989.
2. A. Corradini, R. Heckel, U. Montanari, Compositional SOS and Beyond: A Coalgebraic View of Open Systems, Theoretical Computer Science, to appear.
3. E. Clarke and J. Wing Eds. Formal Methods: State of the Art and Future Directions. ACM Comp. Surv., December 1996.
4. M. Dam, On the decidabilityof process equivalences for the p-calculus. Theoretical Computer Science, 183(2):215–228, 1997.
5. B. Jacobs, J. Rutten A tutorial on (co)algebras and (co)induction. Bulletin of EATCS, 62, 222-259, 1997.
6. J.-C. Fernandez, An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming 13, 219-236, 1990.
7. G. Ferrari, G. Ferro, S. Gnesi, U. Montanari, M. Pistore, G. Ristori. An Automatabased Verification Environment for Mobile Processes In TACAS’97, LNCS 1217, 1997.
8. G. Ferrari, S. Gnesi, U. Montanari, M. Pistore, G. Ristori, Verifying Mobile Processes in the HAL Environment. CAV’98, LNCS 1427, 1998.
9. P. Kannellakis, S. Smolka, CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86, 43-68, 1990.
10. C. Meadows Open Issues in Formal Methods for Cryptographic Protocol Analysis, Proceedings of DISCEX 2000, IEEE Press, 237-250, 2000.
11. R. Milner, J. Parrow and D. Walker. A calculus of mobile processes, Part I and II. Information and Computation, 100(1):1–77, 1992.
12. U. Montanari and M. Pistore. Checking bisimilarityfor finitary p-calculus. In Proc. CONCUR’95, LNCS 962. Springer Verlag, 1995.
13. U. Montanari and M. Pistore. Historydep endent verification for partial order systems. In Partial Order Methods in Verification, DIMACS Series, Vol. 29. American Mathematical Society, 1997.
14. U. Montanari, M. Pistore and D. Yankelevich. Efficient minimization up to location equivalence. In Proc. ESOP’96, LNCS 1058. Springer Verlag, 1996.
15. U. Montanari and M. Pistore. History-Dependent Automata. IRST Technical Report 0112-14, Istituto Trentino di Cultura, December 2001.
16. U. Montanari and M. Pistore. p-calculus, structured coalgebras and minimal HDautomata. In Proc. MFCS’2000, LNCS 1893, Springer Verlag, 2000.
17. M. Pistore and D. Sangiorgi, A partition refinement algorithm for the p-calculus. Information and Computation 164, 263-321, 2001.
18. R. Paige, R. E. Tarjan. Three partition refinement algorithms, SIAM Journal on Computing 16(6) 973–989, 1987.
19. J. J. M. M. Rutten. Universal coalgebra: a theoryof systems. Technical Report CSR9652, CWI, 1996. To appear in Theoretical Computer Science.
20. D. Turi, G. D. Plotkin, Towards a Mathematical Operational Semantics, In Proc. Logic in Computer Science 97, IEEE Press, 280-291, 1997.
21. J. Warell, Terminal Sequences for Accessible Endofunctors, In Proc. CMCS’99, ENCTS 19, 1999.