3229 search results - page 84 / 646 » The Theory of Timed Automata |
177
click to vote
ASYNC
2005
IEEE
15 years 12 months ago
2005
IEEE
We propose a novel technique for modeling and verifying timed circuits based on the notion of generalized relative timing. Generalized relative timing constraints can express not ...
210
click to vote
TOSEM
2010
15 years 1 months ago
2010
Web services are increasingly gaining acceptance as a framework for facilitating application-to-application interactions within and across enterprises. It is commonly accepted tha...
268
click to vote
ITICSE
2005
ACM
15 years 12 months ago
2005
ACM
This paper describes the first version of P (read “P flat”), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms t...
173
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
176
click to vote
FORMATS
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...