A complete characterization of deterministic regular liveness properties

Authors:
Frank Nieβner;Ulrich Ultes-Nitsche
Affiliations:
Telecommunications, Networks and Security Research Group, Department of Computer Science, University of Fribourg, Boulevard de Pérolles 90, CH1700 Fribourg, Switzerland;Telecommunications, Networks and Security Research Group, Department of Computer Science, University of Fribourg, Boulevard de Pérolles 90, CH1700 Fribourg, Switzerland
Venue:
Theoretical Computer Science
Year:
2007

Citing 9
Cited 0

Complementing deterministic Bu¨chi automata in polynomial time

Journal of Computer and System Sciences
A hierarchy of temporal properties (invited paper, 1989)

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Reasoning about infinite computations

Information and Computation
Automata, Languages, and Machines

Automata, Languages, and Machines
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Proving the Correctness of Multiprocess Programs

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	5.23

Visualization

Abstract

Many systems can be modeled formally by nondeterministic Buchi-automata. The complexity of model checking then essentially depends on deciding subset conditions on languages that are recognizable by these automata and that represent the system behavior and the desired properties of the system. The involved complementation process may lead to an exponential blow-up in the size of the automata. We investigate a rich subclass of properties, called deterministic regular liveness properties, for which complementation at most doubles the automaton size if the properties are represented by deterministic Buchi-automata. In this paper, we will present a decomposition theorem for this language class that entails a complete characterization of the deterministic regular liveness properties, and extend an existing incomplete result which then, too, characterizes the deterministic regular liveness properties completely.