Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types

DOI10.1016/J.TCS.2004.09.021zbMath1070.68102OpenAlexW2098857464MaRDI QIDQ1770362

Emilio Tuosto, Ugo Montanari, Gian-Luigi Ferrari

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.021

zbMATH Keywords

Dependent typesBisimulation checkingCo-algebrasFinite state verificationName passing calculiPartition refinement algorithm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (14)

Coinductive predicates and final sequences in a fibration ⋮ Families of Symmetries as Efficient Models of Resource Binding ⋮ A coalgebraic semantics for causality in Petri nets ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ A Category of Explicit Fusions ⋮ Ugo Montanari and Software Verification ⋮ A network-conscious \(\pi\)-calculus and its coalgebraic semantics ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ Revisiting causality, coalgebraically ⋮ Event based choreography ⋮ Fast computations on ordered nominal sets ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Coinductive predicates and final sequences in a fibration ⋮ A Name Abstraction Functor for Named Sets

Uses Software

• ML
• MWB

Cites Work

• An implementation of an efficient algorithm for bisimulation equivalence
• A calculus of mobile processes. I
• An algebraic verification of a mobile network
• A calculus for cryptographic protocols: The spi calculus
• Universal coalgebra: A theory of systems
• A theory of bisimulation for the \(\pi\)-calculus
• Three Partition Refinement Algorithms
• Foundations of Software Science and Computation Structures
• Algebra and Coalgebra in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types