Filters








242 Hits in 6.7 sec

Size-Change Termination and Satisfiability for Linear-Time Temporal Logics [chapter]

Martin Lange
2011 Lecture Notes in Computer Science  
Linear-time temporal logics like LTL, PSL and the linear-time µ-calculus have relatively simple translations into alternating parity automata, and this automaton model is closed under all Boolean operations  ...  Thus, the typical decision problems for such linear-time temporal logics reduce relatively simply to the emptiness problem for alternating parity automata.  ...  It may be the surprising simplicity of the Miyano-Hayashi construction [15] translating alternating Büchi into nondeterministic Büchi automata in comparison to the problem of turning a nondeterministic  ... 
doi:10.1007/978-3-642-24364-6_3 fatcat:qktjgpig2rc4tl6mvcvkhs2pvm

Almost Linear Büchi Automata

Tomáš Babiak, Vojtěch Řehák, Jan Strejček
2009 Electronic Proceedings in Theoretical Computer Science  
While standard translations of LTL into BA use some intermediate formalisms, the presented translation of LIO into ALBA is direct.  ...  We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Buechi automata (BA) called Almost linear Buechi automata (ALBA).  ...  While standard translations of LTL formulae into BA use either generalized Büchi automata [5] or alternating 1-weak Büchi automata [9, 13] as an intermediate formalism, the presented translation of  ... 
doi:10.4204/eptcs.8.2 fatcat:zmhywtopizdlfj3cr5xg3inmha

Almost linear Büchi automata

TOMÁŠ BABIAK, VOJTĚCH ŘEHÁK, JAN STREJČEK
2012 Mathematical Structures in Computer Science  
We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Büchi automata (BA) called Almost linear Büchi automata (ALBA).  ...  While standard translations of LTL into BA use some intermediate formalisms, the presented translation of LIO into ALBA is direct.  ...  While standard translations of LTL formulae into BA use either generalized Büchi automata [5] or alternating 1-weak Büchi automata [9, 13] as an intermediate formalism, the presented translation of  ... 
doi:10.1017/s0960129511000399 fatcat:ta2qac3evzajngshn7m23chymi

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata

Julian Brunner, Benedikt Seidl, Salomon Sickert, Michael Wagner
2019 International Conference on Interactive Theorem Proving  
To the best of our knowledge this is the first verified translation of LTL to DRAs that is proven to be double-exponential in the worst case which asymptotically matches the known lower bound.  ...  We present a formalisation of the unified translation approach from linear temporal logic (LTL) to ω-automata from [19] .  ...  Further, the translation proposed by [22] , which translates LTL via very-weak alternating automata to NBAs, has been formalised by [25] in HOL4.  ... 
doi:10.4230/lipics.itp.2019.11 dblp:conf/itp/0001SS19 fatcat:zhsmqsspyfcd3f4uggptl3t7le

Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata

Daniel Sheridan
2005 Electronical Notes in Theoretical Computer Science  
Model checking of LTL formulae is traditionally carried out by a conversion to Büchi automata, and there is therefore a large body of research in this area including some recent studies on the use of alternating  ...  We also explore the differences in the way SNF, alternating, and Büchi automata are used from both a theoretical and an experimental perspective.  ...  Alternating automata are exponentially more succinct than Büchi automata. There are two presentations of LTL to automata conversion via alternating automata.  ... 
doi:10.1016/j.entcs.2004.12.024 fatcat:5y4fyu5xardezpvu4h2fitvs7q

A HOL Conversion for Translating Linear Time Temporal Logic to ω-Automata [chapter]

Klaus Schneider, Dirk W. Hoffmann
1999 Lecture Notes in Computer Science  
We present an embedding of linear time temporal logic LTL in HOL together with an elegant translation of LTL formulas into equivalent ω-automata.  ...  On the other hand, the conversion also enables HOL users to directly verify temporal properties by means of HOL's induction rules.  ...  The translation procedure we use neither needs to determinize the automata nor is it based on alternating ω-automata.  ... 
doi:10.1007/3-540-48256-3_17 fatcat:t56koncqhrhtfa62ntmi5micri

Truly On-the-Fly LTL Model Checking [chapter]

Moritz Hammer, Alexander Knapp, Stephan Merz
2005 Lecture Notes in Computer Science  
Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant  ...  We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check.  ...  LTL and linear weak alternating automata We define alternating ω-automata, especially LWAA, and present the translation from propositional linear-time temporal logic LTL to LWAA.  ... 
doi:10.1007/978-3-540-31980-1_13 fatcat:om5t6xlqrbhzfiih42f7ahusry

Truly On-The-Fly LTL Model Checking [article]

Moritz Hammer, Stephan Merz
2005 arXiv   pre-print
Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant  ...  We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check.  ...  Technically, the input to our algorithm is a transition system T and a linear weak alternating automaton (LWAA, alternatively known as a very weak alternating automaton) corresponding to ¬ϕ.  ... 
arXiv:cs/0511061v1 fatcat:ejyuyd4ajbc5xjlr5fb6eufu2u

