The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Markov decision processes and regular events
Proceedings of the seventeenth international colloquium on Automata, languages and programming
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
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Journal of the ACM (JACM)
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Deciding Branching Time Logic: A Triple Exponential Decision Procedure for CTL*
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth 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
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Survivability analysis of networked systems
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Implicates and reduction techniques for temporal logics
Annals of Mathematics and Artificial Intelligence
On probabilistic timed automata
Theoretical Computer Science
Randomization Helps in LTL Model Checking
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
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
Approximate Verification of Probabilistic Systems
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Implicates and Reduction Techniques for Temporal Logics
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
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
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
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
A Logic of Probability with Decidable Model-Checking
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
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 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
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
Theoretical Computer Science
Handbook of automated reasoning
Approximating labelled Markov processes
Information and Computation
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
ProbMela and verification of Markov decision processes
ACM SIGMETRICS Performance Evaluation Review
Quantitative analysis of distributed randomized protocols
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Verification of probabilistic systems with faulty communication
Information and Computation
A note on the attractor-property of infinite-state Markov chain
Information Processing Letters
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
State explosion in almost-sure probabilistic reachability
Information Processing Letters
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
Quantitative verification: models techniques and tools
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Quantitative verification: models, techniques and tools
The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
Concurrent games with tail objectives
Theoretical Computer Science
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Games, Time, and Probability: Graph Models for System Design and Analysis
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Theory and Practice of Probabilistic Timed Game for Embedded Systems
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
25 Years of Model Checking
Automata, Probability, and Recursion
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Abstraction for Stochastic Systems by Erlang's Method of Stages
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Acceptors for Languages over Infinite Words
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Information and Computation
The Effect of Tossing Coins in Omega-Automata
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
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Bayesian Approach to Model Checking Biological Systems
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
A Decidable Probability Logic for Timed Probabilistic Systems
Fundamenta Informaticae
LTL Model Checking of Time-Inhomogeneous Markov Chains
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Approximate Model Checking of PCTL Involving Unbounded Path Properties
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Probabilistic Verification and Approximation
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of probabilistic systems with faulty communication
Information and Computation
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
A note on the attractor-property of infinite-state Markov chains
Information Processing Letters
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
Bayesian statistical model checking with application to Simulink/Stateflow verification
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
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
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Using probabilist models for studying realistic systems: a case study of pastry
SDL'07 Proceedings of the 13th international SDL Forum conference on Design for dependable systems
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
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
Temporal verification of probabilistic multi-agent systems
Pillars of computer science
Decision problems for Nash equilibria in stochastic games
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Performance evaluation and model checking join forces
Communications of the ACM
On simulation-based probabilistic model checking of mixed-analog circuits
Formal Methods in System Design
Solving simple stochastic tail games
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A formal language toward the unification of model checking and performance evaluation
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
On models and query languages for probabilistic processes
ACM SIGMOD Record
MCGP: a software synthesis tool based on model checking and genetic programming
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
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
Run-time efficient probabilistic model checking
Proceedings of the 33rd International Conference on Software Engineering
Checking models, proving programs, and testing systems
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Symbolic algorithms for qualitative analysis of Markov decision processes with Buchi objectives
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
Carrying probabilities to the infinite world
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Two variable vs. linear temporal logic in model checking and games
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
Statistical model checking for cyber-physical systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On the markovian randomized strategy of controller for markov decision processes
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Computational methods for reachability analysis of stochastic hybrid systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Symbolic and parametric model checking of discrete-time markov chains
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
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
Concurrent games with tail objectives
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Nash equilibrium for upward-closed objectives
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
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
On the controller synthesis for finite-state markov decision processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical 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
On statistical model checking of stochastic systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Model checking durational probabilistic systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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)
Logic and model checking for hidden markov models
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
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
Synthesis for probabilistic environments
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Fair adversaries and randomization in two-player games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
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
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
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
Moving in a network under random failures: A complexity analysis
Science of Computer Programming
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
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
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Model checking stochastic branching processes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
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
Computing quantiles in markov reward models
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Strategy improvement for concurrent reachability and turn-based stochastic safety games
Journal of Computer and System Sciences
A logic of probabilistic knowledge and strategy
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Temporal logic robot control based on automata learning of environmental dynamics
International Journal of Robotics Research
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
Formal Methods in System Design
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Polynomial-Time verification of PCTL properties of MDPs with convex uncertainties
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Faster algorithms for markov decision processes with low treewidth
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
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
Bayesian statistical model checking with application to Stateflow/Simulink verification
Formal Methods in System Design
Preface to the special issue on Probabilistic Model Checking
Formal Methods in System Design
| Hi-index | 0.02 |
We determine the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic. For sequential programs, we present an algorithm that runs in time linear in the program and exponential in the specification, and also show that the problem is in PSPACE, matching the known lower bound. For concurrent programs, we show that the problem can be solved in time polynomial in the program and doubly exponential in the specification, and prove that it is complete for double exponential time. We also address these questions for specifications described by &ohgr;-automata or formulas in extended temporal logic.