Reducing the state space of incompletely specified timed Moore machines

Authors:
Norbert Giambiasi
Affiliations:
Aix-Marseille Université, Marseille Cedex, France
Venue:
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Year:
2010

Citing 5
Cited 1

Multifacetted modelling and discrete event simulation

Multifacetted modelling and discrete event simulation
A theory 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
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
From sequential machines to DEVS formalism

SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference

ISTSM: incompletely specified timed sequential machines (Work-in-Progress)

Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium

Quantified Score

Hi-index	0.00

Visualization

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