Languages, automata, and logic
Handbook of formal languages, vol. 3
Model checking
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
From Live Sequence Charts to State Machines and Back: A Guided Tour
IEEE Transactions on Software Engineering
Specify, Compile, Run: Hardware from PSL
Electronic Notes in Theoretical Computer Science (ENTCS)
Diconic addition of failsafe fault-tolerance
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Dealing with Nondeterminism in Symbolic Control
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Complexity results in revising UNITY programs
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Optimal Strategy Synthesis in Request-Response Games
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
Time-Optimal Winning Strategies for Poset Games
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Finitary winning in ω-regular games
ACM Transactions on Computational Logic (TOCL)
Faster algorithms for finitary games
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Optimizing winning strategies in regular infinite games
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
The complexity of request-response games
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
A new algorithm for strategy synthesis in LTL games
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Synthesis of Reactive(1) designs
Journal of Computer and System Sciences
A Lightweight Method for Automated Design of Convergence in Network Protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
Action-based discovery of satisfying subsets: A distributed method for model correction
Information and Software Technology
| Hi-index | 0.00 |
We present a method to solve certain infinite games over finite state spaces and apply this for the automatic synthesis of finitestate controllers. A lift-controller problem serves as an example for which the implementation of our algorithm has been tested. The specifications consist of safety conditions and so-called "request-response-conditions" (which have the form "after visiting a state of P later a state of R is visited"). Many real-life problems can be modeled in this framework. We sketch the theoretical solution which synthesizes a finite-state controller for satisfiable specifications. The core of the implementation is a convenient input language (based on enriched Boolean logic) and a realization of the abstract algorithms with OBDD's (ordered binary decision diagrams).