This work presents a logic for stating properties such as, “after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds” and gives algorithms for checking that a given Markov chain satisfies a formula in the logic.Expand

This paper presents decidability results for a class of systems, which consist of a finite control part operating on an infinite data domain, and shows that the following properties are decidable for well-structured systems: reachability; eventuality; and simulation.Expand

A formalism for specifying probabilistic transition systems, which constitute a basic semantic model for description and analysis of reliability aspects of concurrent and distributed systems, is presented and it is shown that it is analogous to the extension from processes to modal transition systems.Expand

A new DPOR algorithm is presented, which is the first to be provably optimal in that it always explores the minimal number of executions and is based on a novel class of sets, called source sets, which replace the role of persistent sets in previous algorithms.Expand

This paper presents decidability results for a class of systems which consist of a finite control part operating on an infinite data domain, and shows that the following properties are decidable for well-structured systems.Expand

The verification of a particular class of infinite-state systems, namely, systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels, is considered and it is shown that several interesting verification problems are decidable by giving algorithms for verifying.Expand

Regular model checking is presented, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology, by computation of the transitive closure of a transition relation.Expand

A process algebra that extends R. Milner's (1983) calculus of communicating systems (CCS) with probabilities and time is presented. With this calculus it is possible to describe real-time and… Expand

A logic is presented for stating properties such as 'after a request for service there is at least a 98% probability that the service will be carried out within 2 s'. The logic extends the temporal… Expand