Skip to search formSkip to main contentSkip to account menu
A logic for reasoning about time and reliability
TLDR
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.
View on Springer
General decidability theorems for infinite-state systems
TLDR
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.
View on IEEE
Specification and refinement of probabilistic processes
  • B. Jonsson, K. Larsen
  • Computer Science
    [] Proceedings Sixth Annual IEEE Symposium on…
  • 15 July 1991
TLDR
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.
View on IEEE
Optimal dynamic partial order reduction
TLDR
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.
View on ACM
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
TLDR
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.
View via Publisher
Verifying programs with unreliable channels
  • P. Abdulla, B. Jonsson
  • Computer Science, Mathematics
    [] Proceedings Eighth Annual IEEE Symposium on…
  • 19 June 1993
TLDR
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.
View on IEEE
Regular Model Checking
TLDR
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.
View via Publisher
Probabilistic Extensions of Process Algebras
View via Publisher
A calculus for communicating systems with time and probabilities
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…
View on IEEE
A framework for reasoning about time and reliability
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…
View on IEEE
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License