Aalta: an LTL satisfiability checker over Infinite/Finite traces

Li, Jianwen; Yao, Yinbo; Pu, Geguang; Zhang, Lijun; He, Jifeng

doi:10.1145/2635868.2661669

Cited by 15 publications

(11 citation statements)

References 9 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Aalta [1] implements the obligation-based LTL satisfiability checking algorithm for finite and infinite traces devised by Li et al [37]. We have performed experiments with both versions 1.2 and 2.0 of Aalta.…”

Section: Empirical Evaluation Of the Translationsmentioning

confidence: 99%

Theorem Proving for Pointwise Metric Temporal Logic Over the Naturals via Translations

2020

View full text Add to dashboard Cite

We study translations from metric temporal logic (MTL) over the natural numbers to linear temporal logic (LTL). In particular, we present two approaches for translating from MTL to LTL which preserve the complexity of the satisfiability problem for MTL. In each of these approaches we consider the case where the mapping between states and time points is given by (i) a strict monotonic function and by (ii) a non-strict monotonic function (which allows multiple states to be mapped to the same time point). We use this logic to model examples from robotics, traffic management, and scheduling, discussing the effects of different modelling choices. Our translations allow us to utilise LTL solvers to solve satisfiability and we empirically compare the translations, showing in which cases one performs better than the other. We also define a branching-time version of the logic and provide translations into computation tree logic.

show abstract

“…Hence, LTL2SAT can be conceptually classified as a BMC solver that, for several LTL f and LTL p fragments, implements early termination 6. For a comparison of Aalta and NuSMV on standard LTL satisfiability, the reader is referred to the work of Li, Yao, Pu, Zhang, and He (2014b). conditions based on the linear-length model property (see Section 4).…”

Section: Conceptual Architecture Of Ltl2satmentioning

confidence: 99%

LTL on Finite and Process Traces: Complexity Results and a Practical Reasoner

Fionda¹,

Greco²

2018

jair

View full text Add to dashboard Cite

Linear temporal logic (LTL) is a modal logic where formulas are built over temporal operators relating events happening in different time instants. According to the standard semantics, LTL formulas are interpreted on traces spanning over an infinite timeline. However, applications related to the specification and verification of business processes have recently pointed out the need for defining and reasoning about a variant of LTL, which we name LTLp, whose semantics is defined over process traces, that is, over finite traces such that, at each time instant, precisely one propositional variable (standing for the execution of some given activity) evaluates true. The paper investigates the theoretical underpinnings of LTLp and of a related logic formalism, named LTLf, which had already attracted attention in the literature and where formulas have the same syntax as in LTLp and are evaluated over finite traces, but without any constraint on the number of variables simultaneously evaluating true. The two formalisms are comparatively analyzed, by pointing out similarities and differences. In addition, a thorough complexity analysis has been conducted for reasoning problems about LTLp and LTLf, by considering arbitrary formulas as well as classes of formulas defined in terms of restrictions on the temporal operators that are allowed. Finally, based on the theoretical findings of the paper, a practical reasoner specifically tailored for LTLp and LTLf has been developed by leveraging state-of-the-art SAT solvers. The behavior of the reasoner has been experimentally compared with other systems available in the literature.

show abstract

“…They include tableaux pltl [19], resolution TRP++ [7], resolution LS4 [20], symbolic model verification NuSMV [2], and automata Aalta [11]. Surprisingly (or is it unsurprisingly?…”

Section: A New One-pass Embarrassingly Parallel Ltl Tableaumentioning

confidence: 99%

“…There are quite a range of rival reasoning techniques and tools which can be brought to bear on the LTL satisfiability problem. They include tableaux pltl [19], resolution TRP++ [7], resolution LS4 [20], symbolic model verification NuSMV [2], and automata Aalta [11]. Surprisingly (or is it unsurprisingly?…”

Section: A New One-pass Embarrassingly Parallel Ltl Tableaumentioning

confidence: 99%

A Parallel Linear Temporal Logic Tableau

McCabe-Dansted¹,

Reynolds

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

For many applications, we are unable to take full advantage of the potential massive parallelisation offered by supercomputers or cloud computing because it is too hard to work out how to divide up the computation task between processors in such a way to minimise the need for communication. However, a recently developed branch-independent tableaux for the common LTL temporal logic should intuitively be easy to parallelise as each branch can be developed independently. Here we describe a simple technique for partitioning such a tableau such that each partition can be processed independently without need for interprocess communication. We investigate the extent to which this technique improves the performance of the LTL tableau on standard benchmarks and random formulas.

show abstract

“…A fast implementation of the new tableau written by Matteo Battelo of Udine University is available from https://github.com/Corralx/leviathan and described in [3]. Experiments run using this implementation, on the full set of 3723 standard benchmark formulas [23], show comparative speed performance with five state of the art tools (Aalta [18], TRP++ [16], LS4 [27], NuSMV [7], and PLTL) based on automata, resolution, resolution(again), symbolic model checking, the Schwendimann tableau technique respectively. Interestingly the memory usage for the new tableau is significantly less.…”

Section: Implementationsmentioning

confidence: 99%

A New Rule for LTL Tableaux

Reynolds

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated.In this paper, we introduce a novel style of tableau rule which supports a new simple traditionalstyle tree-shaped tableau for LTL. We prove that it is sound and complete. As well as being simple to understand, to introduce to students and to use, it is also simple to implement and is competitive against state of the art systems. It is particularly suitable for parallel implementations.

show abstract

Aalta: an LTL satisfiability checker over Infinite/Finite traces

Cited by 15 publications

References 9 publications

Theorem Proving for Pointwise Metric Temporal Logic Over the Naturals via Translations

LTL on Finite and Process Traces: Complexity Results and a Practical Reasoner

A Parallel Linear Temporal Logic Tableau

A New Rule for LTL Tableaux

Contact Info

Product

Resources

About