Paper Info
Title
An introduction to Timed Sequential Machines
Abstract
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.
Year
DOI
Venue
2014
10.1177/0037549713519842
Simulation
Keywords
DocType
Volume
atomic TSM model,incompletely specified finite-state TSMs,TSM model,finite-state TSMs,well-known sequential machine,simplification method,sequential machine,Timed Sequential Machine,Timed Sequential Machines,Timed Automata,TSM formalism
Journal
90
Issue
ISSN
Citations 
3
0037-5497
0
PageRank 
References 
Authors
0.34
11
1
Name
Order
Citations
PageRank
Norbert Giambiasi122737.59