3,117 Hits in 2.4 sec

Optimizations for LTL Synthesis

Barbara Jobstmann, Roderick Bloem
2006 2006 Formal Methods in Computer Aided Design  
Although our examples are still small, this work constitutes the first implementation of a synthesis algorithm for full LTL.  ...  We believe that the optimizations discussed here form an important step towards making LTL synthesis practical.  ...  Acknowledgments: The authors would like to thank Orna Kupferman for stimulating discussions and patient explanations.  ... 
doi:10.1109/fmcad.2006.22 dblp:conf/fmcad/JobstmannB06 fatcat:v2hswya5wracvjc7t3o5hb6mlu

Finite LTL Synthesis with Environment Assumptions and Quality Measures [article]

Alberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith
2018 arXiv   pre-print
We study a natural variant of the finite LTL synthesis problem in which strategy guarantees are predicated on specified environment behavior.  ...  In this paper, we investigate the problem of synthesizing strategies for linear temporal logic (LTL) specifications that are interpreted over finite traces -- a problem that is central to the automated  ...  Algorithms: High-Quality LTL f Synthesis In this section, we present novel techniques to compute bgv-optimal and strongly bgv-optimal strategies for a constrained LTL f [F ] synthesis problem X, Y, α,  ... 
arXiv:1808.10831v1 fatcat:lnhrfr7tj5ephilbkf6vrikfge

Towards Neural-Guided Program Synthesis for Linear Temporal Logic Specifications [article]

Alberto Camacho, Sheila A. McIlraith
2019 arXiv   pre-print
Unfortunately, exact methods to solve so-called LTL synthesis via logical inference do not scale. In this work, we cast LTL synthesis as an optimization problem.  ...  Our method is unique in combining search with deep learning to realize LTL synthesis.  ...  The challenge for us in this work is to frame LTL synthesis as an optimization problem, for which dynamic programming techniques can be used.  ... 
arXiv:1912.13430v1 fatcat:pfvzwhbrozge5j5sigpmc3ubpm

Automated Verification and Strategy Synthesis for Probabilistic Systems [chapter]

Marta Kwiatkowska, David Parker
2013 Lecture Notes in Computer Science  
In this paper, we give an overview of methods for automated verification and strategy synthesis for probabilistic systems.  ...  Dually, we can also synthesise, from a model and a property specification, a strategy for controlling the system in order to satisfy or optimise the property, but this aspect has received less attention  ...  Strategy Synthesis for Probabilistic LTL To synthesise an optimal strategy of MDP M for an LTL formula ψ, we reduce the problem to the simpler case of a reachability property on the product of M and an  ... 
doi:10.1007/978-3-319-02444-8_2 fatcat:r7z2eaajvzdw5fvexvg2vcrjg4

Exact Synthesis of Reversible Logic Circuits using Model Checking [article]

Rajarshi Ray, Arup Deka, Kamalika Datta
2017 arXiv   pre-print
We frame the synthesis problem as a model checking instance and propose an iterative bounded model checking calls for an optimal synthesis.  ...  Although scalable synthe- sis is very much essential for circuit design, exact synthesis is also of great importance as it helps in building design library for the synthesis of larger functions.  ...  Optimal Synthesis It may be noted that the reversible logic synthesis method using above mentioned LTL/CTL specification gives a solution which may not be optimal.  ... 
arXiv:1702.07470v1 fatcat:dhhjuzy2wrcrnlpdmlze2r3gxi

Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time

Leander Tentrup, Alexander Weinert, Martin Zimmermann
2016 Electronic Proceedings in Theoretical Computer Science  
We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded  ...  Also, we report on a proof-of-concept implementation of the algorithm based on bounded LTL synthesis, which computes the smallest implementation of a given specification.  ...  of LTL synthesis.  ... 
doi:10.4204/eptcs.226.21 fatcat:hscaz5qe55fffnwc77ojob76oy

Maximum Realizability for Linear Temporal Logic Specifications [article]

Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu
2018 arXiv   pre-print
We propose an algorithm for synthesizing implementations that are optimal with respect to this quantitative semantics.  ...  Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks.  ...  [19] describes a method for computing optimal plans for co-safe LTL specifications, where optimality is again with respect to the cost of violating each atomic proposition, which is provided by the  ... 
arXiv:1804.00415v1 fatcat:ofmete4uord3rnf5krtccp6b7y

SynKit: LTL Synthesis as a Service

Alberto Camacho, Christian Muise, Jorge A. Baier, Sheila A. McIlraith
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
LTL synthesis technology is central to a myriad of applications from the automated generation of controllers for Internet of Things devices, to the synthesis of control software for robotic applications  ...  Unfortunately, the number of existing tools for LTL synthesis is limited, and using them requires specialized expertise.  ...  Figure 1 : 1 Capture of the SynKit tool for LTL synthesis.  ... 
doi:10.24963/ijcai.2018/848 dblp:conf/ijcai/CamachoMBM18a fatcat:4vxwdcpb7fbibnzzdz6nnuehny

Safraless LTL synthesis considering maximal realizability

Takashi Tomita, Atsushi Ueno, Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki
2016 Acta Informatica  
Linear temporal logic (LTL) synthesis is a formal method for automatically composing a reactive system that realizes a given behavioral specification described in LTL if the specification is realizable  ...  In this paper, we propose a method for synthesizing a reactive system that realizes all must specifications and strongly endeavors to satisfy each desirable specification.  ...  From the optimal strategy and M ϕ,k,t , the optimal reactive system is composed as a transition system with the same format to Acacia+ 10 [8-10] that is a well-known LTL synthesis tool.  ... 
doi:10.1007/s00236-016-0280-3 fatcat:j2mvprlzdngxzj5kvuc5rj4aqu

Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress)

Sylvain Kerjean, Froduald Kabanza, Richard St-Denis, Sylvie Thiébaux
2006 Electronical Notes in Theoretical Computer Science  
These alternatives are presented in connection with three different applications of model checking: verification, plan synthesis as well as heuristic guidance of AI planning, and controller synthesis.  ...  Introduction Model checking with Linear Temporal Logic (LTL) has demonstrated interesting potentials for program verification, plan synthesis, and controller synthesis problems.  ...  for boundedquantified LTL formulas as used in TLPLAN.  ... 
doi:10.1016/j.entcs.2005.07.028 fatcat:ddzuwe6sbrbx7mp5x7zcruccbm

Rabinizer 4: From LTL to Your Favourite Deterministic Automaton [chapter]

Jan Křetínský, Tobias Meggendorfer, Salomon Sickert, Christopher Ziegler
2018 Lecture Notes in Computer Science  
The tool set implements and optimizes several recent constructions, including the first implementation translating the frequency extension of LTL.  ...  We present Rabinizer 4, a tool set for translating formulae of linear temporal logic to different types of deterministic ω-automata.  ...  Verification and synthesis The resulting automata can be used for model checking probabilistic systems and for LTL synthesis.  ... 
doi:10.1007/978-3-319-96145-3_30 fatcat:kowgdythzrc7teuvv5csf7xbeq

Hyperproperties for Robotics: Planning via HyperLTL [article]

Yu Wang, Siddhartha Nalluri, Miroslav Pajic
2020 arXiv   pre-print
There is a growing interest on formal methods-based robotic planning for temporal logic objectives. In this work, we extend the scope of existing synthesis methods to hyper-temporal logics.  ...  We show that such hyperproperties can be expressed by HyperLTL, an extension of LTL to multiple paths.  ...  Optimality of Synthesized Plans: A well-known shortcoming of LTL-based planning is the lack of support for optimality.  ... 
arXiv:1911.11870v3 fatcat:xrtge4oajreghnvsngu6dtaide

Numerical LTL Synthesis for Cyber-Physical Systems [article]

Chih-Hong Cheng, Edward A. Lee
2013 arXiv   pre-print
Our core methodology, called numerical LTL synthesis, extends LTL synthesis by using inputs or outputs in real numbers and by allowing predicates of polynomial constraints to be defined within an LTL formula  ...  In this report, we present a novel approach that addresses the above challenge to synthesize controllers for CPS.  ...  However, for the un-optimized method the cost of reducing checks for the theory solver is transferred to the check of realizability for pseudo-Boolean LTL specifications, as every refinement requires to  ... 
arXiv:1307.3722v1 fatcat:4xmi5mxsznhgpfbj2wxr3t4rve

Specification Decomposition for Reactive Synthesis [article]

Bernd Finkbeiner, Gideon Geier, Noemi Passing
2021 arXiv   pre-print
For them, independent synthesis tasks are performed, significantly reducing the complexity of the individual tasks.  ...  Our decomposition algorithm guarantees that the subspecifications are independent in the sense that completely separate synthesis tasks can be performed for them.  ...  This allows for applying the optimization to even more of the common LTL synthesis benchmarks.  ... 
arXiv:2103.08459v3 fatcat:vw2czg2bc5gfdh22meekxno4g4

Online Task Planning and Control for Aerial Robots with Fuel Constraints in Winds [chapter]

Chanyeol Yoo, Robert Fitch, Salah Sukkarieh
2015 Springer Tracts in Advanced Robotics  
This paper presents an algorithm for automatically synthesising a continuous nonlinear flight controller given a complex temporal logic task specification that can include contingency planning rules.  ...  Our algorithm is efficient and we show empirically that it is feasible for online execution and replanning.  ...  More sophisticated models of UAV dynamics, such as point-mass models, could also be introduced for future work, as well as guaranteed landing procedures.  ... 
doi:10.1007/978-3-319-16595-0_41 fatcat:u7ilbu4lz5fwlgxy4g63oa3rhm
« Previous Showing results 1 — 15 out of 3,117 results