Bounded Fairness

Dershowitz, Nachum; Jayasimha, D.N.; Park, Seungjoon

doi:10.1007/978-3-540-39910-0_14

Cited by 17 publications

(17 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this is not monitorable in a formal sense [8,9] as it cannot be satisfied or violated based on a finite number of observations. However, if we were to introduce a stronger property of bounded fairness [7], e.g. a clause of age A will be processed within kA iterations for some constant k, then this property becomes monitorable (this is now a response property).…”

Section: Handling Non-theorem Resultsmentioning

confidence: 99%

Testing a Saturation-Based Theorem Prover: Experiences and Challenges

2017

View full text Add to dashboard Cite

Abstract. This paper attempts to address the question of how best to assure the correctness of saturation-based automated theorem provers using our experience with developing the theorem prover Vampire. We describe the techniques we currently employ to ensure that Vampire is correct and use this to motivate future challenges that need to be addressed to make this process more straightforward and to achieve better correctness guarantees.

show abstract

Section: Handling Non-theorem Resultsmentioning

confidence: 99%

Testing a Saturation-Based Theorem Prover: Experiences and Challenges

2017

View full text Add to dashboard Cite

show abstract

“…The semantics, termed finitary fairness in [3], bounded fairness in [9], and prompt eventually in [15], does not suffer from the above two drawbacks and is still more restrictive than the standard semantics. In the alternative semantics, the wait time is bounded, but the bound is not known in advance.…”

Section: Introductionmentioning

confidence: 99%

“…We show how we can circum-vent the complementation, work, instead, with an automaton that approximates the complementing one, in the sense it accepts only words with a fixed bound, and still solve the regularity, universality, and containment problems. Related work The work in [9,15] studies the prompt semantics from a temporallogic prospective. In [9], the authors study an eventuality operator parameterized by a bound (see also [2]), and the possibility of quantifying the bound existentially.…”

Section: Introductionmentioning

confidence: 99%

“…Related work The work in [9,15] studies the prompt semantics from a temporallogic prospective. In [9], the authors study an eventuality operator parameterized by a bound (see also [2]), and the possibility of quantifying the bound existentially. In [15], the authors study the logic prompt-LTL, which extends LTL by a prompt-eventuality operator F p .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Promptness in ω-Regular Automata

Almagor

Hirshfeld

Kupferman

2010

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. Liveness properties of on-going reactive systems assert that something good will happen eventually. In satisfying liveness properties, there is no bound on the "wait time", namely the time that may elapse until an eventuality is fulfilled. The traditional "unbounded" semantics of liveness properties nicely corresponds to the classical semantics of automata on infinite objects. Indeed, acceptance is defined with respect to the set of states the run visits infinitely often, with no bound on the number of transitions taken between successive visits. In many applications, it is important to bound the wait time in liveness properties. Bounding the wait time by a constant is not always possible, as the bound may not be known in advance. It may also be very large, resulting in large specifications. Researchers have studied prompt eventualities, where the wait time is bounded, but the bound is not known in advance. We study the automata-theoretic counterpart of prompt eventually. In a prompt-Büchi automaton, a run r is accepting if there exists a bound k such that r visits an accepting state every at most k transitions. We study the expressive power of nondeterministic and deterministic prompt-Büchi automata, their properties, and decision problems for them. In particular, we show that regular nondeterministic prompt Büchi automata are exactly as expressive as nondeterministic co-Büchi automata.

show abstract

“…For instance, Alur and Henzinger define finitary fairness roughly as the property requiring that there be a fixed bound on the number of steps between two occurrences of any given color [AH98]. A similar proposal, supported by a corresponding temporal logic, was made by Dershowitz et al [DJP03]. On a finitarily fair path, all colors have positive asymptotic frequency 1 .…”

Section: Introductionmentioning

confidence: 99%

Balanced Paths in Colored Graphs

Bianco

Faella

Mogavero

et al. 2009

Mathematical Foundations of Computer Science 2009

View full text Add to dashboard Cite

Abstract. We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infinite path where either (i) all colors occur with the same asymptotic frequency, or (ii) there is a constant which bounds the difference between the occurrences of any two colors for all prefixes of the path. These two notions can be viewed as refinements of the classical notion of fair path, whose simplest form checks whether all colors occur infinitely often. Our notions provide stronger criteria, particularly suitable for scheduling applications based on a coarse-grained model of the jobs involved. We show that both problems are solvable in polynomial time, by reducing them to the feasibility of a linear program.

show abstract

Bounded Fairness

Cited by 17 publications

References 0 publications

Testing a Saturation-Based Theorem Prover: Experiences and Challenges

Testing a Saturation-Based Theorem Prover: Experiences and Challenges

Promptness in ω-Regular Automata

Balanced Paths in Colored Graphs

Contact Info

Product

Resources

About