Abstract
We address the problem of minimizing labelled transition systems for name passing calculi. We show how the co-algebraic formulation of automata with naming directlysuggests an effective minimization algorithm which reduces the number of states to be analyzed in the verification of properties for name passing process calculi.
Work partiallysupp orted byFET Global Project PROFUNDIS and MURST Project COMETA
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. Aczel, N. Mendler, A Final Coalgebra Theorem, in Category Theory and Computer Science, LNCS 389, 1989.
A. Corradini, R. Heckel, U. Montanari, Compositional SOS and Beyond: A Coalgebraic View of Open Systems, Theoretical Computer Science, to appear.
E. Clarke and J. Wing Eds. Formal Methods: State of the Art and Future Directions. ACM Comp. Surv., December 1996.
M. Dam, On the decidabilityof process equivalences for the π-calculus. Theoretical Computer Science, 183(2):215–228, 1997.
B. Jacobs, J. Rutten A tutorial on (co)algebras and (co)induction. Bulletin of EATCS, 62, 222–259, 1997.
J.-C., Fernandez, An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming 13, 219–236, 1990.
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.
G. Ferrari, S. Gnesi, U. Montanari, M. Pistore, G. Ristori, Verifying Mobile Processes in the HAL Environment. CAV’98, LNCS 1427, 1998.
P. Kannellakis, S. Smolka, CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86, 43–68, 1990.
C. Meadows Open Issues in Formal Methods for Cryptographic Protocol Analysis, Proceedings of DISCEX 2000, IEEE Press, 237–250, 2000.
R. Milner, J. Parrow and D. Walker. A calculus of mobile processes, Part I and II. Information and Computation, 100(1):1–77, 1992.
U. Montanari and M. Pistore. Checking bisimilarityfor finitary π-calculus. In Proc. CONCUR’95, LNCS 962. Springer Verlag, 1995.
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.
U. Montanari, M. Pistore and D. Yankelevich. Efficient minimization up to location equivalence. In Proc. ESOP’96, LNCS 1058. Springer Verlag, 1996.
U. Montanari and M. Pistore. History-Dependent Automata. IRST Technical Report 0112-14, Istituto Trentino di Cultura, December 2001.
U. Montanari and M. Pistore. π-calculus, structured coalgebras and minimal HDautomata. In Proc. MFCS’2000, LNCS 1893, Springer Verlag, 2000.
M. Pistore and D. Sangiorgi, A partition refinement algorithm for the π-calculus. Information and Computation 164, 263–321, 2001.
R. Paige, R.E. Tarjan. Three partition refinement algorithms, SIAM Journal on Computing 16(6) 973–989, 1987.
J.J.M.M. Rutten. Universal coalgebra: a theoryof systems. Technical Report CSR9652, CWI, 1996. To appear in Theoretical Computer Science.
D. Turi, G.D. Plotkin, Towards a Mathematical Operational Semantics, In Proc. Logic in Computer Science 97, IEEE Press, 280–291, 1997.
J. Warell, Terminal Sequences for Accessible Endofunctors, In Proc. CMCS’99, ENCTS 19, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrari, G., Montanari, U., Pistore, M. (2002). Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive