2632 search results - page 49 / 527 » Alternating Timed Automata |
161
click to vote
FOSSACS
2009
Springer
16 years 28 days ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
148
click to vote
FSTTCS
2007
Springer
16 years 9 days 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...
161
click to vote
ATVA
2005
Springer
15 years 11 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 ...
200
click to vote
FOSSACS
2011
Springer
14 years 9 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...
167
click to vote
ATVA
2005
Springer
15 years 11 months ago
2005
Springer
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...