Explicit Fair Scheduling for Dynamic Control

Olderog, Ernst-Rüdiger; Podelski, Andreas

doi:10.1007/978-3-642-11512-7_7

Search citation statements

Order By: Relevance

Paper Sections

Select...

Reasoning About Fairness1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

2019

Publication Types

Select...

Article1

Book1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 3 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The transformations can be seen as implementing a general fair scheduler controlling finitely many processes. These transformations were extended in [OP10,HOP10] to deal with dynamic control, where processes can be created dynamically. Then the overall number of processes can be infinite, but at each step of an execution of the system the number of created processes is finite.…”

Section: Reasoning About Fairnessmentioning

confidence: 99%

Fifty years of Hoare’s logic

Apt

Olderog

2019

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The notion of fairness through explicit scheduling was developed by Olderog and Apt [31]. More recently, notions of fairness for infinitary control (i.e., where an infinite number of processes can be created) was considered by Hoenicke, Olderog, and Podelski [32,33].…”

Section: Introductionmentioning

confidence: 99%

Fair Termination for Parameterized Probabilistic Concurrent Systems

Lengál

Lin

Majumdar

et al. 2017

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of liveness is currently still considered extremely challenging especially in the presence of probabilities in the model. One major challenge is to provide a sufficiently powerful symbolic framework. One well-known symbolic framework for the parameterized verification of non-probabilistic concurrent systems is regular model checking. Although the framework was recently extended to probabilistic systems, incorporating fairness in the framework -often crucial for verifying termination -has been especially difficult due to the presence of an infinite number of fairness constraints (one for each process). Our main contribution is a systematic, regularity-preserving, encoding of finitary fairness (a realistic notion of fairness proposed by Alur & Henzinger) in the framework of regular model checking for probabilistic parameterized systems. Our encoding reduces termination with finitary fairness to verifying parameterized termination without fairness over probabilistic systems in regular model checking (for which a verification framework already exists). We show that our algorithm could verify termination for many interesting examples from distributed algorithms (Herman's protocol) and evolutionary biology (Moran process, cell cycle switch), which do not hold under the standard notion of fairness. To the best of our knowledge, our algorithm is the first fully-automatic method that can prove termination for these examples.

show abstract

Explicit Fair Scheduling for Dynamic Control

Cited by 3 publications

References 13 publications

Fifty years of Hoare’s logic

Fair Termination for Parameterized Probabilistic Concurrent Systems

Contact Info

Product

Resources

About