7 search results - page 1 / 2 » An automaton over data words that captures EMSO logic |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
CSL
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
LICS
2007
IEEE
13 years 10 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
PODS
2009
ACM
14 years 5 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...