Results 1  10
of
19
Robustness of Temporal Logic Specifications for ContinuousTime Signals
, 2009
"... In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with nontrivial metrics, for example continuous or hybrid, robustness is not only na ..."
Abstract

Cited by 43 (18 self)
 Add to MetaCart
In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with nontrivial metrics, for example continuous or hybrid, robustness is not only natural, but also a critical measure of system performance. Thus, we propose multivalued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, ε, from unsatisfiability. We prove that any other signal that remains εclose to the initial one also satisfies the same MTL specification under the usual Boolean semantics. Finally, our framework is applied to the problem of testing formulas of two fragments of MTL, namely Metric Interval Temporal Logic (MITL) and closed Metric Temporal Logic (clMTL), over continuoustime signals using only discretetime analysis. The motivating idea behind our approach is that if the continuoustime signal fulfills certain conditions and the discrete time signal robustly satisfies the temporal logic specification, then the corresponding continuoustime signal should also satisfy the same temporal logic specification.
Temporal Logic Verification Using Simulation
 In Proc. FORMATS’06
, 2006
"... Abstract. In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the verification of the temporal properties of a continuous system by verifying only a finite number of its (simu ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
Abstract. In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the verification of the temporal properties of a continuous system by verifying only a finite number of its (simulated) trajectories. The proposed framework comprises two main ideas. First, we take advantage of the fact that in metric spaces we can quantify how close are two different states. Based on that, we define robust, multivalued semantics for MTL (and LTL) formulas. These capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance from unsatisfiability. Second, we use the recently developed notion of bisimulation functions to infer the behavior of a set of trajectories that lie in the neighborhood of the simulated one. If the latter set of trajectories is bounded by the tube of robustness, then we can infer that all the trajectories in the neighborhood of the simulated one satisfy the same temporal specification as the simulated trajectory. The interesting and promising feature of our approach is that the more robust the system is with respect to the temporal logic specification, the less is the number of simulations that are required in order to verify the system. 1
Platformindependent Design for Embedded RealTime Systems
, 2003
"... With the increasing complexity of the emerging embedded realtime systems, traditional design approaches can not provide su#cient support for the development of these systems anymore. They especially lack the ability to trace and analyse realtime system properties. ..."
Abstract

Cited by 13 (11 self)
 Add to MetaCart
With the increasing complexity of the emerging embedded realtime systems, traditional design approaches can not provide su#cient support for the development of these systems anymore. They especially lack the ability to trace and analyse realtime system properties.
Robust sampling for MITL specifications
 In Proc. of FORMATS’07, volume 4763 of LNCS
, 2007
"... Abstract. Realtime temporal logic reasoning about trajectories of physical systems necessitates models of time which are continuous. However, discrete time temporal logic reasoning is computationally more efficient than continuous time. Moreover, in a number of engineering applications only discret ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Realtime temporal logic reasoning about trajectories of physical systems necessitates models of time which are continuous. However, discrete time temporal logic reasoning is computationally more efficient than continuous time. Moreover, in a number of engineering applications only discrete time models are available for analysis. In this paper, we introduce a framework for testing MITL specifications on continuous time signals using only discrete time analysis. The motivating idea behind our approach is that if the dynamics of the signal fulfills certain conditions and the discrete time signal robustly satisfies the MITL specification, then the corresponding continuous time signal should also satisfy the same MITL specification. 1
Robustness of temporal logic specifications
 IN: PROCEEDINGS OF FATES/RV. VOLUME 4262 OF LNCS
, 2006
"... In this paper, we consider the robust interpretation of metric temporal logic (MTL) formulas over timed sequences of states. For systems whose states are equipped with nontrivial metrics, such as continuous, hybrid, or general metric transition systems, robustness is not only natural, but also a cr ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
(Show Context)
In this paper, we consider the robust interpretation of metric temporal logic (MTL) formulas over timed sequences of states. For systems whose states are equipped with nontrivial metrics, such as continuous, hybrid, or general metric transition systems, robustness is not only natural, but also a critical measure of system performance. In this paper, we define robust, multivalued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, ε, from unsatisfiability. We prove that any other timed trace which remains εclose to the initial one also satisfies the same MTL specification with the usual Boolean semantics. We derive a computational procedure for determining an underapproximation to the robustness degree ε of the specification with respect to a given finite timed state sequence. Our approach can be used for robust system simulation and testing, as well as form the basis for simulationbased verification.
H.: Error estimation in modeldriven development for realtime software
 In: Proceedings of the Forum on Specification & Design Languages 2004
