On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Reasoning about infinite computations
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic (TOCL)
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Memory arbiter synthesis and verification for a radar memory interface card
Nordic Journal of Computing
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Latticed simulation relations and games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Perfect information stochastic priority games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On Omega-Languages Defined by Mean-Payoff Conditions
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Minimizing deterministic lattice automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Equilibria in quantitative reachability games
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Subgame perfection for equilibria in quantitative reachability games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Input-output robustness for discrete systems
Proceedings of the tenth ACM international conference on Embedded software
Approximating deterministic lattice automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
On Equilibria in Quantitative Games with Reachability/Safety Objectives
Theory of Computing Systems
| Hi-index | 0.00 |
Requirements of reactive systems are usually specified by classifying system executions as desirable and undesirable. To specify prioritizedrequirements, we propose to associate a rank with each execution. This leads to optimization analogs of verification and synthesis problems in which we compute the "best" requirement that can be satisfied or enforced from a given state. The classical definitions of acceptance criteria for automata can be generalized to ranking conditions. In particular, given a mapping of states to colors, the Büchi rankingcondition maps an execution to the highest color visited infinitely often by the execution, and the cyclic rankingcondition with cycle kmaps an execution to the modulo-kvalue 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 characterizations of acceptance conditions by fixpoints over sets generalize to characterizations of ranking conditions by fixpoints over an appropriately chosen lattice of coloring functions. This immediately leads to symbolic algorithms for solving verification and synthesis problems. Furthermore, the precise complexity of a decision problem for ranking conditions is no more than the corresponding acceptance version, and in particular, we show how to solve Büchi ranking games in quadratic time.