Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Handbook of theoretical computer science (vol. B)
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The Rabin Index and Chain Automata, with Applications to Automatas and Games
Proceedings of the 7th International Conference on Computer Aided Verification
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Experiments with deterministic ω-automata for formulas of linear temporal logic
Theoretical Computer Science - Implementation and application of automata
Interactive presentation: Automatic hardware synthesis from specifications: a case study
Proceedings of the conference on Design, automation and test in Europe
Specify, Compile, Run: Hardware from PSL
Electronic Notes in Theoretical Computer Science (ENTCS)
Finitary winning in ω-regular games
ACM Transactions on Computational Logic (TOCL)
Synthesis of Fault-Tolerant Distributed Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Receding horizon control for temporal logic specifications
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Church's problem and a tour through automata theory
Pillars of computer science
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
Synthesis of reactive(1) designs
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Temporal-Logic-Based Reactive Mission and Motion Planning
IEEE Transactions on Robotics
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Automata with generalized rabin pairs for probabilistic model checking and LTL synthesis
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.00 |
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly generate prototype implementations for realizable specifications. It has been observed, however, that automatically generated implementations typically do not share the robustness of manually constructed solutions with respect to assumption violations, i.e., they typically do not degenerate nicely when the assumptions in the specification are violated. As a remedy, robust synthesis methods have been proposed. Unfortunately, previous such techniques induced obstacles to their efficient implementation in practice and typically do not scale well. In this paper, we introduce generalized Rabin(1) synthesis as a solution to this problem. Our approach inherits the good algorithmic properties of generalized reactivity(1) synthesis but extends it to also allow co-Büchi-type assumptions and guarantees, which makes it usable for the synthesis of robust systems