Weak bisimulation is sound and complete for pCTL^*

DOI10.1016/J.IC.2009.11.002zbMATH Open1189.68080OpenAlexW2056928795MaRDI QIDQ2266992FDOQ2266992

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

Publication date: 26 February 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.11.002

Recommendations

• scientific article; zbMATH DE number 1927573
• Probabilistic Bisimulation: Naturally on Distributions
• scientific article; zbMATH DE number 1759621
• Notes on generative probabilistic bisimulation
• Bisimulation for labelled Markov processes

zbMATH Keywords

image finiteness'

Mathematics Subject Classification ID

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

Cites Work

• Bisimulation for labelled Markov processes
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Full abstraction for a shared-variable parallel language
• Theory of capacities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probability and Nondeterminism in Operational Models of Concurrency
• Finite Continuous Time Markov Chains
• Bisimulation metrics for continuous Markov decision processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Continuous Capacities on Continuous State Spaces
• Fully abstract denotational models for nonuniform concurrent languages

Cited In (13)

• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• On the semantics of Markov automata
• A semantics for every GSPN
• Bisimulations meet PCTL equivalences for probabilistic automata
• A space-efficient simulation algorithm on probabilistic automata
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
• Probabilistic bisimulation for realistic schedulers
• Title not available (Why is that?)
• Bisimulations meet PCTL equivalences for probabilistic automata
• Probabilistic bisimulation for realistic schedulers
• On the probabilistic bisimulation spectrum with silent moves
• A general framework for probabilistic characterizing formulae

This page was built for publication: Weak bisimulation is sound and complete for pCTL\(^*\)

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