Jump to content

Event segment

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Mhhwang2002 (talk | contribs) at 20:42, 17 January 2009 (Created page with '== Event Segments == An ''event'' is a label that abstracts a change. Given an event set <math> Z</math>, the ''null event'' denoted by <math> \epsilon \not \in Z</...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Event Segments

An event is a label that abstracts a change. Given an event set , the null event denoted by stands for nothing change. The time base of our concerning systems is denoted by , and defined

as non-negative real numbers. The time base plus infinity is denoted by , and defined

as non-negative real numbers plus infinity.

A timed event over an event set and a time interval denotes that an event occurs at time . The null segments over time interval is denoted by which means that there is no event over .

If there exists one event at time , we call it an unit event segments. More precisely, the unit event segment over an event set and time interval is equivalent to

where and are respectively called pre-null segment and post-null segment of the unit event segment.

Given an event set , concatenation of two unite event segments over and over is denoted by whose time interval is , and implies . A multi-event segment is concatenations of unite event segments and where .


The {universal timed language over an event set and a time interval , is denoted by , and is defined as the set of all possible event segments. Formally,

where denotes a none or multiple concatenation(s) of timed events. Notice that the number of events in a string can be either of zero, finite or infinite. Infinite many events in a string implies that , however does not imply infinite many events in it.


A language over an event set and a timed interval is a set of timed strings over and . If is a language over and , then .

References

  • [Zeigler76] Bernard Zeigler (1976). Theory of Modeling and Simulation (first ed.). Wiley Interscience, New York.
  • [ZKP00] Bernard Zeigler, Tag Gon Kim, Herbert Praehofer (2000). Theory of Modeling and Simulation (second ed.). Academic Press, New York. ISBN 978-0127784557.{{cite book}}: CS1 maint: multiple names: authors list (link)