ACM Transactions on Computer Systems (TOCS)
Theoretical Computer Science
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
Compositional performance modelling with the TIPPtool
Performance Evaluation - Special issue on modelling techniques and tools for performance evaluation
Stochastic activity networks: formal definitions and concepts
Lectures on formal methods and performance analysis
The Möbius Framework and Its Implementation
IEEE Transactions on Software Engineering
Deriving Symbolic Representations from Stochastic Process Algebras
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
On the Logical Characterisation of Performability Properties
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Towards Model Checking Stochastic Process Algebra
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
Model Checking Action- and State-Labelled Markov Chains
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Probabilistic symbolic model checking with PRISM: a hybrid approach
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
This paper presents IM-SPDL, a stochastic extension of the modal logic PDL, which supports the specification of complex performance and dependability requirements. The logic is interpreted over extended stochastic labelled transition systems (ESLTS), i.e. transition systems containing both immediate and Markovian transitions. We define the syntax and semantics of the new logic and show that IM-SPDL provides powerful means to specify path-based properties with timing restrictions. In general, paths can be characterised by regular expressions, also called programs, where the executability of a program may depend on the validity of test formulae. For the model checking of IM-SPDL time-bounded path formulae, a deterministic program automaton is constructed from the requirement. Afterwards the product transition system between this automaton and the ESLTS is built and subsequently transformed into a continuous time Markov Chain (CTMC) on which numerical analysis is performed. Empirical results given in the paper show that model checking IM-SPDL can be realised efficiently in practice.