# Jean-François Raskin

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Model checking lots of systems: efficient verification of temporal properties in software product lines

- A. Classen, P. Heymans, Pierre-Yves Schobbens, A. Legay, Jean-François Raskin
- Computer Science
- ACM/IEEE 32nd International Conference on…
- 1 May 2010

In product line engineering, systems are developed in families and differences between family members are expressed in terms of features. Formal modelling and verification is an important issue in… Expand

Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking

- A. Classen, Maxime Cordy, Pierre-Yves Schobbens, P. Heymans, A. Legay, Jean-François Raskin
- Computer Science
- IEEE Transactions on Software Engineering
- 1 August 2013

The premise of variability-intensive systems, specifically in software product line engineering, is the ability to produce a large family of different systems efficiently. Many such systems are… Expand

Algorithms for Omega-Regular Games with Imperfect Information

- Jean-François Raskin, K. Chatterjee, L. Doyen, T. Henzinger
- Computer Science
- Log. Methods Comput. Sci.
- 18 June 2007

We study observation-based strategies for two-player turn-based games on
graphs with omega-regular objectives. An observation-based strategy relies on
imperfect information about the history of a… Expand

Acacia+, a Tool for LTL Synthesis

- A. Bohy, V. Bruyère, E. Filiot, N. Jin, Jean-François Raskin
- Computer Science
- CAV
- 7 July 2012

We present Acacia+, a tool for solving the LTL realizability and synthesis problems. We use recent approaches that reduce these problems to safety games, and can be solved efficiently by symbolic… Expand

The Regular Real-Time Languages

- T. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens
- Computer Science
- ICALP
- 13 July 1998

A specification formalism for reactive systems defines a class of Ω-languages. We call a specification formalism fully decidable if it is constructively closed under boolean operations and has a… Expand

Antichains: A New Algorithm for Checking Universality of Finite Automata

- M. Wulf, L. Doyen, T. Henzinger, Jean-François Raskin
- Computer Science
- CAV
- 17 August 2006

We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction to explicitly… Expand

On the optimal reachability problem of weighted timed automata

- P. Bouyer, T. Brihaye, V. Bruyère, Jean-François Raskin
- Computer Science
- Formal Methods Syst. Des.
- 1 October 2007

Abstract
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infimum cost as… Expand

Model-Checking for Weighted Timed Automata

- T. Brihaye, V. Bruyère, Jean-François Raskin
- Computer Science
- FORMATS/FTRTFT
- 22 September 2004

We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with costs on both edges… Expand

Almost ASAP semantics: from timed models to timed implementations

- M. Wulf, L. Doyen, Jean-François Raskin
- Computer Science
- Formal Aspects of Computing
- 1 October 2005

In this paper, we introduce a parametric semantics for timed controllers called the Almost ASAP (as soon as possible) semantics. This semantics is a relaxation of the usual ASAP semantics (also… Expand

A Lattice Theory for Solving Games of Imperfect Information

- M. Wulf, L. Doyen, Jean-François Raskin
- Computer Science, Mathematics
- HSCC
- 29 March 2006

In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical… Expand