From co-algebraic specifications to implementation: The Mihda toolkit

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

Volumn 2852, Issue , 2003, Pages 319-338

  Ferrari, Gianluigi ^a   Montanari, Ugo ^a   Raggi, Roberto ^a   Tuosto, Emilio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; BIOMINERALIZATION; FORMAL METHODS; SPECIFICATIONS;

ALGEBRAIC SPECIFICATIONS; COALGEBRAIC SPECIFICATIONS; FINITE STATE VERIFICATION; FINITE-STATE REPRESENTATIONS; IMPLEMENTATION STRUCTURE; LABELLED TRANSITION SYSTEMS; MINIMIZATION ALGORITHMS; PROOF OF CORRECTNESS;

CALCULATIONS;

EID: 0142214570     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39656-7_13     Document Type: Article

References (18)

1. Peter Aczel. Algebras and coalgebras. In Roy Backhouse, Roland Crole and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of LNCS, chapter 3, pages 79-88. Springer Verlag, April 2002.
2. Revised Lectures of the Int. Summer School and Workshop.
3. Edmund M. Clarke and Jeanette M. Wing. Formal methods: state of the art and future directions. ACM Computing Surveys, 28(4):626-643, December 1996.
4. Jean Claude Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming, 13:219-236, 1990.
5. GianLuigi Ferrari, Ugo Montanari, and Marco Pistore. Minimizing transition systems for name passing calculi: A co-algebraic formulation. In Mogens Nielsen and Uffe Engberg, editors, FOSSACS 2002, volume LNCS 2303, pages 129-143. Springer Verlag, 2002.
6. Marcelo Fiore, Gordon G. Plotkin, and Daniele Turi. Abstract syntax and variable binding. In 14th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.
7. Murdoch J. Gabbay and Andrew M. Pitts. A new approach to abstract syntax involving binders. In 14th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.
8. Bart Jacobs and Jan Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS, 62:222-259, 1996.
9. Paris C. Kanellakis and Scott A. Smolka. Ccs expressions, finite state processes and three problem of equivalence. Information and Computation, 86(1):272-302, 1990.
10. Robin Milner. Commuticating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.
11. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1-40,41-77, September 1992.
12. Ugo Montanari and Marco Pistore. History dependent automata. Technical report, Computer Science Department, Università di Pisa, 1998. TR-11-98.
13. Ugo Montanari and Marco Pistore. π-calculus, structured coalgebras and minimal hd-automata. In Mathematical Foundations of Computer Science 2000, volume 1893. Springer, 2000.
14. Fredrik Orava and Joachim Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, 4(5):497-543, 1992.
15. Marco Pistore. History dependent automata. PhD thesis, Computer Science Department, Università di Pisa, 1999.
16. Andrew M. Pitts and Murdoch J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Mathematics of Program Construction, 5th International Conference, MPC2000, volume 1837. Springer, 2000.
17. Davide Sangiorgi and David Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2002.
18. Björn Victor and Faron Moller. The Mobility Workbench - a tool for the π-calculus. In David Dill, editor, Proceedings of CAV '94, volume 818 of Lecture Notes in Computer Science, pages 428-440. Springer-Verlag, 1994.