A LTL Fragment for GR(1)-Synthesis

Andreas Morgenstern, Klaus Schneider
2011 Electronic Proceedings in Theoretical Computer Science  
To this end, manually written deterministic omega-automata having GR(1) conditions were used instead of the original LTL specifications.  ...  In this paper, we therefore present algorithms to automatically translate specifications of a remarkable large fragment of LTL to deterministic monitors having a GR(1) acceptance condition so that the  ...  Hence, our second observation leads to a very efficient translation procedure for the identified LTL formulas to deterministic Büchi and co-Büchi automata.  ... 
doi:10.4204/eptcs.50.3 fatcat:3rbl34fmgvbvrp5oy533p3rike

From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata [article]

Simon Jantsch and David Müller and Christel Baier and Joachim Klein
2019 arXiv   pre-print
Unlike existing tableau-based LTL-to-UBA translations, our algorithm deals with very weak alternating automata (VWAA) as an intermediate representation.  ...  We report on an implementation of the construction in our tool duggi and discuss experimental results that compare the automata sizes and computation times of duggi with the tableau-based LTL-to-UBA translation  ...  [18, 11] ), as represented by the SPOT family of tools [15] , and translations via very weak alternating automata (VWAA) [17] , where LTL3BA [3] is the leading tool currently.  ... 
arXiv:1907.02887v1 fatcat:ziqqezuqsnhhhf6rtp7ox2j7be

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  
In this paper, we present alternative means of handling invariances in reachability testing, either by formula progression or compilation into Büchi automata.  ...  We include results from benchmarks obtained from preparatory experiments with model checking using a family of LTL2Büchi translators and formula progression.  ...  SPIN -This is the translator used in the model checker SPIN [12] . ltl2ba -ltl2ba [9] is a very efficient translator, whose efficiency is based on using very weak alternating automata, which are in turn  ... 
doi:10.1016/j.entcs.2005.07.028 fatcat:ddzuwe6sbrbx7mp5x7zcruccbm

Conversion Algorithm of Linear-Time Temporal Logic to Buchi Automata

Laixiang Shan, Zheng Qin, Shengnan Li, Renwei Zhang, Xiao Yang
2014 Journal of Software  
The size of Büchi Automata(BA) is a key factor during converting Linear-Time Temporal Logic (LTL) formulae to BA in model checking.  ...  In this paper, we present an improved Tableau-based algorithm, which converts LTL formulae to Transition-based Büchi Automata(TBA) more efficiently.  ...  ACKNOWLEDGMENT The authors are grateful to the Professor Guiming Luo and PHD. Jian Luo for their valuable comments and suggestions to improve the presentation of this paper.  ... 
doi:10.4304/jsw.9.4.970-976 fatcat:3xkgpay6dzgbzjjfhqm5xsvxri

LTL satisfiability checking

Kristin Y. Rozier, Moshe Y. Vardi
2010 International Journal on Software Tools for Technology Transfer (STTT)  
We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking.  ...  Second, when it comes to LTL satisfiability checking, the symbolic approach is clearly superior to the explicit approach.  ...  LTL2BA 7 [21] first translates the input formula into a very weak alternating automaton (VWAA). It then uses various heuristics to minimize the VWAA, before translating it to GBA.  ... 
doi:10.1007/s10009-010-0140-3 fatcat:lpwqest2izdoneic4wmr2fvsoe

Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free (full version) [article]

Daniel Neider and Alexander Weinert and Martin Zimmermann
2021 arXiv   pre-print
To this end, we combine the logics Linear Dynamic Logic, Prompt-LTL, and robust LTL, each addressing one aspect, to new logics.  ...  However, many shortcomings of LTL have been identified in the literature, among them the limited expressiveness, the lack of quantitative features, and the inability to express robustness.  ...  Before we present the translation, we need to explain how to "split" guards, which is necessary to implement the semantics of the robust box operator (recall the discussion in Section 5).  ... 
arXiv:1808.09028v7 fatcat:qgcfpupyejdm3onl4rekb524xu

MightyL: A Compositional Translation from MITL to Timed Automata [chapter]

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
2017 Lecture Notes in Computer Science  
In this paper, we propose a new construction from MITL to timed automata via very-weak one-clock alternating timed automata.  ...  While we also use one-clock alternating timed automata (OCATA) [30] as an intermediate formalism, our construction exploits the 'very-weakness' of the structure of OCATAs obtained from MITL formulae to  ...  The third author would like to thank Andreas Engelbredt Dalsgaard, Alfons Laarman and Jeroen Meijer for their technical help with opaal and LTSmin.  ... 
doi:10.1007/978-3-319-63387-9_21 fatcat:db65n3huqzb4xoutcfif5blrme
« Previous Showing results 1 — 15 out of 242 results