186 search results - page 10 / 38 » Decidable Extensions of Church's Problem |
CSR
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
CADE
1999
Springer
14 years 1 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
CONCUR
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checki...
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
FLAIRS
2007
13 years 12 months ago
2007
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...