scientific article; zbMATH DE number 1754605

zbMath0986.68073MaRDI QIDQ4535031

Roberto Segala, Emanuele Bandini

Publication date: 12 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760370

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (24)

Complete axiomatization for the total variation distance of Markov chains ⋮ Model independent approach to probabilistic models ⋮ Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours ⋮ An efficient algorithm to determine probabilistic bisimulation ⋮ Convexity via Weak Distributive Laws ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Exploring probabilistic bisimulations. I ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Quantitative Kleene coalgebras ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Branching bisimulation for probabilistic systems: characteristics and decidability ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ Making random choices invisible to the scheduler ⋮ Unnamed Item ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Probabilistic temporal logics via the modal mu-calculus ⋮ Non Expansive ε-Bisimulations ⋮ Remarks on Testing Probabilistic Processes ⋮ Notes on Generative Probabilistic Bisimulation ⋮ Probabilistic Barbed Congruence

This page was built for publication: