921 search results - page 42 / 185 » On Interleaving in Timed Automata |
102
click to vote
FUIN
2008
15 years 2 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
113
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
112
click to vote
ATVA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
148
click to vote
TACAS
2010
Springer
15 years 9 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
143
click to vote
FOSSACS
2011
Springer
14 years 5 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...