3750 search results - page 87 / 750 » Timed Automata Patterns |
IPPS
2000
IEEE
14 years 3 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
HYBRID
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
CORR
2009
Springer
13 years 8 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
FMSD
2007
13 years 10 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...