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.
Cite
CITATION STYLE
Ferrari, G., Montanari, U., & Pistore, M. (2002). Minimizing transition systems for name passing calculi: A co-algebraic formulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2303, pp. 129–143). Springer Verlag. https://doi.org/10.1007/3-540-45931-6_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
