Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Logical Characterisation of Performability Properties
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Symbolic Computation of Maximal Probabilistic Reachability
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Probabilistic Temporal Logics via the Modal Mu-Calculus
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Probabilistic Asynchronous pi-Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Norm Functions for Probabilistic Bisimulations with Delays
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
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
Process Algebra with Probabilistic Choice
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Probabilistic Analysis of Anonymity
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
The verification System by Dense Timing Constraints and Probabilitie
SEEP '96 Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
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
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Two-player nonzero-sum ω-regular games
CONCUR 2005 - Concurrency Theory
State explosion in almost-sure probabilistic reachability
Information Processing Letters
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
ACM Transactions on Information and System Security (TISSEC)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Automata, Probability, and Recursion
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching Bisimulation Congruence for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Monitoring the Full Range of ω -Regular Properties of Stochastic Systems
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Significant Diagnostic Counterexamples in Probabilistic Model Checking
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Power of Randomization in Automata on Infinite Strings
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A logic for reasoning about evidence
Journal of Artificial Intelligence Research
A Decidable Probability Logic for Timed Probabilistic Systems
Fundamenta Informaticae
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Abstraction and Probabilities for Hybrid Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Checking Functional and Performability Properties of Stochastic Fluid Models
Electronic Notes in Theoretical Computer Science (ENTCS)
A Novel Stochastic Game Via the Quantitative μ-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative Analysis With the Probabilistic Model Checker PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Verification and Approximation
Electronic Notes in Theoretical Computer Science (ENTCS)
Distribution, Approximation and Probabilistic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of stochastic systems part I: Stochastic automata
Information and Computation
Verification of probabilistic systems with faulty communication
Information and Computation
A note on the attractor-property of infinite-state Markov chains
Information Processing Letters
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Model checking lossy channels systems is probably decidable
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
All k-bounded policies are equivalent for self-stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Multi-objective model checking of Markov decision processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Model checking probabilistic timed automata with one or two clocks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Modeling and analysis of power-aware systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Magnifying-lens abstraction for Markov decision processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Model checking almost all paths can be less expensive than checking all paths
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Monitoring temporal properties of stochastic systems
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Verification of epistemic properties in probabilistic multi-agent systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Conditional probabilities over probabilistic and nondeterministic systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Stochastic games with lossy channels
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Model-checking ω-regular properties of interval Markov chains
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Making random choices invisible to the scheduler
Information and Computation
Temporal verification of probabilistic multi-agent systems
Pillars of computer science
Performance evaluation and model checking join forces
Communications of the ACM
Annotated probabilistic temporal logic
ACM Transactions on Computational Logic (TOCL)
Supporting human-intensive systems
Proceedings of the FSE/SDP workshop on Future of software engineering research
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Qualitative analysis of partially-observable Markov decision processes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The complexity of partial-observation parity games
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On model checking techniques for randomized distributed systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Statistical model checking: an overview
RV'10 Proceedings of the First international conference on Runtime verification
Recurrence and transience for finite probabilistic tables
Theoretical Computer Science
Probabilistic Büchi automata with non-extremal acceptance thresholds
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Quantitative Kleene coalgebras
Information and Computation
Qualitative concurrent parity games
ACM Transactions on Computational Logic (TOCL)
Efficient CTMC model checking of linear real-time objectives
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A progress measure for explicit-state probabilistic model-checkers
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Quantitative synthesis for concurrent programs
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Monitorability of stochastic dynamical systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A non-functional property based service selection and service verification model
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
Carrying probabilities to the infinite world
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Time-bounded verification of CTMCs against real-time specifications
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Observing continuous-time MDPs by 1-clock timed automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Bounded model checking for GSMP models of stochastic real-time systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
A logic for reasoning about evidence
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Journal of the ACM (JACM)
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Computing the expected accumulated reward and gain for a subclass of infinite markov chains
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Bisimulations for non-deterministic labelled markov processes
Mathematical Structures in Computer Science
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model checking probabilistic systems against pushdown specifications
Information Processing Letters
Model checking durational probabilistic systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Proving positive almost-sure termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking of Recursive Probabilistic Systems
ACM Transactions on Computational Logic (TOCL)
Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation
ACM Transactions on Computational Logic (TOCL)
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Analysis of recursive probabilistic models
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Model-Checking markov chains in the presence of uncertainties
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Games and markov decision processes with mean-payoff parity and energy parity objectives
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
Approximate planning and verification for large markov decision processes
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Robustness of structurally equivalent concurrent parity games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Synthesizing probabilistic composers
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
Partial-Observation Stochastic Games: How to Win When Belief Fails
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decidable Problems for Probabilistic Automata on Infinite Words
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Probabilistic automata and probabilistic logic
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Markov Decision Processes and Deterministic Büchi Automata
Fundamenta Informaticae
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Bisimulation and logical preservation for continuous-time markov decision processes
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Equivalence of games with probabilistic uncertainty and partial-observation games
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Quantitative modelling and analysis
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Computing quantiles in markov reward models
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
A logic of probabilistic knowledge and strategy
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Diagnosability in concurrent probabilistic systems
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Automated reliability estimation over partial systematic explorations
Proceedings of the 2013 International Conference on Software Engineering
Polynomial-Time verification of PCTL properties of MDPs with convex uncertainties
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Automata with generalized rabin pairs for probabilistic model checking and LTL synthesis
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Refinement and difference for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Stochastic parity games on lossy channel systems
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
Information Processing Letters
From software verification to `everyware' verification
Computer Science - Research and Development
A survey of partial-observation stochastic parity games
Formal Methods in System Design
Preface to the special issue on Probabilistic Model Checking
Formal Methods in System Design
Solving Partial-Information Stochastic Parity Games
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.02 |
The verification problem for probabilistic concurrent finite-state program is to decide whether such a program satisfies its linear temporal logic specification. We describe an automata-theoretic approach, whereby probabilistic quantification over sets of computations is reduced to standard quantification over individual computations. Using new determinization construction for ω-automata, we manage to improve the time complexity of the algorithm by two exponentials. The time complexity of the final algorithm is polynomial in the size of the program and doubly exponential in the size of the specification.