LTL translation improvements in Spot 1.0

Duret-Lutz, Alexandre

doi:10.1504/ijccbs.2014.059594

Cited by 28 publications

(4 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to compare the discriminative power of the weakness measure and implication, we perform an experiment where every pair of refinements from the refinement trees in [16] is compared via both methods. An implication check for the pair of formulae φ 1 and φ 2 is performed by computing the nondeterministic transition-based generalized Büchi automata (TGBA) [34] of the formulae φ 1 ∧ ¬φ 2 and φ 2 ∧ ¬φ 1 , and checking whether any of them is empty [41].…”

Section: Discussionmentioning

confidence: 99%

A Weakness Measure for GR(1) Formulae

2018

View full text Add to dashboard Cite

In spite of the theoretical and algorithmic developments for system synthesis in recent years, little effort has been dedicated to quantifying the quality of the specifications used for synthesis. When dealing with unrealizable specifications, finding the weakest environment assumptions that would ensure realizability is typically a desirable property; in such context the weakness of the assumptions is a major quality parameter. The question of whether one assumption is weaker than another is commonly interpreted using implication or, equivalently, language inclusion. However, this interpretation does not provide any further insight into the weakness of assumptions when implication does not hold. To our knowledge, the only measure that is capable of comparing two formulae in this case is entropy, but even it fails to provide a sufficiently refined notion of weakness in case of GR(1) formulae, a subset of linear temporal logic formulae which is of particular interest in controller synthesis. In this paper we propose a more refined measure of weakness based on the Hausdorff dimension, a concept that captures the notion of size of the omega-language satisfying a linear temporal logic formula. We identify the conditions under which this measure is guaranteed to distinguish between weaker and stronger GR(1) formulae. We evaluate our proposed weakness measure in the context of computing GR(1) assumptions refinements.

show abstract

Section: Discussionmentioning

confidence: 99%

A Weakness Measure for GR(1) Formulae

2018

View full text Add to dashboard Cite

show abstract

“…To this end we perform an experiment on the refinement trees generated by the heuristic search: each pair of formulae in the refinement trees is compared both via implication and via the weakness measure from Definition 6.31. An implication check for the pair of formulae φ 1 and φ 2 is performed by computing the nondeterministic transition-based generalized Büchi automata (TGBA) [Lut14] of the formulae φ 1 ∧ ¬ φ 2 and φ 2 ∧ ¬ φ 1 , and checking whether any of them is empty [RDLKP13]. In our implementation, the TGBAs are computed via the same SPOT tool used to compute weakness.…”

Section: Ordering Via Weakness and Implicationmentioning

confidence: 99%

A Weakness Measure for GR(1) Formulae

2021

View full text Add to dashboard Cite

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 $$\omega $$ ω -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.

show abstract

“…There exist several variants of degeneralization constructions, discussed for instance by Gastin and Oddoux [49], or Giannakopoulou and Lerda [53], and improved by Babiak et al [7]. The automata of Numerous translations from LTL to TGBAs exist, and are implemented in tools such as ltl2ba [49], ltl3ba [6], or Spot's ltl2tgba [37]. Now, combining Properties 1 and 2, we get Property 3.…”

Section: Definition 4 (Sgba)mentioning

confidence: 99%

“…The subclass of LTL guarantees is simple enough that typical LTL translation algorithms [49,6,37] produce terminal automata naturally. A construction of weak automata from LTL persistence properties is given byČerná and Pelánek [25], and is implemented for instance in ltl2tgba.…”

Section: Definition 13 (Terminal Automaton)mentioning

confidence: 99%