Predicate abstraction for reactive synthesis

@article{Walker2014PredicateAF,
  title={Predicate abstraction for reactive synthesis},
  author={Adam Walker and L. Ryzhyk},
  journal={2014 Formal Methods in Computer-Aided Design (FMCAD)},
  year={2014},
  pages={219-226}
}
  • Adam Walker, L. Ryzhyk
  • Published 2014
  • Computer Science
  • 2014 Formal Methods in Computer-Aided Design (FMCAD)
  • We present a predicate-based abstraction refinement algorithm for solving reactive games. We develop solutions to the key problems involved in implementing efficient predicate abstraction, which previously have not been addressed in game settings: (1) keeping abstractions concise by identifying relevant predicates only, (2) solving abstract games efficiently, and (3) computing and solving abstractions symbolically. We implemented the algorithm as part of an automatic device driver synthesis… CONTINUE READING
    19 Citations

    Figures, Tables, and Topics from this paper

    A SAT-Based Counterexample Guided Method for Unbounded Synthesis
    • 7
    • PDF
    Just-In-Time Reactive Synthesis
    • S. Maoz, Ilia Shevrin
    • Computer Science
    • 2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)
    • 2020
    On the Software Engineering Challenges of Applying Reactive Synthesis to Robotics
    • S. Maoz, Jan Oliver Ringert
    • Computer Science
    • 2018 IEEE/ACM 1st International Workshop on Robotics Software Engineering (RoSE)
    • 2018
    • 6
    A counterexample guided method for reactive synthesis
    • PDF
    Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts
    • 6
    • PDF
    A symbolic justice violations transition system for unrealizable GR(1) specifications
    • 13
    • PDF
    Performance Heuristics for GR(1) Synthesis and Related Algorithms
    • 7
    • PDF
    Performance heuristics for GR(1) synthesis and related algorithms
    • PDF

    References

    SHOWING 1-10 OF 26 REFERENCES
    Solving games via three-valued abstraction refinement
    • 34
    • Highly Influential
    • PDF
    Refining Approximations in Software Predicate Abstraction
    • 77
    • PDF
    Predicate Abstraction of ANSI-C Programs Using SAT
    • 207
    • PDF
    Counterexample-Guided Synthesis of Observation Predicates
    • 9
    • PDF
    Synthesis of Reactive(1) designs
    • 407
    • PDF
    Lazy abstraction
    • 1,208
    • PDF
    A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement
    • 36
    • PDF
    Three-valued abstractions of games: uncertainty, but with precision
    • 55
    • PDF
    Successive approximation of abstract transition relations
    • S. Das, D. Dill
    • Computer Science
    • Proceedings 16th Annual IEEE Symposium on Logic in Computer Science
    • 2001
    • 128