Weak bisimulation is sound and complete for pCTL^*

DOI10.1016/J.IC.2009.11.002MaRDI QIDQ2266992zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

image finiteness'

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1361128 (Why is no real title available?)
• scientific article; zbMATH DE number 1927573 (Why is no real title available?)
• scientific article; zbMATH DE number 1754605 (Why is no real title available?)
• scientific article; zbMATH DE number 1759621 (Why is no real title available?)
• scientific article; zbMATH DE number 1864592 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 3223983 (Why is no real title available?)
• scientific article; zbMATH DE number 3228101 (Why is no real title available?)
• scientific article; zbMATH DE number 3390061 (Why is no real title available?)
• Algebraic laws for nondeterminism and concurrency
• Bisimulation for labelled Markov processes
• Bisimulation metrics for continuous Markov decision processes
• Bisimulation through probabilistic testing
• Continuous Capacities on Continuous State Spaces
• Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
• Finite Continuous Time Markov Chains
• Full abstraction for a shared-variable parallel language
• Fully abstract denotational models for nonuniform concurrent languages
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Probability and Nondeterminism in Operational Models of Concurrency
• Theory of capacities

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 uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• A space-efficient simulation algorithm on probabilistic automata
• Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
• Probabilistic bisimulation for realistic schedulers
• scientific article; zbMATH DE number 1927573 (Why is no real title available?)
• Bisimulations meet PCTL equivalences for probabilistic automata
• On the probabilistic bisimulation spectrum with silent moves
• Probabilistic bisimulation for realistic schedulers
• 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)