3169 search results - page 57 / 634 » Robust Timed Automata |
TIME
2002
IEEE
15 years 6 months ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
130
click to vote
CAV
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
109
click to vote
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...
124
click to vote
FUIN
2010
14 years 11 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
127
Voted
ET
2007
15 years 1 months ago
2007
In this paper, different circuits of Quantum-dot Cellular Automata (QCA) are proposed for the so-called coplanar crossing. Coplanar crossing is one of the most interesting feature...