A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA
نویسندگان
چکیده
منابع مشابه
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
In the development of real-time communicating hardware/embedded-software systems, it is frequently the case that we want to refine/optimize the system’s internal behavior while preserving the external timed I/O behavior. In such a design refinement, modification of the systems’ internal branching structures, as well as re-scheduling of internal actions, may frequently occur. Our goal is, then, ...
متن کاملA Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
In the development of real-time (communicating) hardware or embedded-software systems, it is frequently the case that we want to refine/optimize the system’s internal behavior while preserving the external timed I/O behavior (that is, the interface protocol). In such a design refinement, modification of the systems’ internal branching structures, as well as re-scheduling of internal actions, ma...
متن کاملParametric Real-Time System Feasibility Analysis Using Parametric Timed Automata
Real-time applications are playing an increasingly significant role in our life. The cost and risk involved in their design leads to the need for a correct and robust modelling of the system before its deployment. Many approaches have been proposed to verify the schedulability of real-time task system. A frequent limitation is that they force the task activation to restrictive patterns (e.g. pe...
متن کاملParametric Interrupt Timed Automata
Parametric reasoning is particularly relevant for timed models, but very often leads to undecidability of reachability problems. We propose a parametrised version of Interrupt Timed Automata (an expressive model incomparable to Timed Automata), where polynomials of parameters can occur in guards and updates. We prove that different reachability problems, including robust reachability, are decid...
متن کاملEvent Order Abstraction for Parametric Timed Verification
We present a new abstraction technique, event order abstraction (EOA), for parametric safety verification of real-time systems in which “correct orderings of events” needed for system correctness are preserved by timing dependent behavior of the systems. By using EOA, one can separate the task of verifying a system into two parts: 1. A derivation of timing parameter constraints for correct orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2006
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054106004133