scispace - formally typeset
Search or ask a question

Showing papers by "Jean-François Raskin published in 1999"

Journal Article•
The Logic of Event Clocks: Decidability, Complexity and Expressiveness

[...]

Jean-François Raskin, Pierre-Yves Schobbens
01 Jan 1999-Journal of Automata, Languages and Combinatorics

31 citations

Fully decidable logics, automata and classical theories for defining regular real-time languages

[...]

Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens
01 Jan 1999

11 citations

Journal Article•DOI•
The logic of “initially” and “next”: complete axiomatization and complexity

[...]

P.-Y. Schobbens1, Jean-François Raskin2•
Université de Namur1, University of California, Berkeley2
12 Mar 1999-Information Processing Letters
TL;DR: It is shown here that the conjectured medium completeness of this system indeed holds, and it is shown that deciding this entailment is PSPACE-complete, while deciding validity is only coNP-complete.

7 citations

The logic of event clocks

[...]

Jean-François Raskin, Pierre-Yves Schobbens
01 Jan 1999

5 citations