234 search results - page 39 / 47 » On Quasi-Products of Tree Automata |
118
click to vote
ATVA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
CONCUR
2007
Springer
15 years 7 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
109
click to vote
FOSSACS
2007
Springer
15 years 7 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
154
click to vote
ACOM
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
109
click to vote
CPM
1999
Springer
15 years 5 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...