Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking for action-based logics
Formal Methods in System Design
State-space support for path-based reward variables
IPDS '98 Proceedings of the third IEEE international performance and dependability symposium on International performance and dependability symposium
Model checking
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SPNP: Stochastic Petri Net Package
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th 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
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Performance Evaluation of GSM Handover Traffic in a GPRS/GSM Network
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Model Checking Action- and State-Labelled Markov Chains
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Specification patterns for probabilistic quality properties
Proceedings of the 30th international conference on Software engineering
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Journal of Systems and Software
Query-based verification of qualitative trends and oscillations in biochemical systems
Theoretical Computer Science
Performability assessment by model checking of Markov reward models
Formal Methods in System Design
Faster SPDL model checking through property-driven state space generation
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
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
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
Automata-based CSL model checking
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
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
Exploiting multiformalism models for testing and performance evaluation in SIMTHESys
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
HASL: an expressive language for statistical verification of stochastic models
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
Expressing and computing passage time measures of GSPN models with HASL
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Model checking markov population models by central limit approximation
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |
In the past, logics of several kinds have been proposed for reasoning about discrete-time or continuous-time Markov chains. Most of these logics rely on either state labels (atomic propositions) or on transition labels (actions). However, in several applications it is useful to reason about both state properties and action sequences. For this purpose, we introduce the logic asCSL which provides a powerful means to characterize execution paths of Markov chains with actions and state labels. asCSL can be regarded as an extension of the purely state-based logic CSL (continuous stochastic logic). In asCSL, path properties are characterized by regular expressions over actions and state formulas. Thus, the truth value of path formulas depends not only on the available actions in a given time interval, but also on the validity of certain state formulas in intermediate states. We compare the expressive power of CSL and asCSL and show that even the state-based fragment of asCSL is strictly more expressive than CSL if time intervals starting at zero are employed. Using an automaton-based technique, an asCSL formula and a Markov chain with actions and state labels are combined into a product Markov chain. For time intervals starting at zero, we establish a reduction of the model checking problem for asCSL to CSL model checking on this product Markov chain. The usefulness of our approach is illustrated with an elaborate model of a scalable cellular communication system, for which several properties are formalized by means of asCSL formulas and checked using the new procedure.