Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
type: Item
instance of: scholarly article
title: Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
zbMATH Open document ID: 1070.68102
author: Ugo Montanari
author: Emilio Tuosto
author: Gian Luigi Ferrari
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 2153164
zbMATH Keywords: Name passing calculi
zbMATH Keywords: Finite state verification
zbMATH Keywords: Partition refinement algorithm
zbMATH Keywords: Bisimulation checking
zbMATH Keywords: Dependent types
zbMATH Keywords: Co-algebras
describes a project that uses: MWB
describes a project that uses: ML
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.09.021
OpenAlex ID: W2098857464
cites work: A calculus for cryptographic protocols: The spi calculus
cites work: An implementation of an efficient algorithm for bisimulation equivalence
cites work: Q4738222
cites work: Algebra and Coalgebra in Computer Science
cites work: Q4798029
cites work: Q3992568
cites work: Q4248252
cites work: Foundations of Software Science and Computation Structures
cites work: A calculus of mobile processes. I
cites work: Q4222939
cites work: An algebraic verification of a mobile network
cites work: Three Partition Refinement Algorithms
cites work: Q2721104
cites work: Universal coalgebra: A theory of systems
cites work: Q4040030
cites work: A theory of bisimulation for the \(\pi\)-calculus
cites work: Q4256309
DOI: 10.1016/J.TCS.2004.09.021
description: scientific article; zbMATH DE number 2153164