Verification of probabilistic programs
SIAM Journal on Computing
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A decidable propositional probabilistic dynamic logic
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Reasoning about fair concurrent programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Reasoning about probabilistic algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Reasoning about probabilistic parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of probabilistic verification
Journal of the ACM (JACM)
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Fully Abstract Characterization of Probabilistic May Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
ProbVerus: Probabilistic Symbolic Model Checking
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Probabilistic Analysis of Anonymity
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Deductive Verification of Probabilistic Real-Time Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Reasoning about knowledge and probability
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
Model checking mobile stochastic logic
Theoretical Computer Science
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
Towards a Logic for Performance and Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
A complete probabilistic belief logic
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
SoSL: a service-oriented stochastic logic
Rigorous software engineering for service-oriented systems
A branching time logic with two types of probability operators
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.01 |
We present two (closely-related) propositional probabilistic temporal logics based on temporal logics of branching time as introduced by Ben-Ari, Pnueli and Manna and by Clarke and Emerson. The first logic, PTLf, is interpreted over finite models, while the second logic, PTLb, which is an extension of the first one, is interpreted over infinite models with transition probabilities bounded away from 0. The logic PTLf allows us to reason about finite-state sequential probabilistic programs, and the logic PTLb allows us to reason about (finite-state) concurrent probabilistic programs, without any explicit reference to the actual values of their state-transition probabilities. A generalization of the tableau method yields exponential-time decision procedures for our logics, and complete axiomatizations of them are given. Several meta-results, including the absence of a finite-model property for PTLb, and the connection between satisfiable formulae of PTLb and finite state concurrent probabilistic programs, are also discussed.