zbMATH — the first resource for mathematics

Minimizing transition systems for name passing calculi: A co-algebraic formulation. (English) Zbl 1077.68716
Nielsen, Mogens (ed.) et al., Foundations of software science and computation structures. 5th international conference, FOSSACS 2002, held as part of the joint European conferences on theory and practice of software, ETAPS 2002, Grenoble, France, April 8–12, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43366-X). Lect. Notes Comput. Sci. 2303, 129-143 (2002).
Summary: We address the problem of minimizing labelled transition systems for name passing calculi. We show how the co-algebraic formulation of automata with naming directly suggests an effective minimization algorithm which reduces the number of states to be analyzed in the verification of properties for name passing process calculi.
For the entire collection see [Zbl 0989.00051].

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q45 Formal languages and automata
Full Text: Link