Abstraction for Stochastic Systems by Erlang’s Method of Stages

Katoen, Joost-Pieter; Klink, Daniel; Leucker, Martin; Wolf, Verena

doi:10.1007/978-3-540-85361-9_24

Cited by 6 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the realm of stochastic systems, interval abstractions for discrete-time Markov chains are used in Jonsson and Larsen [1991], Huth [2005], Katoen et al [2008Katoen et al [ , 2007.…”

Section: Related Workmentioning

confidence: 99%

Modal abstractions of concurrent behavior

Nielson

Nanz

Nielson

2011

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

We present an effective algorithm for the automatic construction of finite modal transition systems as abstractions of potentially infinite concurrent processes. Modal transition systems are recognized as valuable abstractions for model checking because they allow for the validation as well as refutation of safety and liveness properties. However, the algorithmic construction of finite abstractions from potentially infinite concurrent processes is a missing link that prevents their more widespread usage for model checking of concurrent systems. Our algorithm is a worklist algorithm using concepts from abstract interpretation and operating upon mappings from sets to intervals in order to express simultaneous over-and underapproximations of the multisets of process actions available in a particular state. We obtain a finite abstraction that is 3-valued in both states and transitions and that supports the definition of a 3-valued modal logic for validating as well as refuting properties of systems. The construction is illustrated on a few examples, including the Ingemarsson-Tang-Wong key agreement protocol.

show abstract

“…In the realm of stochastic systems, interval abstractions for discrete-time Markov chains are used in Jonsson and Larsen [1991], Huth [2005], Katoen et al [2008Katoen et al [ , 2007.…”

Section: Related Workmentioning

confidence: 99%

Modal abstractions of concurrent behavior

Nielson

Nanz

Nielson

2011

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

show abstract

“…The column-wise abstraction results in a state space reduction by a factor 20 and reduces the run-times with several orders of magnitude. For further details on this case study we refer to [11]. The results have been obtained using the mrmc model checker [12].…”

Section: Systems Biology: Enzyme Kineticsmentioning

confidence: 99%

Model Checking: One Can Do Much More Than You Think!

Katoen

2012

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Cite

Model checking is an automated verification technique that actively is applied to find bugs in hardware and software designs. Companies like IBM and Cadence developed their in-house model checkers, and acted as driving forces behind the design of the IEEE-standardized temporal logic PSL. On the other hand, model checking C-, C#and .NETprogram code is an intensive research topic at, for instance, Microsoft and NASA. In this short paper, we briefly discuss three non-standard applications of model checking. The first example is taken from systems biology and shows the relevance of probabilistic reachability. Then, we show how to determine the optimal scheduling policy for multiple-battery systems so as to optimize the system's lifetime. Finally, we discuss a stochastic job scheduling problem that -thanks to recent developments-can be solved using model checking.

show abstract