Abstraction in probabilistic process algebra

DOI10.1007/3-540-45319-9_15MaRDI QIDQ2769588zbMATH OpenFDO

Authors S. Andova, Jos C. M. Baeten

Publication date 5 February 2002

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

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Branching bisimulation congruence for probabilistic systems
• Equivalences for silent transitions in probabilistic systems (extended abstract)

Cited in

(21)

• Probabilistic weak simulation is decidable in polynomial time
• Algebraic theory of probabilistic processes.
• A process algebra for probabilistic and nondeterministic processes
• A brief history of process algebra
• Exploring probabilistic bisimulations. I
• Probabilistic process algebra to unifying quantum and classical computing in closed systems
• Comparative branching-time semantics for Markov chains
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
• Remarks on testing probabilistic processes
• On Abstraction of Probabilistic Systems
• Abstraction of Probabilistic Systems
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
• Bisimulation and Simulation Relations for Markov Chains
• A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
• Symbolic approaches to probability distributions in process algebra
• Branching bisimulation congruence for probabilistic systems
• Axiomatizations for probabilistic finite-state behaviors
• Making random choices invisible to the scheduler

This page was built for publication: Abstraction in probabilistic process algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2769588)