Well-structured transition systems (WSTSs) are a general class of infinite-state systems for
which decidability results rely on the existence of a well-quasi-ordering between states that …

We introduce a hierarchy of fast-growing complexity classes and show its suitability for
completeness statements of many nonelementary problems. This hierarchy allows the …

In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions.
We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we …

An overview of the current state of the art of formal verification of real-time systems is
presented. We discuss commonly accepted models, specification languages, verification …

Abstract TAPAAL 2.0 is a platform-independent modelling, simulation and verification tool for
extended timed-arc Petri nets. The tool supports component-based modelling and offers an …

In this paper we consider the model of Time Petri Nets (TPN) where time is associated with
transitions. We also consider Timed Automata (TA) as defined by Alur & Dill, and compare …

In this paper we study the model of Time Petri Nets (TPNs) where a time interval is
associated with the firing of a transition, but we extend it by considering general intervals …

Verification of real-time systems is an important subject of research. This is highly motivated
by an increasing demand to verify safety critical systems, ie, time-dependent distributed …

In this paper, we propose a method for building the state class graph of a bounded time Petri
net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We …

We propose a model that captures the behavior of real-time recursive systems. To that end,
we introduce dense-timed pushdown automata that extend the classical models of …