On Relaxing Metric Information in Linear Temporal Logic

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.Comment: Minor change

On Relaxing Metric Information in Linear Temporal Logic

This paper studies the equi-satisfiability of metric linear temporal logic (LTL) and its qualitative subset. Metric LTL formulas rely on the next operator to encode distances, whereas qualitative LTL formulas use only the until modality. The paper shows how to transform any metric LTL formula M into a qualitative one Q, such that Q and M are equi-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, these results may help simplify the verification of systems with time-granularity heterogeneity, where large distances are required to express the coarse-grain dynamic

Towards the Exhaustive Verification of Real-Time Aspects in Controller Implementation

In industrial applications, the number of final products endowed with real-time automatic control systems that manage critical situations as far as human safety is concerned has dramatically increased. Thus, it is of growing importance that the control system design flow encompasses also its translation into software code and its embedding into a hardware and software network. In this paper, a tool-supported approach to the formal analysis of real-time aspects in controller implementation is proposed. The analysis can ensure that some desired properties of the control loop are preserved in its implementation on a distributed architecture. Moreover, the information extracted automatically from the model can also be used to approach straightforwardly some design problems, such as the hardwar

Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions

Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governance of service compositions is intrinsically decentralized and services may evolve independently over time. In this context, pre-deployment verification can only provide limited guarantees, while continuous run-time verification is needed to probe and guarantee the correctness of compositions at run time. This paper addresses the issue of efficiency in the run-time verification of service compositions described in BPEL. It considers an existing monitoring approach based on ALBERT, which is a temporal logic language suitable for asserting both functional and non-functional properties, and shows how to obtain the efficient run-time verification of ALBERT formulae. The paper introduces an operational semantics for ALBERT through an extension of alternating automata, and explains how to optimize it to produce smarter, and thus more efficient, encodings of defined formulae. The optimized operational semantics can then be the basis for an efficient implementation of the run-time verification framework

Quantifying the discord: Order discrepancies in Message Sequence Charts

International audienceEdith Elkind, Blaise Genest, Doron Peled, and Paola Spoletini. \newblock Quantifying the discord: Order discrepancies in Message Sequence Charts, special issue of ATVA 2007. \newblock {\em International Journal of Foundations of Computer Science (IJFCS)} 21(2): 211-233, WorldSciNet, 2010