942 search results - page 21 / 189 » Interrupt Timed Automata |
104
Voted
CONCUR
1998
Springer
15 years 6 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
125
click to vote
CONCUR
2010
Springer
15 years 12 days ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
112
Voted
ICFP
1999
ACM
15 years 6 months ago
1999
ACM
Languages such as Java, ML, Scheme, and Haskell provide automatic storage management, that is, garbage collection. The two fundamental operations performed on a garbagecollected h...
148
click to vote
APN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
117
click to vote
DAC
2007
ACM
16 years 2 months ago
2007
ACM
Interrupt behaviors, especially the external ones, are difficult to verify in a microprocessor design project in that they involve both interacting hardware and software. This pap...