Article

Symbolic bounded synthesis

Author:

Rüdiger EhlersAuthors Info & Claims

CAV'10: Proceedings of the 22nd international conference on Computer Aided Verification

Pages 365 - 379

https://doi.org/10.1007/978-3-642-14295-6_33

Published: 15 July 2010 Publication History

Abstract

Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have significantly improved its practical applicability Many works in this area are based on the Safraless synthesis approach Here, the computation is usually performed either in an explicit way or using symbolic data structures other than binary decision diagrams (BDDs) In this paper, we close this gap and consider Safraless synthesis using BDDs as state space representation The key to this combination is the application of novel optimisation techniques which decrease the number of state bits in such a representation significantly We evaluate our approach on several practical benchmarks, including a new load balancing case study Our experiments show an improvement of several orders of magnitude over previous approaches.

References

[1]

Bloem, R., Cimatti, A., Pill, I., Roveri, M.: Symbolic implementation of alternating automata International Journal of Foundations of Computer Science 18(4), 727-743 (2007)

[2]

Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Specify, compile, run: Hardware from PSL Electr Notes Theor Comput Sci 190(4), 3-16 (2007)

Digital Library

[3]

Bozga, M., Maler, O., Pnueli, A., Yovine, S.: Some progress in the symbolic verification of timed automata In: Grumberg, O (ed.) CAV 1997 LNCS, vol 1254, pp 179-190 Springer, Heidelberg (1997)

Digital Library

[4]

Bryant, R.E.: Graph-based algorithms for boolean function manipulation IEEE Trans Computers 35(8), 677-691 (1986)

Digital Library

[5]

Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond Inf Comput 98(2), 142-170 (1992)

Digital Library

[6]

Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An opensource tool for symbolic model checking In: Brinksma, E., Larsen, K.G (eds.) CAV 2002 LNCS, vol 2404, pp 359-364 Springer, Heidelberg (2002)

Digital Library

[7]

Clarke, E.M., Grumberg, O., Peled, D.: Model Checking MIT Press, Cambridge (1999)

Digital Library

[8]

Filiot, E., Jin, N., Raskin, J.F.: An antichain algorithm for LTL realizability In: Bouajjani, A., Maler, O (eds.) CAV 2009 LNCS, vol 5643, pp 263-277 Springer, Heidelberg (2009)

Digital Library

[9]

Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation In: Berry, G., Comon, H., Finkel, A (eds.) CAV 2001 LNCS, vol 2102, pp 53-65 Springer, Heidelberg (2001)

Digital Library

[10]

Henzinger, T.A., Piterman, N.: Solving games without determinization In: Ésik, Z (ed.) CSL 2006 LNCS, vol 4207, pp 395-410 Springer, Heidelberg (2006)

Digital Library

[11]

Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis In: FMCAD, pp 117-124 IEEE Computer Society, Los Alamitos (2006)

Digital Library

[12]

Kupferman, O., Lustig, Y., Vardi, M.: On locally checkable properties In: Hermann, M., Voronkov, A (eds.) LPAR 2006 LNCS (LNAI), vol 4246, pp 302-316 Springer, Heidelberg (2006)

Digital Library

[13]

Kupferman, O., Vardi, M.Y.: Model checking of safety properties In: Halbwachs, N., Peled, D (eds.) CAV 1999 LNCS, vol 1633, pp 172-183 Springer, Heidelberg (1999)

Digital Library

[14]

Kupferman, O., Vardi, M.Y.: Safraless decision procedures In: FOCS, pp 531-542 IEEE, Los Alamitos (2005)

Digital Library

[15]

McMillan, K.L.: Symbolic Model Checking Kluwer Academic Publishers, Dordrecht (1993)

Digital Library

[16]

Müller, S.M., Paul, W.J.: Computer architecture: complexity and correctness Springer, Heidelberg (2000)

Digital Library

[17]

Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module In: Ronchi, S D., Ausiello, G., Dezani-Ciancaglini, M (eds.) ICALP 1989 LNCS, vol 372, pp 652-671 Springer, Heidelberg (1989)

Digital Library

[18]

Schewe, S., Finkbeiner, B.: Bounded synthesis In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y (eds.) ATVA 2007 LNCS, vol 4762, pp 474-488 Springer, Heidelberg (2007)

Digital Library

[19]

Schneider, K., Logothetis, G.: Abstraction of systems with counters for symbolic model checking In: Mutz, M., Lange, N (eds.) Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, Braunschweig, Germany, pp 31-40 Shaker, Aachen (1999)

[20]

Sohail, S., Somenzi, F.: Safety first: A two-stage algorithm for LTL games In: FMCAD, pp 77-84 IEEE Computer Society Press, Los Alamitos (2009)

[21]

Somenzi, F.: CUDD: CU decision diagram package, release 2.4.2 (2009)

[22]

Wegener, I.: Branching Programs and Binary Decision Diagrams SIAM, Philadelphia (2000)

Cited By

Jacobs SPérez GAbraham RBruyère VCadilhac MColange MDelfosse Cvan Dijk TDuret-Lutz AFaymonville PFinkbeiner BKhalimov AKlein FLuttenberger MMeyer KMichaud TPommellet ARenkin FSchlehuber-Caissier PSakr MSickert SStaquet GTamines CTentrup LWalker A(2024)The Reactive Synthesis Competition (SYNTCOMP): 2018–2021International Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-024-00754-126:5(551-567)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s10009-024-00754-1
Cimatti AGeatti LGigante NMontanari ATonetta S(2021)Fairness, Assumptions, and Guarantees for Extended Bounded Response LTL+P SynthesisSoftware Engineering and Formal Methods10.1007/978-3-030-92124-8_20(351-371)Online publication date: 6-Dec-2021
https://dl.acm.org/doi/10.1007/978-3-030-92124-8_20
Almagor SKupferman O(2020)Good-Enough SynthesisComputer Aided Verification10.1007/978-3-030-53291-8_28(541-563)Online publication date: 21-Jul-2020
https://dl.acm.org/doi/10.1007/978-3-030-53291-8_28
Show More Cited By

Symbolic bounded synthesis
1. Software and its engineering
  1. Software organization and properties
    1. Software functional properties
      1. Formal methods

Recommendations

Symbolic bounded synthesis

Synthesizing finite-state systems from full linear-time temporal logic (LTL) is an ambitious way to tackle the challenge of constructing correct-by-construction systems. One particularly promising approach in this context is bounded synthesis, ...
Encodings of Bounded Synthesis
Proceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 10205

The reactive synthesis problem is to compute a system satisfying a given specification in temporal logic. Bounded synthesis is the approach to bound the maximum size of the system that we accept as a solution to the reactive synthesis problem. As a ...
Bounded synthesis
ATVA'07: Proceedings of the 5th international conference on Automated technology for verification and analysis

The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a solution to the bounded synthesis problem for linear-time temporal logic (LTL), based ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CAV'10: Proceedings of the 22nd international conference on Computer Aided Verification

July 2010

673 pages

ISBN:364214294X

Editors:
Tayssir Touili
LIAFA, CNRS and University Paris Diderot, Paris Cedex 13, France
,
Byron Cook
LIAFA, Microsoft Research, Roger Needham Building, J J Thomson Avenue, Cambridge, UK
,
Paul Jackson
School of Informatics, University of Edinburgh, Roger Needham Building, J J Thomson Avenue, Edinburgh, UK

Sponsors

EPSRC: Engineering and Physical Sciences Research Council
NEC
Jasper Design Automation: Jasper Design Automation
IBMR: IBM Research
Microsoft Research: Microsoft Research

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 July 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Jacobs SPérez GAbraham RBruyère VCadilhac MColange MDelfosse Cvan Dijk TDuret-Lutz AFaymonville PFinkbeiner BKhalimov AKlein FLuttenberger MMeyer KMichaud TPommellet ARenkin FSchlehuber-Caissier PSakr MSickert SStaquet GTamines CTentrup LWalker A(2024)The Reactive Synthesis Competition (SYNTCOMP): 2018–2021International Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-024-00754-126:5(551-567)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s10009-024-00754-1
Cimatti AGeatti LGigante NMontanari ATonetta S(2021)Fairness, Assumptions, and Guarantees for Extended Bounded Response LTL+P SynthesisSoftware Engineering and Formal Methods10.1007/978-3-030-92124-8_20(351-371)Online publication date: 6-Dec-2021
https://dl.acm.org/doi/10.1007/978-3-030-92124-8_20
Almagor SKupferman O(2020)Good-Enough SynthesisComputer Aided Verification10.1007/978-3-030-53291-8_28(541-563)Online publication date: 21-Jul-2020
https://dl.acm.org/doi/10.1007/978-3-030-53291-8_28
Bansal SNamjoshi KSa'ar Y(2019)Synthesis of coordination programs from linear temporal specificationsProceedings of the ACM on Programming Languages10.1145/33711224:POPL(1-27)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371122
Shimakawa MUeno AMochizuki STomita THagihara SYonezaki N(2019)Towards Efficient Implementation of Realizability Checking for Reactive System SpecificationsProceedings of the 2019 8th International Conference on Software and Computer Applications10.1145/3316615.3316634(347-352)Online publication date: 19-Feb-2019
https://dl.acm.org/doi/10.1145/3316615.3316634
Camacho AMuise CBaier JMcIlraith S(2018)LTL realizability via safety and reachability gamesProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304652.3304660(4683-4691)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304652.3304660
Hagihara SUeno ATomita TShimakawa MYonezaki N(2016)Simple synthesis of reactive systems with tolerance for unexpected environmental behaviorProceedings of the 4th FME Workshop on Formal Methods in Software Engineering10.1145/2897667.2897672(15-21)Online publication date: 14-May-2016
https://dl.acm.org/doi/10.1145/2897667.2897672
Chiang TJiang JMarculescu DLiu F(2015)Property-Directed Synthesis of Reactive Systems from Safety SpecificationsProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840930(794-801)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.5555/2840819.2840930
D'Ippolito NBraberman VSykes DUchitel SFilieri AMaggio M(2015)Robust degradation and enhancement of robot mission behaviour in unpredictable environmentsProceedings of the 1st International Workshop on Control Theory for Software Engineering10.1145/2804337.2804342(26-33)Online publication date: 31-Aug-2015
https://dl.acm.org/doi/10.1145/2804337.2804342
Bloem RKönighofer RSeidl M(2014)SAT-Based Synthesis Methods for Safety SpecsProceedings of the 15th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 831810.1007/978-3-642-54013-4_1(1-20)Online publication date: 19-Jan-2014
https://dl.acm.org/doi/10.1007/978-3-642-54013-4_1
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten