article

Synthesis of Reactive(1) designs

Authors:

Roderick Bloem,

Barbara Jobstmann,

Yaniv SaarAuthors Info & Claims

Journal of Computer and System Sciences, Volume 78, Issue 3

Pages 911 - 938

https://doi.org/10.1016/j.jcss.2011.08.007

Published: 01 May 2012 Publication History

Abstract

We address the problem of automatically synthesizing digital designs from linear-time specifications. We consider various classes of specifications that can be synthesized with effort quadratic in the number of states of the reactive system, where we measure effort in symbolic steps. The synthesis algorithm is based on a novel type of game called General Reactivity of rank 1 (gr(1)), with a winning condition of the form(@?@?@?p"1@?...@?@?@?@?p"m)->(@?@?@?q"1@?...@?@?@?@?q"n), where each p"i and q"i is a Boolean combination of atomic propositions. We show symbolic algorithms to solve this game, to build a winning strategy and several ways to optimize the winning strategy and to extract a system from it. We also show how to use gr(1) games to solve the synthesis of ltl specifications in many interesting cases. As empirical evidence to the generality and efficiency of our approach we include a significant case study. We describe the formal specifications and the synthesis process applied to a bus arbiter, which is a realistic industrial hardware specification of modest size.

References

[1]

Piterman, N., Pnueli, A. and Sa¿ar, Y., Synthesis of reactive(1) designs. In: Lecture Notes in Comput. Sci., vol. 3855. Springer-Verlag. pp. 364-380.

[2]

Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A. and Weiglhofer, M., Automatic hardware synthesis from specifications: A case study. In: Design Automation and Test in Europe, ACM. pp. 1188-1193.

[3]

Specify, compile, run: Hardware from PSL. In: Electron. Notes Theor. Comput. Sci., vol. 190. pp. 3-16.

[4]

Jobstmann, B., Galler, S., Weiglhofer, M. and Bloem, R., Anzu: A tool for property synthesis. In: Lecture Notes in Comput. Sci., vol. 4590. Springer-Verlag. pp. 258-262.

[5]

A. Church, Logic, arithmetic and automata, in: Proc. 1962 Int. Congr. Math. Upsala, 1963, pp. 23-25.

[6]

Büchi, J. and Landweber, L., Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc. v138. 295-311.

[7]

Rabin, M., Automata on Infinite Objects and Churc's Problem. 1972. CBMS Reg. Conf. Ser. Math., 1972.Amer. Math. Soc.

Digital Library

[8]

Pnueli, A. and Rosner, R., On the synthesis of an asynchronous reactive module. In: Lecture Notes in Comput. Sci., vol. 372. Springer-Verlag. pp. 652-671.

[9]

Clarke, E. and Emerson, E., Design and synthesis of synchronization skeletons using branching time temporal logic. In: Lecture Notes in Comput. Sci., vol. 131. Springer-Verlag. pp. 52-71.

Digital Library

[10]

Manna, Z. and Wolper, P., Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Syst. v6. 68-93.

Digital Library

[11]

R. Rosner, Modular synthesis of reactive systems, PhD thesis, Weizmann Institute of, Science, 1992.

[12]

Wallmeier, N., Hütten, P. and Thomas, W., Symbolic synthesis of finite-state controllers for request-response specifications. In: Lecture Notes in Comput. Sci., vol. 2759. Springer-Verlag. pp. 11-22.

Digital Library

[13]

Alur, R. and Torre, S.L., Deterministic generators and games for LTL fragments. ACM Trans. Comput. Log. v5 i1. 1-25.

Digital Library

[14]

Harding, A., Ryan, M. and Schobbens, P., A new algorithm for strategy synthesis in LTL games. In: Lecture Notes in Comput. Sci., vol. 3440. Springer-Verlag. pp. 477-492.

[15]

Jobstmann, B., Griesmayer, A. and Bloem, R., Program repair as a game. In: Lecture Notes in Comput. Sci., vol. 3576. Springer-Verlag. pp. 226-238.

[16]

Asarin, E., Maler, O., Pnueli, A. and Sifakis, J., Controller synthesis for timed automata. In: IFAC Symposium on System Structure and Control, Elsevier. pp. 469-474.

[17]

Z. Manna, A. Pnueli, A hierarchy of temporal properties, in: Proc. 9th ACM Symp. Princ. of Dist. Comp., 1990, pp. 377-408.

[18]

Kesten, Y., Piterman, N. and Pnueli, A., Bridging the gap between fair simulation and trace inclusion. Inform. and Comput. v200 i1. 36-61.

[19]

Bloem, R., Gabow, H.N. and Somenzi, F., An algorithm for strongly connected component analysis in nlogn symbolic steps. Formal Methods Syst. Des. v28 i1. 37-56.

[20]

Pnueli, A., In transition from global to modular temporal reasoning about programs. Logics Models Concurrent Syst. v13. 123-144.

[21]

A. Ltd., AMBA specification (rev. 2), available from www.arm.com, 1999.

[22]

B. Jobstmann, R. Bloem, Optimizations for LTL synthesis, in: Proc. of the 6th Int. Conf. on Formal Methods in Computer-Aided Design, IEEE, 2006, pp. 117-124.

Digital Library

[23]

Sohail, S., Somenzi, F. and Ravi, K., A hybrid algorithm for LTL games. In: Lecture Notes in Comput. Sci., vol. 4905. Springer-Verlag. pp. 309-323.

[24]

S. Sohail, F. Somenzi, Safety first: A two-stage algorithm for LTL games, in: Proc. of the 9th Int. Conf. on Formal Methods in Computer-Aided Design, IEEE, 2009, pp. 77-84.

[25]

Henzinger, T. and Piterman, N., Solving games without determinization. In: Lecture Notes in Comput. Sci., vol. 4207. Springer-Verlag. pp. 394-410.

[26]

A. Morgenstern, Symbolic controller synthesis for LTL specifications, PhD thesis, Universität Kaiserslautern, 2010.

[27]

O. Kupferman, M. Vardi, Safraless decision procedures, in: Proc. of the 46th IEEE Symp. on Foundations of Computer Science, 2005, pp. 531-542.

Digital Library

[28]

Kupferman, O., Piterman, N. and Vardi, M., Safraless compositional synthesis. In: Lecture Notes in Comput. Sci., vol. 4144. Springer-Verlag. pp. 31-44.

[29]

S. Schewe, Bounded synthesis, in: Automated Technology for Verification and Analysis, 2007, pp. 474-488.

[30]

Filiot, E., Jin, N. and Raskin, J.-F., An antichain algorithm for ltl realizability. In: Lecture Notes in Comput. Sci., vol. 5643. Springer-Verlag. pp. 263-277.

[31]

Eisner, C. and Fisman, D., A Practical Introduction to PSL. 2006. Springer-Verlag.

[32]

Kesten, Y. and Pnueli, A., Verification by augmented finitary abstraction. Inform. and Comput. v163. 203-243.

Digital Library

[33]

A. Pnueli, R. Rosner, Distributed reactive systems are hard to synthesize, in: Proc. of the 31st IEEE Symp. Found. of Comp. Sci., 1990, pp. 746-757.

[34]

Results on the propositional µ-calculus. Theoret. Comput. Sci. v27. 333-354.

[35]

E.A. Emerson, C.L. Lei, Efficient model-checking in fragments of the propositional modal µ-calculus, in: Proc. of the 1st IEEE Symp. Logic in Comp. Sci., 1986, pp. 267-278.

[36]

Long, D., Brown, A., Clarke, E., Jha, S. and Marrero, W., An improved algorithm for the evaluation of fixpoint expressions. In: Lecture Notes in Comput. Sci., vol. 818. Springer-Verlag. pp. 338-350.

Digital Library

[37]

Jurdziński, M., Small progress measures for solving parity games. In: Lecture Notes in Comput. Sci., vol. 1770. Springer-Verlag. pp. 290-301.

[38]

Emerson, E., Model checking and the µ-calculus. In: Immerman, N., Kolaitis, P. (Eds.), Descriptive Complexity and Finite Models, American Mathematical Society. pp. 185-214.

[39]

O. Lichtenstein, Decidability, completeness, and extensions of linear time temporal logic, PhD thesis, Weizmann Institute of Science, 1991.

[40]

Pnueli, A., Sa¿ar, Y. and Zuck, L.D., JTLV: A framework for developing verification algorithms. In: Lecture Notes in Comput. Sci., vol. 6174. Springer-Verlag. pp. 171-174.

Digital Library

[41]

Juvekar, S. and Piterman, N., Minimizing generalized Büchi automata. In: Lecture Notes in Comput. Sci., vol. 4144. Springer-Verlag. pp. 45-58.

[42]

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. and Jobstmann, B., Robustness in the presence of liveness. In: Lecture Notes in Comput. Sci., vol. 6174. Springer-Verlag. pp. 410-424.

[43]

R. Koenighofer, G. Hofferek, R. Bloem, Debugging formal specifications using simple counterstrategies, in: Proc. of the 9th Int. Conf. on Formal Methods in Computer-Aided Design, IEEE, 2009, pp. 152-159.

[44]

Building circuits from relations. In: Lecture Notes in Comput. Sci., vol. 1855. Springer-Verlag. pp. 113-123.

[45]

ftp://vlsi.colorado.edu/pub/

[46]

A.J. Hu, D. Dill, Reducing BDD size by exploiting functional dependencies, in: Proc. of the Design Automation Conference, Dallas, TX, 1993, pp. 266-271.

[47]

Prosyd - Property-Based System Design, http://www.prosyd.org/, EU grant 507219, 2004-2007.

[48]

Abadi, M. and Lamport, L., The existence of refinement mappings. Theoret. Comput. Sci. v82 i2. 253-284.

[49]

Dederichs, F. and Weber, R., Safety and liveness from a methodological point of view. Inform. Process. Lett. v36 i1. 25-30.

[50]

Preserving liveness: Comments on "safety and liveness from a methodological point of view". Inform. Process. Lett. v40 i3. 141-142.

[51]

Kesten, Y., Pnueli, A. and Raviv, L., Algorithmic verification of linear temporal logic specifications. In: Lecture Notes in Comput. Sci., vol. 1443. Springer-Verlag. pp. 1-16.

Digital Library

[52]

Pnueli, A. and Zaks, A., On the merits of temporal testers. In: Lecture Notes in Comput. Sci., vol. 5000. Springer-Verlag. pp. 172-195.

[53]

A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. of the 16th ACM Symp. Princ. of Prog. Lang., 1989, pp. 179-190.

[54]

http://www.eecs.berkeley.edu/~alanmi/abc/

[55]

Y. Godhal, K. Chatterjee, T.A. Henzinger, Synthesis of AMBA AHB from formal specification, Tech. Rep. abs/1001.2811, CORR, 2010.

[56]

Hachtel, G.D. and Somenzi, F., Logic Synthesis and Verification Algorithms. 1996. Kluwer Academic Publishers, Boston, MA.

[57]

I. Pill, S. Semprini, R. Cavada, M. Roveri, R. Bloem, A. Cimatti, Formal analysis of hardware requirements, in: Proc. of the Design Automation Conference, 2006, pp. 821-826.

[58]

Cimatti, A., Roveri, M., Schuppan, V. and Tchaltsev, A., Diagnostic information for realizability. In: Lecture Notes in Comput. Sci., vol. 4905. Springer-Verlag. pp. 52-67.

Digital Library

[59]

Chatterjee, K., Henzinger, T. and Jobstmann, B., Environment assumptions for synthesis. In: Lecture Notes in Comput. Sci., vol. 5201. Springer-Verlag. pp. 147-161.

Digital Library

[60]

Bloem, R., Chatterjee, K., Henzinger, T. and Jobstmann, B., Better quality in synthesis through quantitative objectives. In: Lecture Notes in Comput. Sci., vol. 5643. Springer-Verlag. pp. 140-156.

[61]

R. Bloem, K. Greimel, T. Henzinger, B. Jobstmann, Synthesizing robust systems, in: Proc. of the 9th Int. Conf. on Formal Methods in Computer-Aided Design, IEEE, 2009, pp. 85-92.

[62]

A. Pnueli, U. Klein, Synthesis of programs from temporal property specifications, in: Proc. Formal Methods and Models for Co-Design (MEMOCODE), IEEE, 2009, pp. 1-7.

[63]

Abadi, M., Lamport, L. and Wolper, P., Realizable and unrealizable specifications of reactive systems. In: Lecture Notes in Comput. Sci., vol. 372. Springer-Verlag. pp. 1-17.

Digital Library

[64]

Pnueli, A. and Shahar, E., A platform for combining deductive with algorithmic verification. In: Lecture Notes in Comput. Sci., vol. 1102. Springer-Verlag. pp. 184-195.

[65]

Bloem, R., Cavada, R., Pill, I., Roveri, M. and Tchaltsev, A., Rat: A tool for the formal analysis of requirements. In: Lecture Notes in Comput. Sci., vol. 4590. Springer-Verlag. pp. 263-267.

[66]

Bloem, R., Cimatti, A., Greimel, K., Hofferek, G., Koenighofer, R., Roveri, M., Schuppan, V. and Seeber, R., RATSY - a new requirements analysis tool with synthesis. In: Lecture Notes in Comput. Sci., vol. 6174. Springer-Verlag. pp. 425-429.

[67]

H. Kress-Gazit, G.E. Fainekos, G.J. Pappas, Where's waldo? sensor-based temporal logic motion planning, in: Conf. on Robotics and Automation, IEEE, 2007, pp. 3116-3121.

[68]

D.C. Conner, H. Kress-Gazit, H. Choset, A.A. Rizzi, G.J. Pappas, Valet parking without a valet, in: Conf. on Intelligent Robots and Systems, IEEE, 2007, pp. 572-577.

[69]

H. Kress-Gazit, G. Fainekos, G. Pappas, From structured English to robot motion, in: Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, IEEE, 2007, pp. 2717-2722.

[70]

T. Wongpiromsarn, U. Topcu, R.M. Murray, Receding horizon temporal logic planning for dynamical systems, in: Proc. of the 48th IEEE Conf. on Decision and Control, IEEE, 2009, pp. 5997-6004.

[71]

T. Wongpiromsarn, U. Topcu, R.M. Murray, Receding horizon control for temporal logic specifications, in: Proc. of the 13th ACM Int. Conf. on Hybrid Systems: Computation and Control, ACM, 2010, pp. 101-110.

[72]

T. Wongpiromsarn, U. Topcu, R.M. Murray, Automatic synthesis of robust embedded control software, in: In AAAI Spring Symposium on Embedded Reasoning: Intelligence in Embedded Systems, 2010, pp. 104-110.

[73]

Kugler, H., Plock, C. and Pnueli, A., Controller synthesis from LSC requirements. In: Lecture Notes in Comput. Sci., vol. 5503. Springer-Verlag. pp. 79-93.

[74]

Kugler, H. and Segall, I., Compositional synthesis of reactive systems from live sequence chart specifications. In: Lecture Notes in Comput. Sci., vol. 5505. Springer-Verlag. pp. 77-91.

[75]

S. Maoz, Y. Sa¿ar, Aspectltl: an aspect language for ltl specifications, in: Proc. of the 10th Int. Conf. on Aspect-Oriented Software Development, ACM, 2011, pp. 19-30.

Cited By

Wete EGreenyer JKudenko DNejdl WDastani MSichman JAlechina NDignum V(2024)Multi-Robot Motion and Task Planning in Automotive Production Using Controller-based Safe Reinforcement LearningProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663056(1928-1937)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663056
Belardinelli FJamroga WMittelmann MMurano ADastani MSichman JAlechina NDignum V(2024)Verification of Stochastic Multi-Agent Systems with Forgetful StrategiesProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662863(160-169)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662863
Aminof BDe Giacomo GRubin SZuleger FMarquis POrtiz MPagnucco M(2024)Proper linear-time specifications of environment behaviors in nondeterministic planning and reactive synthesisProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/4(38-48)Online publication date: 2-Nov-2024
https://dl.acm.org/doi/10.24963/kr.2024/4
Show More Cited By

Synthesis of Reactive(1) designs
1. Software and its engineering
  1. Software organization and properties
    1. Software functional properties
2. Theory of computation

Recommendations

Can reactive synthesis and syntax-guided synthesis be friends?
SPLASH Companion 2021: Companion Proceedings of the 2021 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity

While reactive synthesis and syntax-guided synthesis (SyGuS) have seen enormous progress in recent years, combining the two approaches has remained a challenge. In this work, we present the synthesis of reactive programs from Temporal Stream Logic ...
Can reactive synthesis and syntax-guided synthesis be friends?
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation

While reactive synthesis and syntax-guided synthesis (SyGuS) have seen enormous progress in recent years, combining the two approaches has remained a challenge. In this work, we present the synthesis of reactive programs from Temporal Stream Logic ...
Specification decomposition for reactive synthesis
Abstract
Reactive synthesis is the task of automatically deriving a correct implementation from a specification. It is a promising technique for the development of verified programs and hardware. Despite recent advances in terms of algorithms and tools, ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Computer and System Sciences

Journal of Computer and System Sciences Volume 78, Issue 3

May, 2012

310 pages

ISSN:0022-0000

Issue’s Table of Contents

Copyright © Elsevier Inc. © 2011.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 May 2012

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

146
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wete EGreenyer JKudenko DNejdl WDastani MSichman JAlechina NDignum V(2024)Multi-Robot Motion and Task Planning in Automotive Production Using Controller-based Safe Reinforcement LearningProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663056(1928-1937)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663056
Belardinelli FJamroga WMittelmann MMurano ADastani MSichman JAlechina NDignum V(2024)Verification of Stochastic Multi-Agent Systems with Forgetful StrategiesProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662863(160-169)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662863
Aminof BDe Giacomo GRubin SZuleger FMarquis POrtiz MPagnucco M(2024)Proper linear-time specifications of environment behaviors in nondeterministic planning and reactive synthesisProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/4(38-48)Online publication date: 2-Nov-2024
https://dl.acm.org/doi/10.24963/kr.2024/4
Zhang YXu SChen HAslam Bhatt UHuang M(2024)Context-aware environment online monitoring for safety autonomous vehicle systems: an automata-theoretic approachJournal of Cloud Computing: Advances, Systems and Applications10.1186/s13677-023-00567-813:1Online publication date: 3-Jan-2024
https://dl.acm.org/doi/10.1186/s13677-023-00567-8
Brizzio MRoychoudhury APaiva AAbreu RStorey M(2024)Resolving Goal-Conflicts and Scaling Synthesis through Mode-Based DecompositionProceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings10.1145/3639478.3639801(207-211)Online publication date: 14-Apr-2024
https://dl.acm.org/doi/10.1145/3639478.3639801
Heim PDimitrova R(2024)Solving Infinite-State Games via AccelerationProceedings of the ACM on Programming Languages10.1145/36328998:POPL(1696-1726)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632899
Patton NRahmani KMissula MBiswas JDillig I(2024)Programming-by-Demonstration for Long-Horizon Robot TasksProceedings of the ACM on Programming Languages10.1145/36328608:POPL(512-545)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632860
Gorenstein AMaoz SRingert JRoychoudhury APaiva AAbreu RStorey M(2024)Kind Controllers and Fast Heuristics for Non-Well-Separated GR(1) SpecificationsProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3608131(1-12)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3608131
Cimatti AGeatti LGigante NMontanari ATonetta S(2024)Extended bounded response LTL: a new safety fragment for efficient reactive synthesisFormal Methods in System Design10.1007/s10703-021-00383-364:1(1-49)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s10703-021-00383-3
Cimatti AGeatti LGigante NMontanari ATonetta S(2024)Fairness, assumptions, and guarantees for extended bounded response LTL+P synthesisSoftware and Systems Modeling (SoSyM)10.1007/s10270-023-01122-423:2(427-453)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s10270-023-01122-4
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents