Abstract
Abstract
When dealing with unrealizable specifications in reactive synthesis, finding the weakest environment assumptions that ensure realizability is often considered a desirable property. However, little effort has been dedicated to defining or evaluating the notion of weakness of assumptions formally. The question of whether one assumption is weaker than another is commonly interpreted by considering the implication relationship between the two or, equivalently, their language inclusion. This interpretation fails to provide any insight into the weakness of the assumptions when implication (or language inclusion) does not hold. To our knowledge, the only measure that is capable of comparing two formulae in this case is entropy, but even it cannot distinguish the weakness of assumptions expressed as fairness properties. In this paper, we propose a refined measure of weakness based on combining entropy with Hausdorff dimension, a concept that captures the notion of size of the -language satisfying a linear temporal logic formula. We focus on a special subset of linear temporal logic formulae which is of particular interest in reactive synthesis, called GR(1). We identify the conditions under which this measure is guaranteed to distinguish between weaker and stronger GR(1) formulae, and propose a refined measure to cover cases when two formulae are strictly ordered by implication but have the same entropy and Hausdorff dimension. We prove the consistency between our weakness measure and logical implication, that is, if one formula implies another, the latter is weaker than the former according to our measure. We evaluate our proposed weakness measure in two contexts. The first is in computing GR(1) assumption refinements where our weakness measure is used as a heuristic to drive the refinement search towards weaker solutions. The second is in the context of quantitative model checking where it is used to measure the size of the language of a model violating a linear temporal logic formula.
- [AAK13] Automatic generation of quality specificationsInternational conference on computer aided verification (CAV)2013BerlinSpringer47949410.1007/978-3-642-39799-8_32Google Scholar
- [ABD14a] Asarin E, Blockelet M, Degorre A (2014) Entropy model checking. In: Workshop on Quantitative Aspects of Programming Languages (QAPL)—joint with european joint conference on theory and practice of software (ETAPS)Google Scholar
- [ABD+14b] Asarin E, Blockelet M, Degorre A, Dima C, Mu C (2014) Asymptotic behaviour in temporal logic. In: Joint meeting of the annual conference on computer science logic and the annual symposium on logic in computer science (CSL/LICS). ACM Press, pp 1–9Google Scholar
- [ADG16] Maximal specification synthesisACM SIGPLAN Notices201651178980110.1145/2914770.2837628Google ScholarDigital Library
- [AMT13] Counter-strategy guided refinement of GR(1) temporal logic specificationsInternational conference on formal methods in computer-aided design (FMCAD)2013BerlinSpringer2633Google Scholar
- [AMT15] Pattern-based refinement of assume-guarantee specifications in reactive synthesisInternational conference on tools and algorithms for the construction and analysis of systems (TACAS)2015BerlinSpringer5015161420.68116Google Scholar
- [BCG+10] RATSY: a new requirements analysis tool with synthesisInternational conference on computer aided verification (CAV)2010BerlinSpringer42542910.1007/978-3-642-14295-6_37Google ScholarDigital Library
- [BCG+14] Synthesizing robust systems. Acta Inf2014513–4193220Google ScholarDigital Library
- [BCHJ09] Better quality in synthesis through quantitative objectivesInternational conference on computer aided verification (CAV)2009BerlinSpringer14015610.1007/978-3-642-02658-4_14Google ScholarDigital Library
- [BDP+13] Braberman V, D'Ippolito N, Piterman N, Sykes D, Uchitel S (2013) Controller synthesis: from modelling to enactment. In: International Conference on Software Engineering (ICSE), pp 1347–1350. IEEEGoogle Scholar
- [BJP+12] Synthesis of reactive(1) designsJ Comput Syst Sci2012783911938290004010.1016/j.jcss.2011.08.007Google ScholarDigital Library
- [BKvS12] LTL to Büchi automata translation: fast and more deterministicInternational conference and tools and algorithms for the construction and analysis of systems (TACAS)2012BerlinSpringer951091352.68142Google Scholar
- [BP94] Nonnegative matrices in the mathematical sciences1994PhiladelphiaSociety for Industrial and Applied Mathematics10.1137/1.9781611971262Google ScholarCross Ref
- [CA16] Cavezza DG, Alrajeh D (2016) Interpolation-based GR(1) assumptions refinement. CoRR, arXiv:1611.07803Google Scholar
- [CA17] Interpolation-based GR(1) assumptions refinementInternational conference on tools and algorithms for the construction and analysis of systems (TACAS)2017BerlinSpringer281297Google Scholar
- [CAG18] Cavezza DG, Alrajeh D, György A (2018) A weakness measure for GR(1) formulae. In: International symposium on formal methods (FM), pp 110–128Google Scholar
- [CDF+06] Compositional quantitative reasoningInternational conference on the quantitative evaluation of systems (QEST)2006BerlinSpringer179188Google Scholar
- [CGP03] Learning assumptions for compositional verificationInternational conference on tools and algorithms for the construction and analysis of systems (TACAS)2003BerlinSpringer3313461031.68545Google Scholar
- [CHJ08] Environment assumptions for synthesisInternational conference on concurrency theory (CONCUR)2008BerlinSpringer147161Google Scholar
- [CJS09] Topology on wordsTheor Comput Sci200941024–2523232335252243710.1016/j.tcs.2009.02.029Google ScholarDigital Library
- [CL08] Introduction to discrete event systems2008BerlinSpringer10.1007/978-0-387-68612-7Google ScholarCross Ref
- [CRST08] Diagnostic information for realizabilityInternational conference on verification, model checking, and abstract interpretation (VMCAI)2008BerlinSpringer526710.1007/978-3-540-78163-9_9Google Scholar
- [CT06] Elements of information theory20062New YorkWiley1140.94001Google ScholarDigital Library
- [DAC99] Dwyer MB, Avrunin GS, Corbett JC (1999) Patterns in property specifications for finite-state verification. In: International conference on software engineering (ICSE). ACM, pp 411–420Google Scholar
- [DAV] https://gitlab.doc.ic.ac.uk/dgc14/FMextRepoGoogle Scholar
- [DBK+14] D'Ippolito N, Braberman V, Kramer J, Magee J, Sykes D, Uchitel S (2014) Hope for the best, prepare for the worst: multi-tier control for adaptive systems. In: International conference on software engineering (ICSE), pp 688–699Google Scholar
- [DBPU10] D'Ippolito NR, Braberman V, Piterman N, Uchitel S (2010) Synthesis of live behaviour models. In: International symposium on foundations of software engineering (FSE). ACM Press, p 77Google Scholar
- [DBSU15] D'Ippolito N, Braberman V, Sykes D, Uchitel S (2015) Robust degradation and enhancement of robot mission behaviour in unpredictable environments. In: International workshop on control theory for software engineering (CTSE). ACM, pp 26–33Google Scholar
- [DCA+18] Goal-conflict likelihood assessment based on model countingInternational conference on software engineering (ICSE)2018New YorkACM Press1125113510.1145/3180155.3180261Google ScholarDigital Library
- [DGT18] Dimitrova R, Ghasemi M, Topcu U (2018) Maximum realizability for linear temporal logic specifications. In: International symposium on automated technology for verification and analysis (ATVA). Springer, Berlin, pp 458–475Google Scholar
- [DLLF+16] Duret-Lutz A, Lewkowicz A, Fauchille A, Michaud T, Renault E, Xu L (2016) Spot 2.0—a framework for LTL and -automata manipulation. In: International symposium on automated technology for verification and analysis (ATVA). Springer, Berlin, pp 122–129Google Scholar
- [EKS16] From LTL to deterministic automata: a safraless compositional approachFormal Methods Syst Des201649321927110.1007/s10703-016-0259-2Google ScholarDigital Library
- [Fal04] Fractal geometry: mathematical foundations and applications2004LondonWiley0689.28003Google Scholar
- [GL02] Giannakopoulou D, Lerda F (2002) From states to transitions: improving translation of LTL formulae to Büchi automata. In: International conference on formal techniques for networked and distributed sytems (FORTE), pp 308–326Google Scholar
- [GM03] Giannakopoulou D, Magee J (2003) Fluent model checking for event-based systems. In: European software engineering conference held jointly with international symposium on foundations of software engineering (ESEC/FSE). ACM, pp 257–266Google Scholar
- [GTW02] Automata logics, and infinite games: a guide to current research2002New YorkSpringer10.1007/3-540-36387-4Google ScholarCross Ref
- [Hen10] From boolean to quantitative notions of correctnessACM SIGPLAN Notices201045115710.1145/1707801.1706319Google ScholarDigital Library
- [HJ86] Matrix analysis1986New YorkCambridge University PressGoogle ScholarDigital Library
- [HJ94] A logic for reasoning about time and reliabilityFormal Asp Comput19946551253510.1007/BF01211866Google ScholarDigital Library
- [HJ12] Horn RA, Johnson CR (2012) Matrix analysisGoogle Scholar
- [HO13] From model checking to model measuringInternational conference on concurrency theory (CONCUR)2013BerlinSpringer273287Google Scholar
- [KE12] Deterministic automata for the (F, G)-fragment of LTLInternational conference on computer aided verification (CAV)2012BerlinSpringer72210.1007/978-3-642-31424-7_7Google ScholarDigital Library
- [KGFP09] Temporal-logic-based reactive mission and motion planningIEEE Trans Robot20092561370138110.1109/TRO.2009.2030225Google ScholarDigital Library
- [KHB09] Konighofer R, Hofferek G, Bloem R (2009) Debugging formal specifications using simple counterstrategies. In: International conference on formal methods in computer-aided design (FMCAD), pp 152–159Google Scholar
- [KMR17] A symbolic justice violations transition system for unrealizable GR(1) specificationsEuropean software engineering conference held jointly with international symposium on foundations of software engineering (ESEC/FSE), number 12017New YorkACM Press362372Google Scholar
- [Kup12] Recent challenges and ideas in temporal synthesisInternational conference on current trends in theory and practice of computer science (SOFSEM)2012BerlinSpringer8898Google Scholar
- [Kwi07] Kwiatkowska M (2007) Quantitative verification: models, techniques and tools. In: European software engineering conference held jointly with international symposium on foundations of software engineering (ESEC/FSE). ACM Press, p 449Google Scholar
- [LDS11] Li W, Dworkin L, Seshia SA (2011) Mining assumptions for synthesis. In: International conference on formal methods and models for codesign (MEMOCODE). ACM/IEEE, pp 43–50Google Scholar
- [LSWW10] Lomuscio A, Strulo B, Walker N, Wu P (2010) Assume-guarantee reasoning with local specifications. In: International conference on formal engineering methods (ICFEM), pp 204–219Google Scholar
- [Lut14] Lutz AD (2014) LTL translation improvements in spot 1.0. Int J Crit Comput Based Syst 5(1/2):31Google Scholar
- [MR15] GR(1) synthesis for LTL specification patternsEuropean software engineering conference held jointly with international symposium on foundations of software engineering (ESEC/FSE), number 12015New YorkACM Press96106Google Scholar
- [MRS19] Maoz S, Ringert JO, Shalom R (2019) Symbolic repairs for GR(1) specifications. In: Proceedings of the international conference on software engineering (ICSE)Google Scholar
- [MS94] Fractals, dimension, and formal languagesInf Théor Appl1994283–4361386128245310.1051/ita/1994283-403611Google ScholarCross Ref
- [NA06] Nam W, Alur R (2006) Learning-based symbolic assume-guarantee reasoning with automatic decomposition. In: International symposium on automated technology for verification and analysis (ATVA), pp 170–185Google Scholar
- [Pnu77] Pnueli A (1977) The temporal logic of programs. In: Annual symposium on foundations of computer science, pp 46–57Google Scholar
- [PPS06] Synthesis of reactive(1) designsInternational conference on verification, model checking, and abstract interpretation (VMCAI)2006BerlinSpringer364380Google Scholar
- [PR89] On the synthesis of a reactive modulePrinciples of programming languages (POPL)1989New YorkACM179190Google Scholar
- [RDLKP13] Three SCC-based emptiness checks for generalized Büchi automataInternational conference on logic for programming artificial intelligence and reasoning (LPAR)2013BerlinSpringer66868210.1007/978-3-642-45221-5_44Google Scholar
- [SB00] Somenzi F, Bloem R (2000) Efficient Buchi automata from LTL formulae. In: International conference on computer aided verification (CAV), vol 1855, pp 1–17Google Scholar
- [Sen06] Non-negative matrices and Markov chains2006BerlinSpringer1099.60004Google Scholar
- [Ses15] Combining induction, deduction, and structure for verification and synthesisProc IEEE2015103112036205110.1109/JPROC.2015.2471838Google ScholarCross Ref
- [Sta98] Staiger L (1998) The Hausdorff measure of regular -languages is computable. Technical Report August, Martin-Luther-UniversitätGoogle Scholar
- [Sta15] On the Hausdorff measure of regular omega-languages in Cantor spaceDiscrete Math Theor Comput Sci201517135736833514771323.68345Google Scholar
- [Tar72] Depth-first search and linear graph algorithmsSIAM J Comput19721214616030417810.1137/0201010Google ScholarDigital Library
- [TN16] Tabuada P, Neider D (2016) Robust linear temporal logic. In: Annual conference on computer science logic (CSL), pp 10:1–10:21. Schloss Dagstuhl–Leibniz-Zentrum fuer InformatikGoogle Scholar
- [TUS+17] Safraless LTL synthesis considering maximal realizabilityActa Inf2017547655692371231310.1007/s00236-016-0280-3Google ScholarDigital Library
- [Var96] Vardi MY (1996) An automata-theoretic approach to linear temporal logic. Logics for concurrency, pp 238–266Google Scholar
Recommendations
On well-separation of GR(1) specifications
FSE 2016: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software EngineeringSpecifications for reactive synthesis, an automated procedure to obtain a correct-by-construction reactive system, consist of assumptions and guarantees. One way a controller may satisfy the specification is by preventing the environment from ...
GR(1)*: GR(1) specifications extended with existential guarantees
AbstractReactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from its temporal logic specification. GR(1) is an expressive assume-guarantee fragment of LTL that enables efficient synthesis and has been recently ...
Normalized distance, similarity measure, inclusion measure and entropy of interval-valued fuzzy sets and their relationship
In this paper, we introduce an axiomatic definition of an interval-valued fuzzy sets' inclusion measure which is different from Bustince's [H. Bustince, Indicator of inclusion grade for interval-valued fuzzy sets, Applications to approximate reasoning ...
Comments