Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Ranking Automata and Games for Prioritized Requirements
 

Summary: Ranking Automata and Games
for Prioritized Requirements
Rajeev Alur, Aditya Kanade, and Gera Weiss
University of Pennsylvania
Abstract. Requirements of reactive systems are usually specified by
classifying system executions as desirable and undesirable. To specify
prioritized requirements, we propose to associate a rank with each exe-
cution. This leads to optimization analogs of verification and synthesis
problems in which we compute the "best" requirement that can be satis-
fied or enforced from a given state. The classical definitions of acceptance
criteria for automata can be generalized to ranking conditions. In par-
ticular, given a mapping of states to colors, the Bšuchi ranking condition
maps an execution to the highest color visited infinitely often by the
execution, and the cyclic ranking condition with cycle k maps an execu-
tion to the modulo-k value of the highest color repeating infinitely often.
The well-studied parity acceptance condition is a special case of cyclic
ranking with cycle 2, and we show that the cyclic ranking condition can
specify all -regular ranking functions. We show that the classical char-
acterizations of acceptance conditions by fixpoints over sets generalize to
characterizations of ranking conditions by fixpoints over an appropriately

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Weiss, Gera - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences