11 search results - page 2 / 3 » Slicing of Timed Automata with Discrete Data |
AI
2005
Springer
13 years 11 months ago
2005
Springer
This paper deals with the incremental off-line computation of diagnosis of discrete-event systems. Traditionally, the diagnosis is computed from the global automaton describing th...
RTAS
2003
IEEE
13 years 10 months ago
2003
IEEE
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
WSC
1998
13 years 6 months ago
1998
A regional transportation system and the movement of large traffic volumes through it, are characteristic of stochastic systems. The standard traffic management or transportation ...
FM
2001
Springer
13 years 10 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
—We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and pre...