Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMPCODE2011) 2011
DOI: 10.1109/memcod.2011.5970509
|View full text |Cite
|
Sign up to set email alerts
|

Mining assumptions for synthesis

Abstract: Abstract-Automatic synthesis of a reactive system from its formal specification is appealing but often difficult due to the tedium of writing auxiliary specifications, especially on the environment. In several instances, specifications are found unrealizable as a result of insufficient environmental assumptions. We present an approach to this problem for synthesis from LTL based on specification mining. For a satisfiable but unrealizable specification, a counter-strategy can be computed from the synthesis game… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
123
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 88 publications
(123 citation statements)
references
References 28 publications
0
123
0
Order By: Relevance
“…Acacia+ [9] also solves LTL realizability problems encoded as safety games. Another approach to realizability checking [35] builds upon RATSY using a template-based specification mining approach to identify situations of an underconstrained environment or an over-constrained system. This approach is complimented by work on detecting unrealizability due to overly-strong system guarantees or overly restricted signals [29].…”
Section: Specification Qualitymentioning
confidence: 99%
“…Acacia+ [9] also solves LTL realizability problems encoded as safety games. Another approach to realizability checking [35] builds upon RATSY using a template-based specification mining approach to identify situations of an underconstrained environment or an over-constrained system. This approach is complimented by work on detecting unrealizability due to overly-strong system guarantees or overly restricted signals [29].…”
Section: Specification Qualitymentioning
confidence: 99%
“…It computes a set P of candidate LTL formulas which can be used to refine guarantees of φ 1 . Then at each iteration, a formula ψ ∈ P is chosen, and it is checked if the counter-strategy for φ 2 satisfies ¬ψ (similar to assumption mining in [5]). If it does and ψ is consistent with φ 2 , it is checked if ψ is an assumption refinement for φ 2 , in which case ψ can be used to refine the guarantees (assumptions) of φ 1 (φ 2 , respectively), and ψ is returned as a suggested refinement.…”
Section: Compositional Refinementmentioning
confidence: 99%
“…The problem of refining the environment assumptions is also considered in [5,6]. Synthesizing distributed systems from global specification is a hard problem [7].…”
Section: Introductionmentioning
confidence: 99%
“…Li et al [11] focus on mining environment assumptions for GR(1) specifications. We base our work on this paper, and use a similar approach for human-in-the-loop control systems.…”
Section: Related Workmentioning
confidence: 99%