Specifying real-time properties with metric temporal logic
Real-Time Systems
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Quantitative Temporal Reasoning
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Real-time Property Preservation in Approximations of Timed Systems
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Predictable real-time software synthesis
Real-Time Systems
| Hi-index | 0.00 |
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-time system and to analyze real-time properties of the model. However, due to the existence of ineliminable timing differences between the model and its realization, real-time properties verified in the model often cannot be preserved in its realization. In this paper, we propose a branching representation (timed state tree) to specify the timing behavior of a system, based on which we prove that real-time properties represented by Timed $\mathit{CTL^*}$ ($\mathit{TCTL^*}$ in short) formulas can be preserved between two neighboring real-time systems. This paper extends the results in [1][2], such that a larger scope of real-time properties can be preserved between real-time systems.