516 search results - page 6 / 104 » Generalizing the Discrete Timed Automaton |
61
Voted
LICS
1997
IEEE
15 years 1 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
76
Voted
HYBRID
2007
Springer
15 years 1 months ago
2007
Springer
A notion of diagnosability for hybrid systems is defined, which generalizes the notion of observability. We verify bility properties on a timed automaton abstraction of the origina...
118
click to vote
Publication
The space-time geometric structure of Maxwell’s equations is examined and a subset of them is found to define a pair of exact discrete time-stepping relations. The desirability ...
DEDS
2007
14 years 9 months ago
2007
This paper presents a general framework for efficient synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of p...
76
Voted
FORMATS
2009
Springer
15 years 4 months ago
2009
Springer
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...