#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1997

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Martin De Wulf, Laurent Doyen, Jean-François Raskin
- Formal Aspects of Computing
- 2004

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 called the maximal progress semantics) which is a mathematical idealization that cannot be implemented by any physical device no matter how fast it is. On the… (More)

- Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
- Formal Methods in System Design
- 2008

Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturbation in the timing of actions may lead to completely different behaviors of the automaton. Following several recent works, we consider a relaxation of this semantics, in which… (More)

- Martin De Wulf, Laurent Doyen, Jean-François Raskin
- HSCC
- 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 solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not… (More)

- Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
- FORMATS/FTRTFT
- 2004

In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We showed that this semantics is implementable provided there exists a strictly positive value for the parameter ∆ for which the strategy is correct. In this paper, we define the… (More)

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 determinize the automaton, we keep the determinization step implicit. Our algorithm computes the least fixed point of a monotone function on the lattice of… (More)

The linear temporal logic (LTL) was introduced by Pnueli as a logic to express properties over the computations of reactive systems. Since this seminal work, there have been a large number of papers that have studied deductive systems and algorithmic methods to reason about the correctness of reactive programs with regard to LTL properties. In this paper,… (More)

- Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger
- Inf. Comput.
- 2008

We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information… (More)

- Martin De Wulf
- 2006

Computer Science is currently facing a grand challenge : finding good design practices for embedded systems. Embedded systems are essentially computers interacting with some physical process. You could find one in a braking systems or in a nuclear power plant for example. They present several design difficulties : first they are reactive systems,… (More)

- Edina Tolnay, Thorsten Wiethege, Cornelius Kuhnen, Martin Wulf, Bruno Voss, Klaus-Michael Müller
- Journal of Cancer Research and Clinical Oncology
- 1997

Tumor growth and metastasis are angiogenesis-dependent processes initiated and regulated by a number of cytokines. Vascular endothelial growth factor (VEGF) is a potent angiogenic protein with a selective mitogenic effect on vascular endothelial cells, known to be involved in physiological (embryogenesis) and pathophysiological (rheumatoid arthritis, tumor)… (More)

Alpaga is a solver for two-player parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs a winning strategy. The tool provides a symbolic implementation of a recent algorithm based on antichains.