Trio2Promela: A Model Checker for Temporal Metric Specifications

Bianculli, Domenico; Morzenti, Angelo; Pradella, Matteo; Pietro, Pierluigi San; Spoletini, Paola

doi:10.1109/icsecompanion.2007.79

Cited by 8 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recently, we defined, for a decidable fragment of TRIO (semantically equivalent to PLTL), a tool for satisfiability checking via automata-theoretic model checking [30,35,3,2]. Our results confirm the obvious expectation that satisfiability checking is harder than model checking of a system of the same size, but that it may still be feasible in interesting cases.…”

Section: Introductionsupporting

confidence: 61%

The symmetry of the past and of the future

Pradella

Morzenti

Pietro

2007

Proceedings of the the 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the F

Self Cite

View full text Add to dashboard Cite

Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over ω-words, i.e., infinite in the future but finite in the past. However, time with also an infinite past is a useful abstraction in specification. It allows one to ignore the complexity of system initialization in much the same way as system termination may be abstracted away by allowing an infinite future. One can then write specifications that are simpler and more easily understandable, because they do not include the description of the operations (such as configuration or installation) typically performed at system deployment time. The present paper is centered on the problem of satisfiability checking of linear temporal logic (LTL) formulae with past operators. We show that bounded model checking techniques can be adapted to deal with bi-infinite time in temporal logic, without incurring in any performance loss. Our claims are supported by a tool, whose application to a case study shows that satisfiability checking may be feasible also on nontrivial examples of temporal logic specifications.

show abstract

Section: Introductionsupporting

confidence: 61%

The symmetry of the past and of the future

Pradella

Morzenti

Pietro

2007

Proceedings of the the 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the F

Self Cite

View full text Add to dashboard Cite

show abstract

“…• implement a translator from LTL to formulas equi-satisfiable over words with bounded variability and combine it with off-the-shelf LTL satisfiability checking tools [34,3,29,31];…”

Section: Discussionmentioning

confidence: 99%

On Relaxing Metric Information in Linear Temporal Logic

Furia

Spoletini

2011

2011 Eighteenth International Symposium on Temporal Representation and Reasoning

Self Cite

View full text Add to dashboard Cite

Metric LTL formulas rely on the next operator to encode time distances, whereas qualitative LTL formulas use only the until operator. This paper shows how to transform any metric LTL formula M into a qualitative formula Q, such that Q is satisfiable if and only if M is satisfiable over words with variability bounded with respect to the largest distances used in M (i.e., occurrences of next), but the size of Q is independent of such distances. Besides the theoretical interest, this result can help simplify the verification of systems with time-granularity heterogeneity, where large distances are required to express the coarse-grain dynamics in terms of fine-grain time units.

show abstract

“…This approach is convenient, since in many practical cases, when the original formulas are large, the direct translation to BA and then to ProMeLa is simply unfeasible. We refer the reader to [2,15] for a detailed description of the translation from AMCA and BA to ProMeLa code.…”

Section: Moreover Consider and Letmentioning

confidence: 99%

“…In [2] we presented TRIO2ProMeLa, a tool that translates TRIO formulas (or, equivalently, MTL formulas) into a ProMeLa representation of the automata presented in Section 3. ProMeLa is the input language to the Spin model-checker [10], hence the tool allows one to check the satisfiability of an MTL formula on top of Spin.…”

Section: Moreover Consider and Letmentioning

confidence: 99%

Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers

Furia

Spoletini

Theoretical Aspects of Computing - ICTAC 2008

Self Cite

View full text Add to dashboard Cite

Abstract. We investigate the satisfiability problem for metric temporal logic (MTL) with both past and future operators over linear discrete bi-infinite time models isomorphic to the integer numbers, where time is unbounded both in the future and in the past. We provide a technique to reduce satisfiability over the integers to satisfiability over the wellknown mono-infinite time model of natural numbers, and we show how to implement the technique through an automata-theoretic approach. We also prove that MTL satisfiability over the integers is EXPSPACEcomplete, hence the given algorithm is optimal in the worst case.

show abstract

Trio2Promela: A Model Checker for Temporal Metric Specifications

Cited by 8 publications

References 10 publications

The symmetry of the past and of the future

The symmetry of the past and of the future

On Relaxing Metric Information in Linear Temporal Logic

Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers

Contact Info

Product

Resources

About