74 search results - page 4 / 15 » The Emptiness Problem for Tree Automata with Global Constrai... |
IRI
2008
IEEE
15 years 8 months ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
113
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
107
Voted
HYBRID
1997
Springer
15 years 6 months ago
1997
Springer
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
163
click to vote
LICS
2012
IEEE
13 years 4 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
129
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...