32 search results - page 3 / 7 » Symbolic Robustness Analysis of Timed Automata |
HYBRID
1994
Springer
13 years 10 months ago
1994
Springer
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
ICCAD
1999
IEEE
13 years 10 months ago
1999
IEEE
We introduce a new method of verifying the timing of custom CMOS circuits. Due to the exponential number of patterns required, traditional simulation methods are unable to exhaust...
LICS
1998
IEEE
13 years 9 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
IPPS
2005
IEEE
13 years 12 months ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
MCU
2004
13 years 7 months ago
2004
Many different definitions of computational universality for various types of systems have flourished since Turing's work. In this paper, we propose a general definition of un...