scientific article
From MaRDI portal
Publication:2769588
zbMath0978.68100MaRDI QIDQ2769588
Suzana Andova, Jos C. M. Baeten
Publication date: 5 February 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2031/20310204
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (16)
Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey ⋮ Comparative branching-time semantics for Markov chains ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Algebraic theory of probabilistic processes. ⋮ Exploring probabilistic bisimulations. I ⋮ On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi ⋮ Probabilistic process algebra to unifying quantum and classical computing in closed systems ⋮ Branching bisimulation for probabilistic systems: characteristics and decidability ⋮ Making random choices invisible to the scheduler ⋮ A brief history of process algebra ⋮ Probabilistic weak simulation is decidable in polynomial time ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Remarks on Testing Probabilistic Processes ⋮ Bisimulation and Simulation Relations for Markov Chains ⋮ A process algebra for probabilistic and nondeterministic processes
This page was built for publication:
