Minimal B&amp;#x0FC;chi Automata for Certain Classes of LTL Formulas

Cichoń, Jacek; Czubak, Adam; Jasiński, Andrzej

doi:10.1109/depcos-relcomex.2009.31

Cited by 14 publications

(16 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We select five families formulae [22] to test TUAD, SPOT and LTL3BA. All temporal modal operators are included in these formulae.…”

Section: Resultsmentioning

confidence: 99%

From LTL Formulae to Büchi Automata: A Direct Translation Using On-the-Fly De-Generalization

Shan¹,

Qin²,

Xu³

et al. 2015

2015 Asia-Pacific Software Engineering Conference (APSEC)

View full text Add to dashboard Cite

In this paper, we present a conversion algorithm to translate a linear temporal logic (LTL) formula to a Büchi automaton (BA) directly. A label, acceptance degree (AD), is presented to record acceptance conditions satisfied in each state or transition of an automaton. The AD for an automaton is a set of {U, F, R, G}-subformula of the given LTL formula. According to ADs attached to states and transitions, the onthe-fly de-generalization algorithm is presented. This on-the-fly de-generalization algorithm is used to transform a generalized Büchi automaton (GBA) into a Büchi automaton. It is different from the execution of the classic de-generalization algorithm that the on-the-fly de-generalization algorithm is performed during the expansion of the given LTL formula. A direct conversion algorithm based on the on-the-fly de-generalization algorithm is conceived and implemented. We compare the conversion algorithm presented in this paper with previous works, and show that it is more efficient for a series of formulae in usual use and random formulae generated by LBTT 1.2.1 (an LTL-to-BA translator testbench).

show abstract

“…We select five families formulae [22] to test TUAD, SPOT and LTL3BA. All temporal modal operators are included in these formulae.…”

Section: Resultsmentioning

confidence: 99%

From LTL Formulae to Büchi Automata: A Direct Translation Using On-the-Fly De-Generalization

Shan¹,

Qin²,

Xu³

et al. 2015

2015 Asia-Pacific Software Engineering Conference (APSEC)

View full text Add to dashboard Cite

show abstract

“…It has been argued (Cichoń et al 2009;Tsay et al 2011) that rather than optimizing an algorithm to try to produce the best automata always, it would be useful to create a database of optimal automata for commonly used formulae. However different uses may call for different definition of optimal automaton.…”

Section: Resultsmentioning

confidence: 99%

LTL translation improvements in Spot 1.0

Duret-Lutz

2014

IJCCBS

View full text Add to dashboard Cite

show abstract

“…The worst case of the degeneralization occurred here, since the TGBA with 1 state and n acceptance conditions was degeneralized into a BA with n + 1 states. It is known that no BA with less than n + 1 states can accept the property n i=1 G F p i so this Büchi automaton is optimal~ [3]. The property a U G b, on the right hand side of the figure, is easier to express: the BA has the same size as the TGBA.…”

Section: Büchi Automatamentioning

confidence: 99%

“…The resulting net, for a configuration involving three sources of data, three simultaneous jobs and two threads (one leader, one follower) is composed of 189 places and 461 transitions. Its state space contains 61 662 states 3 . The authors propose to check that once a job is issued from a source, it must be processed by a thread (no starvation).…”

Section: Benchmark Inputsmentioning

confidence: 99%

See 1 more Smart Citation

Model Checking Using Generalized Testing Automata

Salem

Duret-Lutz

Kordon

2012

Transactions on Petri Nets and Other Models of Concurrency VI

View full text Add to dashboard Cite

Abstract. Geldenhuys and Hansen showed that a kind of ω-automata known as Testing Automata (TA) can, in the case of stuttering-insensitive properties, outperform the Büchi automata traditionally used in the automata-theoretic approach to model checking~ [10]. In previous work~[23], we compared TA against Transition-based Generalized Büchi Automata (TGBA), and concluded that TA were more interesting when counterexamples were expected, otherwise TGBA were more efficient. In this work we introduce a new kind of automata, dubbed Transition-based Generalized Testing Automata (TGTA), that combine ideas from TA and TGBA. Implementation and experimentation of TGTA show that they outperform other approaches in most of the cases.

show abstract

Minimal Büchi Automata for Certain Classes of LTL Formulas

Cited by 14 publications

References 12 publications

From LTL Formulae to Büchi Automata: A Direct Translation Using On-the-Fly De-Generalization

From LTL Formulae to Büchi Automata: A Direct Translation Using On-the-Fly De-Generalization

LTL translation improvements in Spot 1.0

Model Checking Using Generalized Testing Automata

Contact Info

Product

Resources

About