Foundations of Software Science and Computation Structures
From MaRDI portal
Publication:5308464
DOI10.1007/B95995zbMath1126.68460OpenAlexW3105029025MaRDI QIDQ5308464
Joël Ouaknine, Dusko Pavlovic, Michael W. Mislove, James Worrell
Publication date: 28 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95995
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55)
Related Items (8)
A Duality Theorem for Real C * Algebras ⋮ A metrized duality theorem for Markov processes ⋮ Reversible monadic computing ⋮ A logical duality for underspecified probabilistic systems ⋮ Final coalgebras for functors on measurable spaces ⋮ Approximating Markov Processes by Averaging ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ Proving Approximate Implementations for Probabilistic I/O Automata
This page was built for publication: Foundations of Software Science and Computation Structures