A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Simple and Efficient Translation from LTL Formulas to Büchi Automata
2002
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
We present a collection of simple on-the-fly techniques to generate small Büchi automata from Linear Time Logic formulas. ...
We compare our tool BAOM ("Büchi Automata Once More") with others, on formulas commonly found in the literature, and on randomly generated testbenchs. Key words: Linear Time Logic. Büchi automata. ...
Introduction This paper describes several new techniques to implement an efficient translation from Linear Time Logic (LTL) specifications to Büchi automata. ...
doi:10.1016/s1571-0661(04)80409-2
fatcat:goak2jpy6rcwxff7l6gut22yni
EFFICIENT ALGORITHM TO TRANSFORM MINIMALIST SUBSET OF LTL FORMULA INTO FINITE STATE MODELS
2018
International Journal of Science and Engineering Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a subset of LTL formula which can be converted to Büchi automata whose the size is polynomial. ...
The translation of LTL formula into equivalent Büchi automata plays an important role in many algorithms for LTL model checking, which consist in obtaining a Büchi automaton that is equivalent to the software ...
That comes from the translation of LTL formula into Büchi automata. ...
doi:10.7753/ijsea0704.1004
fatcat:hqwaxanlsbg5lehful7h4gkn7m
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
These automata are subsequently transformed in a single efficient step into Büchi automata as used by model checkers. ...
With explicit-state model checkers, properties are typically defined in linear-time temporal logic (LTL), and are translated into Büchi automata in order to be checked. ...
Many tools, including Java PathFinder, developed at the NASA Ames Research Center [1] , and SPIN, from Bell Labs [2] , after translating LTL formulae into Büchi automata, perform the verification using ...
doi:10.1007/3-540-36135-9_20
fatcat:heyxkyv36ncozpqfgnjlo2g37e
MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
As recently shown, a special subclass of limit-deterministic Büchi automata (LDBA) can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms. ...
We present an extension of PRISM for LTL model checking of MDP using LDBA. ...
The key to efficient LTL model checking is the automata-theoretic approach [38] : first, a given LTL formula is translated into an automaton; second, a product of the system and the automaton is constructed ...
doi:10.1007/978-3-319-46520-3_9
fatcat:buvkajs4vvb7ze7gk4asxpcmeq
Relating Hierarchy of Temporal Properties to Model Checking
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
automata for formulas from lower classes of the hierarchy. ...
A very successful approach to verifying properties expressed as linear temporal logic (LTL) formulas makes use of automata over infinite words. ...
doi:10.1007/978-3-540-45138-9_26
fatcat:zllmtn2c7rekzgtde7xj5z4l2m
Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation
2015
Journal of Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present on-the-fly degeneralization algorithm used to transform generalized Büchi automata (GBA) into Büchi Automata (BA) different from the standard degeneralization algorithm. ...
We compare our method to previous work and show that it is more efficient for four sets of random formulae generated by LBTT. ...
Spot uses TGBA to express LTL formulae into automata. Gerth et al. [7] proposed a classic algorithm that translates an LTL formula into a generalized Büchi automaton (GBA). ...
doi:10.1155/2015/516104
fatcat:t22dfqirvragvclsb3mf7fzcve
Conversion Algorithm of Linear-Time Temporal Logic to Buchi Automata
2014
Journal of Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present an improved Tableau-based algorithm, which converts LTL formulae to Transition-based Büchi Automata(TBA) more efficiently. ...
The size of Büchi Automata(BA) is a key factor during converting Linear-Time Temporal Logic (LTL) formulae to BA in model checking. ...
Considering the speed of an LTL formula to Büchi automata translation, LTL3BA and SPOT are two leading tools. Both of these tools are widely used for translating LTL formulas to Büchi automata. ...
doi:10.4304/jsw.9.4.970-976
fatcat:3xkgpay6dzgbzjjfhqm5xsvxri
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We present a new procedure for the translation of propositional linear-time temporal logic (LTL) formulas to equivalent nondeterministic Büchi automata. ...
Our procedure is based on simulation relations for alternating Büchi automata. ...
Acknowledgments Thanks to Björn Teegen who implemented LTL → NBA's parser for the LTL formulas, the web interface, and the interface to the dot program. ...
doi:10.1007/3-540-45089-0_5
fatcat:peh4y2e5gfg3ppcofwzhl54pha
Büchi-Automata guided Partial Order Reduction for LTL
2020
Applications and Theory of Petri Nets
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We propose a new POR method for linear temporal logic (LTL), which generalizes and extends ideas from [8] . LTL MC uses most commonly Büchi automata to represent the property under investigation. ...
Compared to conventional LTL POR methods we exploit additional information available from the Büchi automaton. ...
Büchi automaton for LTL formula ϕ3 = F i1 = 2 ∧ n j=2 oj = 1 .
Fig. 9 . 9 Fig. 9. Büchi automata for LTL formula ϕ4 = false. ...
dblp:conf/apn/Liebke20
fatcat:76csgzkr5vh6zj3vr6pd56og7i
A LTL Fragment for GR(1)-Synthesis
2011
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1102.4119v1 fatcat:rml3imow4vhadctu25u5f5rsza
These LTL specifications are equivalent to omega-automata having a so-called GR(1) acceptance condition. ...
To this end, manually written deterministic omega-automata having GR(1) conditions were used instead of the original LTL specifications. ...
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
Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis
2010
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
closures, (2) the non-confluence property of omega-automata that result from certain translations of LTL formulas, and (3) symbolic implementations of determinization procedures for the Rabin-Scott and ...
The classic approaches to synthesize a reactive system from a linear temporal logic (LTL) specification first translate the given LTL formula to an equivalent omega-automaton and then compute a winning ...
Handling Co-Büchi and Büchi specifications For co-Büchi specifications, we use the translation from TL FG to nondeterministic co-Büchi automata, minimize this automaton using the minimization techniques ...
doi:10.4204/eptcs.25.11
fatcat:csnchpty4becvgxwmhd3c75zcq
Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress)
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
Finally the generalized Büchi automata are transformed in standard Büchi automata. ...
doi:10.1016/j.entcs.2005.07.028
fatcat:ddzuwe6sbrbx7mp5x7zcruccbm
Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata
2005
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
correspondence between SNF and alternating automata and their conversion procedures from LTL. ...
doi:10.1016/j.entcs.2004.12.024
fatcat:5y4fyu5xardezpvu4h2fitvs7q
Deeper Connections Between LTL and Alternating Automata
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A translation of LTL formulae into a language equivalent A1W automata has been introduced in [1]. The inverse translation has been developed independently in [2] and [3]. ...
It is known that Linear Temporal Logic (LTL) has the same expressive power as alternating 1-weak automata (A1W automata, also called alternating linear automata or very weak alternating automata). ...
The LTL→A1W translation has been recently used to build new and more efficient algorithms translating LTL formulae into nondeterministic Büchi automata [9, 10] . ...
doi:10.1007/11605157_20
fatcat:p2vdeufqc5buhiagqt5vewqfqm
Minimising Deterministic Büchi Automata Precisely Using SAT Solving
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show how deterministic Büchi automata can be fully minimised by reduction to the satisfiability (SAT) problem, yielding the first automated method for this task. ...
Size reduction of such ω-automata is an important step in probabilistic model checking as well as synthesis of finite-state systems. ...
While such a check is PSPACE-complete for non-deterministic Büchi automata, it can be performed in polynomial time for deterministic Büchi automata and can also be efficiently encoded into a SAT instance ...
doi:10.1007/978-3-642-14186-7_28
fatcat:sj422jss4rb3reqs56zctwp4fe
« Previous
Showing results 1 — 15 out of 1,580 results