Multifacetted modelling and discrete event simulation
Multifacetted modelling and discrete event simulation
Theoretical Computer Science
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
GDEVS: A generalized discrete event specification for accurate modeling of dynamic systems
Transactions of the Society for Computer Simulation International
Theory of Modeling and Simulation
Theory of Modeling and Simulation
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
Time-Constrained Automata (Extended Abstract)
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Proceedings of the Real-Time: Theory in Practice, REX Workshop
State Minimization of Incompletely Specified Sequential Machines
IEEE Transactions on Computers
Exact and heuristic algorithms for the minimization of incompletely specified state machines
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
This paper introduces the Timed Sequential Machine (TSM) formalism. The TSM formalism is based on well-known sequential machines. It is less expressive than the Discrete Event System Specification formalism or Timed Automata, and it offers a set of concepts well adapted to intermediate abstraction levels that appear in the design or analysis processes of discrete event systems. In addition, timed extensions of testing and simplification methods for sequential machines can be defined and used in finite-state TSMs. After presenting the formal definition of a TSM and its behavior, methods are proposed for the minimization of completely specified finite-state TSMs and for the simplification of incompletely specified finite-state TSMs. Finally, it is demonstrated that the TSM formalism has the property of being closed under coupling. That is, any coupled TSM model can be described in terms of an atomic TSM model.