Automata, Languages and Programming
From MaRDI portal
Publication:5716849
DOI10.1007/11523468zbMath1085.68101WikidataQ56656999 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
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
A Probability Monad as the Colimit of Spaces of Finite Samples, Sound approximate and asymptotic probabilistic bisimulations for PCTL, A pseudometric in supervisory control of probabilistic discrete event systems, Hausdorff coalgebras, Approximating and computing behavioural distances in probabilistic transition systems, Relating Coalgebraic Notions of Bisimulation