Paper Info
Title
Reducing the state space of incompletely specified timed Moore machines
Abstract
In this paper, after recapping about completely specified Timed Moore Machines (TMM) and their minimization procedure, we present methods to reduce the number of states of incompletely specified Timed Moore Machines. For this purpose, we define the concepts of coverage and refinement between TMM, and we show how the coverage relation can be used to reduce the number of states of a TMM
Year
DOI
Venue
2010
10.1145/1878537.1878662
SpringSim
Keywords
Field
DocType
present method,moore machine,timed moore machines,state space,coverage relation,minimization procedure,devs
Computer science,Real-time computing,Minification,DEVS,State space
Conference
Citations 
PageRank 
References 
0
0.34
3
Authors
1
Name
Order
Citations
PageRank
Norbert Giambiasi122737.59