scientific article; zbMATH DE number 1927573

zbMath1012.68139MaRDI QIDQ4484498

Radha Jagadeesan, Vineet Gupta, Josée Desharnais, Prakash Panangaden

Publication date: 12 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210355.htm

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 (20)

Testing Finitary Probabilistic Processes ⋮ Comparative branching-time semantics for Markov chains ⋮ A pseudometric in supervisory control of probabilistic discrete event systems ⋮ Parametric probabilistic transition systems for system design and analysis ⋮ SOS specifications for uniformly continuous operators ⋮ Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions ⋮ Explainability of probabilistic bisimilarity distances for labelled Markov chains ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ Quantifying Vulnerability of Secret Generation Using Hyper-Distributions ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Branching bisimulation for probabilistic systems: characteristics and decidability ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ A Spectrum of Behavioral Relations over LTSs on Probability Distributions ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Compositional weak metrics for group key update ⋮ Bisimulation and Simulation Relations for Markov Chains

This page was built for publication: