A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and concurrency
Tableau-based model checking in the propositional mu-calculus
Acta Informatica
Bisimulation through probabilistic testing
Information and Computation
Handbook of logic in computer science (vol. 2)
Information and Computation
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Solving Polynomial Systems Using a Branch and Prune Approach
SIAM Journal on Numerical Analysis
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Symbolic Model Checking
Handbook of Process Algebra
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
An Improved Algorithm for the Evaluation of Fixpoint Expressions
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Praobabilistic Resource Failure in Real-Time Process Algebra
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Probabilistic verification through temporal logics
Probabilistic verification through temporal logics
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Probabilistic Logic over Paths
Electronic Notes in Theoretical Computer Science (ENTCS)
Annotated probabilistic temporal logic
ACM Transactions on Computational Logic (TOCL)
Characterising probabilistic processes logically
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Linear-time and may-testing in a probabilistic reactive setting
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation
ACM Transactions on Computational Logic (TOCL)
Model checking with probabilistic tabled logic programming
Theory and Practice of Logic Programming
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 5.23 |
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a model-checking algorithm for determining whether or not states in finite-state RPLTSs satisfy formulas in the logic. The logic is based on the distinction between (probabilistic) "systems" and (nonprobabilistic) "observations": using the modal mu-calculus, one may specify sets of observations, and the semantics of our logic then enable statements to be made about the measures of such sets at various system states. The logic may be used to encode a variety of probabilistic modal and temporal logics; in addition, the model-checking problem for it may be reduced to the calculation of solutions to systems of non-linear equations. Finally, the logic induces an equivalence on RPLTSs that coincides with accepted notions of probabilistic bisimulation in the literature.