Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Model Checking Large Software Specifications
IEEE Transactions on Software Engineering
Symbolic Model Checking for Probabilistic Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Reasonong about Safety and Liveness Properties for Probabilistic Processes
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Verifying temporal properties of finite-state probabilistic programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Markovian analysis of large finite state machines
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Performance Evaluation: = (Process Algebra + Model Checking) × Markov Chains
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Automated Performance and Dependability Evaluation Using Model Checking
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
The Möbius State-Level Abstract Functional Interface
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Towards Model Checking Stochastic Process Algebra
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Model Checking CSL until Formulae with Random Time Bounds
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Exploiting Modal Logic to Express Performance Measures
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
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
An effective sequential statistical test for probabilistic monitoring
Information and Software Technology
Dependability analysis and verification for CONNECTed systems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A simple modal logic approach to decision process
MACMESE'07 Proceedings of the 9th WSEAS international conference on Mathematical and computational methods in science and engineering
Model checking algorithms for CTMDPs
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
PVESTA: a parallel statistical model checking and quantitative analysis tool
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Functional performance specification with stochastic probes
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Counterexamples for timed probabilistic reachability
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
On statistical model checking of stochastic systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Simulation and analysis of distributed systems in klaim
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Symbolic model checking of stochastic systems: theory and implementation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Towards model checking stochastic aspects of the thinkteam user interface
DSVIS'05 Proceedings of the 12th international conference on Interactive Systems: design, specification, and verification
Model checking: one can do much more than you think!
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
xTune: A formal methodology for cross-layer tuning of mobile embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Formal modelling and verification of service-oriented systems in probabilistic event-b
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Analysing robot swarm decision-making with Bio-PEPA
ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
Performance evaluation of sensor networks by statistical modeling and euclidean model checking
ACM Transactions on Sensor Networks (TOSN)
MARCIE: model checking and reachability analysis done efficiently
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al [1]. The considered logic contains a time-bounded until-operator and a novel operator to express steady-state probabilities. We show that the model checking problem for this logic reduces to a system of linear equations (for unbounded until and the steady state-operator) and a Volterra integral equation system for time-bounded until. We propose a symbolic approximate method for solving the integrals using MTDDs (multi-terminal decision diagrams), a generalisation of MTBDDs. These new structures are suitable for numerical integration using quadrature formulas based on equally-spaced abscissas, like trapezoidal, Simpson and Romberg integration schemes.