Abstract
This paper describes the architecture of a toolkit, called Mihda, providing facilities to minimize labelled transition systems for name passing calculi. The structure of the toolkit is derived from the co-algebraic formulation of the partition-refinement minimization algorithm for HD-automata. HD-automata have been specifically designed to allocate and garbage collect names and they provide faithful finite state representations of the behaviours of π-calculus processes. The direct correspondence between the coalgebraic specification and the implementation structure facilitates the proof of correctness of the implementation. We evaluate the usefulness of Mihda in practice by performing finite state verification of π-calculus specifications.
This work has been supported by EU-FET project PROFUNDIS IST-2001-33100 and by MIUR project NAPOLI
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aczel, P.: Algebras and coalgebras. In: Blackhouse, R., Crole, R.L., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol. 2297, pp. 79–88. Springer, Heidelberg (2002); Revised Lectures of the Int. Summer School and Workshop
Clarke, E.M., Wing, J.M.: Formal methods: state of the art and future directions. ACM Computing Surveys 28(4), 626–643 (1996)
Fernandez, J.C.: An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming 13, 219–236 (1990)
Ferrari, G., Montanari, U., Pistore, M.: Minimizing transition systems for name passing calculi: A co-algebraic formulation. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 129–143. Springer, Heidelberg (2002)
Fiore, M., Plotkin, G.G., Turi, D.: Abstract syntax and variable binding. In: 14th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (1999)
Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax involving binders. In: 14th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (1999)
Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS 62, 222–259 (1996)
Kanellakis, P.C., Smolka, S.A.: Ccs expressions, finite state processes and three problem of equivalence. Information and Computation 86(1), 272–302 (1990)
Milner, R.: Commuticating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge (1999)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Information and Computation 100(1), 1–40, 41–77 (1992)
Montanari, U., Pistore, M.: History dependent automata. Technical report, Computer Science Department, Università di Pisa, TR-11-98 (1998)
Montanari, U., Pistore, M.: π-calculus, structured coalgebras and minimal hd-automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, p. 569. Springer, Heidelberg (2000)
Orava, F., Parrow, J.: An algebraic verification of a mobile network. Formal Aspects of Computing 4(5), 497–543 (1992)
Pistore, M.: History dependent automata. PhD thesis, Computer Science Department, Università di Pisa (1999)
Pitts, A.M., Gabbay, M.J.: A metalanguage for programming with bound names modulo renaming. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837. Springer, Heidelberg (2000)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2002)
Victor, B., Moller, F.: The Mobility Workbench — a tool for the π- calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428–440. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrari, G., Montanari, U., Raggi, R., Tuosto, E. (2003). From Co-algebraic Specifications to Implementation: The Mihda Toolkit. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2002. Lecture Notes in Computer Science, vol 2852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39656-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-39656-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20303-2
Online ISBN: 978-3-540-39656-7
eBook Packages: Springer Book Archive