Information Processing Letters
Synthesis of programs from temporal property specifications
MEMOCODE'09 Proceedings of the 7th IEEE/ACM international conference on Formal Methods and Models for Codesign
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On synthesizing controllers from bounded-response properties
CAV'07 Proceedings of the 19th international conference on Computer aided verification
AspectLTL: an aspect language for LTL specifications
Proceedings of the tenth international conference on Aspect-oriented software development
Synthesis of live behaviour models for fallible domains
Proceedings of the 33rd International Conference on Software Engineering
Modal transition systems: composition and LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
JTLV: a framework for developing verification algorithms
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Robustness in the presence of liveness
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Two-way traceability and conflict debugging for AspectLTL programs
Proceedings of the 11th annual international conference on Aspect-oriented Software Development
Strategy improvement for stochastic rabin and streett games
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Effective synthesis of asynchronous systems from GR(1) specifications
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Efficient controller synthesis for consumption games with multiple resource types
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Assume-guarantee scenarios: semantics and synthesis
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Code aware resource management
Formal Methods in System Design
Counter play-out: executing unrealizable scenario-based specifications
Proceedings of the 2013 International Conference on Software Engineering
Automata with generalized rabin pairs for probabilistic model checking and LTL synthesis
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Two-Way traceability and conflict debugging for AspectLTL programs
Transactions on Aspect-Oriented Software Development X
| Hi-index | 0.00 |
In this paper we improve the complexity of solving Rabin and Streett games to approximately the square root of previous bounds. We introduce direct Rabin and Streett ranking that are a sound and complete way to characterize the winning sets in the respective games.