Paper Info
Title
ISTSM: incompletely specified timed sequential machines.
Abstract
In this paper, after the definition of incompletely specified Timed Sequential Machines (ISTSM), we present a method to reduce the number of states of this sub-class class of Timed Sequential Machines. For this purpose, we define the relations of coverage and compatibility between two states of an ISTSM, and we show how these relations can be used to reduce the number of states of an ISTSM.
Year
Venue
Keywords
2011
Simulation Series
discrete event system,timed sequential machines,incompletely specified,state covering,state compatibility
Field
DocType
Volume
Programming language,Computer science
Conference
43
Issue
ISSN
Citations 
1
0735-9276
1
PageRank 
References 
Authors
0.43
0
1
Name
Order
Citations
PageRank
Norbert Giambiasi122737.59