Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Bisimulation through probabilistic testing
Information and Computation
Characteristic formulae for processes with divergence
Information and Computation
Probabilistic and prioritized models of timed CSP
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Communication and Concurrency
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Partial-Order Reduction in the Weak Modal Mu-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing Finitary Probabilistic Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Nondeterministic Labeled Markov Processes: Bisimulations and Logical Characterization
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
A Local Algorithm for Checking Probabilistic Bisimilarity
FCST '09 Proceedings of the 2009 Fourth International Conference on Frontier of Computer Science and Technology
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Probabilistic modal µ-calculus with independent product
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A spectrum of behavioral relations over LTSs on probability distributions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A general framework for probabilistic characterizing formulae
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mu-calculus and show how to derive characteristic formulae for various simulation-like preorders over finite-state processes without divergence. In addition, we show that even without the fixpoint operators this probabilistic mu-calculus can be used to characterise these behavioural relations in the sense that two states are equivalent if and only if they satisfy the same set of formulae.