Sciweavers

174 search results - page 19 / 35
» Existential Fixed-Point Logic
Sort
View
118
Voted
FCT
2005
Springer
15 years 9 months ago
On the Expressiveness of Asynchronous Cellular Automata
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
Benedikt Bollig
113
Voted
BIRTHDAY
1997
Springer
15 years 7 months ago
Syntax vs. Semantics on Finite Structures
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
Natasha Alechina, Yuri Gurevich
125
Voted
ACTA
2004
97views more  ACTA 2004»
15 years 3 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey
124
Voted
JAPLL
2010
104views more  JAPLL 2010»
14 years 10 months ago
Lightweight hybrid tableaux
We present a decision procedure for hybrid logic equipped with nominals, the satisfaction operator and existential, difference, converse, reflexive, symmetric and transitive modal...
Guillaume Hoffmann
126
Voted
FSTTCS
2007
Springer
15 years 10 months ago
Automata and Logics for Timed Message Sequence Charts
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
S. Akshay, Benedikt Bollig, Paul Gastin