3 research outputs found
Practical Automated Partial Verification of Multi-Paradigm Real-Time Models
This article introduces a fully automated verification technique that permits
to analyze real-time systems described using a continuous notion of time and a
mixture of operational (i.e., automata-based) and descriptive (i.e.,
logic-based) formalisms. The technique relies on the reduction, under
reasonable assumptions, of the continuous-time verification problem to its
discrete-time counterpart. This reconciles in a viable and effective way the
dense/discrete and operational/descriptive dichotomies that are often
encountered in practice when it comes to specifying and analyzing complex
critical systems. The article investigates the applicability of the technique
through a significant example centered on a communication protocol. More
precisely, concurrent runs of the protocol are formalized by parallel instances
of a Timed Automaton, while the synchronization rules between these instances
are specified through Metric Temporal Logic formulas, thus creating a
multi-paradigm model. Verification tests run on this model using a bounded
validity checker implementing the technique show consistent results and
interesting performances.Comment: 33 pages; fixed a few typos and added data to Table
Integrated Modeling and Verification of Real-Time Systems through Multiple Paradigms
Complex systems typically have many different parts and facets, with
different characteristics. In a multi-paradigm approach to modeling, formalisms
with different natures are used in combination to describe complementary parts
and aspects of the system. This can have a beneficial impact on the modeling
activity, as different paradigms an be better suited to describe different
aspects of the system. While each paradigm provides a different view on the
many facets of the system, it is of paramount importance that a coherent
comprehensive model emerges from the combination of the various partial
descriptions. In this paper we present a technique to model different aspects
of the same system with different formalisms, while keeping the various models
tightly integrated with one another. In addition, our approach leverages the
flexibility provided by a bounded satisfiability checker to encode the
verification problem of the integrated model in the propositional
satisfiability (SAT) problem; this allows users to carry out formal
verification activities both on the whole model and on parts thereof. The
effectiveness of the approach is illustrated through the example of a
monitoring system.Comment: 27 page