Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68101OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716849

Claudio Hermida, Michael Makkai, Franck Van Breugel, James Worrell

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Relating Coalgebraic Notions of Bisimulation ⋮ A pseudometric in supervisory control of probabilistic discrete event systems ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Hausdorff coalgebras ⋮ Approximating and computing behavioural distances in probabilistic transition systems ⋮ A Probability Monad as the Colimit of Spaces of Finite Samples

This page was built for publication: Automata, Languages and Programming