Reasoning about infinite computations
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic (TOCL)
Deterministic w Automata vis-a-vis Deterministic Buchi Automata
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Verification of Fair Transisiton Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Taming interface specifications
CONCUR 2005 - Concurrency Theory
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Co-ing Büchi Made Tight and Useful
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
Faster algorithms for finitary games
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Finitary winning in ω-regular games
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
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.