Veriication of timed bisimulation equivalence is generally diicult because of state explosion caused by concrete time values. In this paper, we propose a veriication method to verify timed bisimulation equivalence of two timed processes using a symbolic technique similar to (Hennessy and Lin 1995). We rst propose a new model of timed processes, Alternating Timed Symbolic Labelled Transition Sys...

[Purpose] This study aimed to determine the correlation between center of pressure and functional balance in non-faller elderly practitioners of Tai Chi. [Subjects and Methods] For the study, nine non-faller elderly practitioners of Tai Chi who were able to maintain a standing posture and walk independently were recruited. Timed one-leg standing and timed up-and-go tests were used as functional...

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...

Condition/Event systems 14] represent a continuous{time modeling framework used in control theory within the eld of discrete event dynamic systems. This model has been extended in 7] to include real{time aspects. Timed automata 2] are a widely accepted model for real{time systems. They have been intensively studied from diierent points of view leading to a variety of tools that analyze real{tim...

Timed process algebras are useful tools for the specification and verification of real-time systems. We study the expressiveness of (classes of) these algebras which deal with temporal aspects of concurrent systems by following very different interpretations: durational actions versus durationless actions, absolute time versus relative time, timed functional behavior versus time and functional ...

Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here, we design a verification algorithm for networks of timed automata with invariants. Based on the unfolding technique, our method produces a branching process as an acyclic Petri net extended with read arcs. These arc...

We introduce Timed Counter Systems, a new class of systems mixing clocks and counters. Such systems have an infinite state space, and their reachability problems are generally undecidable. By abstracting clock values with a Region Graph, we show the Counter Reachability Problem to be decidable for three subclasses : Timed VASS, Bounded Timed Counter Systems, and Reversal-Bounded Timed Counter S...

Timed automata as acceptors of languages of finite timed words form a very useful framework for the verification of safety properties of real-time systems. Many of the classical automata-theoretic decision problems are undecidable for timed automata, for instance the inclusion or the universality problem. In this paper we consider restrictions of these problems: universality for deterministic t...