, 2004
"... Modeldriven approaches proved themselves not suited yet to support realtime software development. Even if they have the ability of capturing adequately both functional and nonfunctional (timing) characteristics of a system, they still lack an appropriate mechanism of generating an implementation ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
(Show Context)
Modeldriven approaches proved themselves not suited yet to support realtime software development. Even if they have the ability of capturing adequately both functional and nonfunctional (timing) characteristics of a system, they still lack an appropriate mechanism of generating an implementation from a model while preserving the properties verified. In previous work we have proven that, if the implementation trace is very close (ɛclose) to a model trace, the properties verified in the model are preserved upto ɛ in the system realization. This deviation is due to the model assumption of zerotime for computational actions that, in reality, no target platform can ensure. This paper proposes an approach for estimating the timedeviation between model and implementation, by modeling the realization of the system when software components would run on the target platform. The approach is based on Software/Hardware Engineering method for complex realtime systems design and the Ychart scheme concepts. 1
Predictability in realtime system development: (2) a case study
 In Proceedings of the Forum on Specification & Design Languages 2004 (FDL’04
, 2004
"... In a companion paper [HVV04], we have investigated the deficiency of existing design approaches in supporting predictability for realtime control system development. A design approach is then introduced with an adequate support for efficient and consistent design and code generation. In this paper, ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
(Show Context)
In a companion paper [HVV04], we have investigated the deficiency of existing design approaches in supporting predictability for realtime control system development. A design approach is then introduced with an adequate support for efficient and consistent design and code generation. In this paper, this design approach is illustrated by a case study of a railroad crossing system. The development process shows that our approach is able to preserve properties not only between design descriptions at different abstraction levels, but also between the design model and the generated implementation. 1
Formal property verification in a conformance testing framework. [Online at: http://www.public.asu. edu/∼hyabbas/techreports/MEMOCODE14TechRpt.pdf
, 2014
"... Abstract—In modelbased design of cyberphysical systems, such as switched mixedsignal circuits or softwarecontrolled physical systems, it is common to develop a sequence of system models of different fidelity and complexity, each appropriate for a particular design or verification task. In such a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract—In modelbased design of cyberphysical systems, such as switched mixedsignal circuits or softwarecontrolled physical systems, it is common to develop a sequence of system models of different fidelity and complexity, each appropriate for a particular design or verification task. In such a sequence, one model is often derived from the other by a process of simplification or implementation. E.g. a Simulink model might be implemented on an embedded processor via automatic code generation. Three questions naturally present themselves: how do we quantify closeness between the two systems? How can we measure such closeness? If the original system satisfies some formal property, can we automatically infer what properties are then satisfied by the derived model? This paper addresses all three questions: we quantify the closeness between original and derived model via a distance measure between their outputs. We then propose two computational methods for approximating this closeness measure. Finally, we derive syntactical rewriting rules which, when applied to a Metric Temporal Logic specification satisfied by the original model, produce a formula satisfied by the derived model. We demonstrate the soundness of the theory with several experiments. I.
Realtime Property Preservation in Concurrent Realtime Systems
 In: Proc. of 10th International Conference on RealTime and Embedded Computing Systems and Applications (RTCSA
, 2004
"... A key step in concurrent realtime system development is to build a model from which the implementation is synthesized. It is thus important to understand the relation between the properties of a model and its corresponding implementation. In this paper, we first build two relations: 1) #weakeni ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
A key step in concurrent realtime system development is to build a model from which the implementation is synthesized. It is thus important to understand the relation between the properties of a model and its corresponding implementation. In this paper, we first build two relations: 1) #weakening relations on MITLR formulas, which are used to express realtime properties of the system, and 2) #neighboring relations on timed state sequences, which are used to describe the timing behavior of the system. Based on these relations, we formally prove the realtime property preservation in approximations of concurrent realtime systems. This result generalizes [11], which is restricted to sequential realtime systems. Finally, we demonstrate how the result can be applied to the realtime system development by a case study of a railroad crossing system.
FlexRAM: Toward an
 Advanced Intelligent Memory System,” in International Conference on Computer Design
, 1999
"... correctnesspreserving synthesis for realtime software∗ ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
correctnesspreserving synthesis for realtime software∗