Observability of extended timed event graph
The concepts of observability and reachability for extended timed event graphs are introduced and discussed in detail. Using graph theory, necessary and sufficient conditions for observability and reachability are formulated and proved. The standard structure of extended timed event graphs is also investigated using the concepts of observability and reachability. Moreover, many remarks, comments and relationships to results existing in the literature are given. Finally, it should be pointed out that discrete event systems are discussed in detail in the monograph [\textit{Chen Wende} and \textit{Qi Xiangdong}, The discrete event dynamic systems -- max algebra methods, Science Press, Beijing, China (1994)].
- Observers for a Class of Timed Automata Based on Elapsed Time Graphs
- Supervisory control of extended timed event graphs
- Observational equivalences for timed stable event structures
- scientific article; zbMATH DE number 2084342
- Steady state analysis of timed event graphs with time window constraints
- Relative Observability and Coobservability of Timed Discrete-Event Systems
- Model checking for event graphs and an event temporal logic
- Timed-event graphs with multipliers and homogeneous min-plus systems
- Complexity results for weighted timed event graphs
- Reachability in graph timelines
This page was built for publication: Observability of extended timed event graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883953)
