Fast, Flexible, and Minimal CTL Synthesis via SMT

Klenze, Tobias; Bayless, Sam; Hu, Alan J.

doi:10.1007/978-3-319-41528-4_8

Cited by 9 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Global minimality of guard conditions is not guaranteed due to the two-stage implementation: minimal guards may correspond to another base model, not the one found on the first stage. The same argument applies against any approach based on state machine minimization [23]. In addition, LTL properties are not supported.…”

Section: Related Workmentioning

confidence: 98%

fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver

Chukharev¹,

Chivilikhin²

2019

Preprint

View full text Add to dashboard Cite

Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence, keeping them up-to-date requires extra effort. To simplify the maintenance process, an automatic approach may be used, allowing to infer models from behavior examples and temporal properties. As an example of a specific control systems development application we focus on inferring finite-state models of function blocks (FBs) defined by the IEC 61499 international standard for distributed automation systems.In this paper we propose a method for FB model inference from behavior examples, based on reduction to Boolean satisfiability problem (SAT). Additionally, we take into account linear temporal properties using counterexample-guided synthesis. In contrast to existing approaches, suggested method is more efficient and produce minimal finite-state models both in terms of number of states and guard conditions. We also present the developed tool fbSAT which implements the proposed method, and evaluate it in two case studies: inference of a finite-state model of a Pick-and-Place manipulator, and reconstruction of randomly generated automata.

show abstract

Section: Related Workmentioning

confidence: 98%

fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver

Chukharev¹,

Chivilikhin²

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…Our satisfiability algorithm for SL[SG] applies the technique used earlier for monotonic theories for checking both CTL satifiability (Bayless et al 2015;Klenze, Bayless, and Hu 2016) and ATL satisfiablity (Kacprzak, Niewiadomski, and Penczek 2020). Although SL[SG] is not a monotone theory, we show how the same technique can be applied in this case.…”

Section: Monotonic Theory For Sl[sg]mentioning

confidence: 99%

“…Our paper is not the first one adopting that approach. Here we build on the results for CTL (Klenze, Bayless, and Hu 2016) and ATL (Niewiadomski et al 2020). The main contributions for SL [SG] consist in: a new encoding method for SL[SG] models, new proofs of monotonicity of the relation |= for SL [SG] in some cases, new definitions of over-and under-approximations for SL[SG] partial models, new proofs of the correctness of the method for the formulae prefixed with strategy quantifiers and bindings, and a new implementation and the tool.…”

Section: Introductionmentioning

confidence: 99%

Satisfiability Checking of Strategy Logic with Simple Goals

Kacprzak

Niewiadomski²,

Penczek

2021

Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning

View full text Add to dashboard Cite

In this paper, we introduce a new method of the satisfiability (SAT) checking for Simple-Goal Strategy Logic (SL[SG]), using symbolic Boolean model encoding and the SAT Modulo Monotonic Theories techniques, which was implemented into the tool SGSAT. To the best of our knowledge, this is the only tool solving the SAT problem for SL[SG]. Its applications include process synthesis, developing controllers as well as automatic planners in multi-agent scenarios.

show abstract

“…In this paper we propose a solution to the first stage of the synthesis problem, which consists in finding a model for a given ATL formula. For this purpose, we adopt the method based on SAT Modulo Monotonic Theories (SMMT) [26] used to search for models of the CTL formulae. This technique was introduced by Bayless et al in [4] for building efficient lazy SMT solvers for Boolean monotonic theories.…”

Section: Related Workmentioning

confidence: 99%

“…This technique was introduced by Bayless et al in [4] for building efficient lazy SMT solvers for Boolean monotonic theories. Next, Klenze et al in [26] presented how the SMMT framework can be used to build an SMT solver for CTL model checking theory, and how to perform efficient and scalable CTL synthesis.…”

Section: Related Workmentioning

confidence: 99%

SAT-Based ATL Satisfiability Checking

Kacprzak¹,

Niewiadomski²,

Penczek³

2020

Preprint

View full text Add to dashboard Cite

Synthesis of models and strategies is a very important problem in software engineering. The main element here is checking the satisfiability of formulae expressing the specification of a system to be implemented. This paper puts forward a novel method for deciding the satisfiability of formulae of Alternating-time Temporal Logic (ATL). The method presented expands on one for CTL exploiting SAT Modulo Monotonic Theories solvers. Similarly to the CTL case, our approach appears to be very efficient. The experimental results show that we can quickly test the satisfiability of large ATL formulae that have been out of reach of the existing approaches.

show abstract

Fast, Flexible, and Minimal CTL Synthesis via SMT

Cited by 9 publications

References 18 publications

fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver

fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver

Satisfiability Checking of Strategy Logic with Simple Goals

SAT-Based ATL Satisfiability Checking

Contact Info

Product

Resources

About