333 search results - page 10 / 67 » On the complexity of partial order trace model checking |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
IANDC
2011
13 years 2 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
ISTA
2003
13 years 9 months ago
2003
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...