Johann Deneux

Decidability and complexity results for timed automata via channel machines

This paper is concerned with the language inclusion problem for timed automata: given timed automata

Multi-clock timed networks

{\mathcal A}

Forward Reachability Analysis of Timed Petri Nets

and

Minimization of non-deterministic automata with large alphabets

{\mathcal B}

A Common Framework for Design and Safety Analyses using Formal Methods

, is every word accepted by

Designing safe, reliable systems using scade

{\mathcal B}

Universality Analysis for One-Clock Timed Automata

also accepted by

A Formal Semantics for UML Statecharts

{\mathcal A}

Using forward reachability analysis for verification of timed petri nets

? Alur and Dill [3] showed that the language inclusion problem is decidable if

Closed, Open, and Robust Timed Networks

{\mathcal A}