Automata and Games for Synthesis

Authors:
Igor Walukiewicz
Affiliations:
-
Venue:
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Year:
2002

Citing 7
Cited 0

Languages, automata, and logic

Handbook of formal languages, vol. 3
µ-Calculus Synthesis

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Small Progress Measures for Solving Parity Games

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Games for synthesis of controllers with partial observation

Theoretical Computer Science - Logic and complexity in computer science
Synthesizing Distributed Systems

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Distributed reactive systems are hard to synthesize

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The synthesis of controllers for discrete event systems, as introduced by Ramadge and Wonham, amounts to computing winning strategies in simple parity games. We describe an extension of this framework to arbitrary regular specifications on infinite behaviours. We also consider the extension to decentralized control. Finally, we discuss some means to compare quality of strategies.