Timed Event System

The General System has been described in eigler76and PK00with the standpoints to define (1) the time base, (2) the admissible input segments, (3) the system states, (4) the state trajectory with an admissible input segment, (5) the output for a given state.

A Timed Event System defining the state trajectory associated with the current and event segments came from the class of General System to allows non-deterministic behaviors in it wang2012 Since the behaviors of DEVS can be described by Timed Event System, DEVS and RTDEVS is a sub-class or an equivalent class of Timed Event System.

Timed Event Systems

A timed event system is a structure

\mathcal=

where
* $\,Z$ is ''the set of events'';
* $\,Q$ is ''the set of states'';
* $\,Q_0 \subseteq Q$ is ''the set of initial states'';
* $Q_A \subseteq Q$ is ''the set of accepting states'';
* $\Delta \subseteq Q \times \Omega_ \times Q$ is ''the set of state trajectories'' in which $(q,\omega,q') \in \Delta$ indicates that a state $q \in Q$ can change into $q' \in Q$ along with an event segment $\omega \in \Omega_$. If two state trajectories $(q_1,\omega_1,q_2)$ and $(q_3, \omega_2, q_4) \in \Delta$ are called contiguous if $q_2 = q_3$, and two event trajectories $\omega_1$ and $\omega_2$ are contiguous. Two contiguous state trajectories $(q,\omega_1,p)$ and $(p,\omega_2, q') \in \Delta$ implies $(q,\omega_1\omega_2,q') \in \Delta$.

Behaviors and Languages of Timed Event System

Given a timed event system \mathcal=, ''the set of its behaviors'' is called its ''language'' depending on the
observation time length. Let $t$ be the observation time length.
If $0 \le t <\infty$, ''$t$-length observation language of''
$\mathcal$ is denoted by $L(\mathcal, t)$, and defined as

$L(\mathcal,t)=\.$

We call an event segment $\omega \in \Omega_$ a $t$-length behavior of $\mathcal$, if $\omega \in L(\mathcal,t)$.

By sending the observation time length $t$ to infinity, we define ''infinite length observation language of'' $\mathcal$
is denoted by $L(\mathcal, \infty)$, and defined as

$L(\mathcal,\infty)= \.$

We call an event segment $\omega \in \underset \lim \Omega_$ an infinite-length behavior of $\mathcal$, if $\omega \in L(\mathcal,\infty)$.

See also

State Transition System

References

* eigler76
* KP00
* wang2012{{cite conference, author = Moon H. Hwang , title = Qualitative Verification of Finite and Real-Time DEVS Networks , book-title= Proceedings of 2012 TMS/DEVS, location= Orlando, FL, USA , pages = 43:1–43:8, isbn = 978-1-61839-786-7

Automata (computation)
Formal specification languages