942 search results - page 40 / 189 » Interrupt Timed Automata |
BCS
2008
13 years 10 months ago
2008
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
DLOG
2006
13 years 10 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
FMCAD
2006
Springer
14 years 14 days ago
2006
Springer
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
CHI
1999
ACM
14 years 1 months ago
1999
ACM
Mobile workers need seamless access to communication and information services on portable devices. However current solutions overwhelm users with intrusive and ambiguous notificat...
ERSHOV
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. The token flow semantics of UML 2 activity diagrams is formally defined using Abstract State Machines. Interruptible activity regions and multiplicity bounds for pins are...