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 …

This paper introduces the model of linearly priced timed automata as an extension of timed
automata, with prices on both transitions and locations. For this model we consider the …

Abstract We consider (unbounded) Timed Petri Nets (TPNs) where each token is equipped
with a real-valued clock representing the 'age'of the token. Each arc in the net is provided …

We propose a new method for the parameterized verification of formal specifications of
cache coherence protocols. The goal of parameterized verification is to establish system …

In recent works we have defined a general framework for the validation of parameterized
concurrent systems based on the combination of multiset rewriting and constraints. The …

We describe a simple, conceptual forward analysis procedure for infinity-complete WSTS S.
This computes the so-called clover of a state. When S is the completion of a WSTS X, the …

In this paper, we give a step by step introduction to the theory of well quasi-ordered
transition systems. The framework combines two concepts, namely (i) transition systems …

Abstract Timed-Arc Petri Nets (TAPN) are an extension of the classical P/T nets with
continuous time. Tokens in TAPN carry an age and arcs between places and transitions are …

We present an algorithm for inferring a timed-automaton model of a system from information
obtained by observing its external behavior. Since timed automata can not in general be …

Parameterized Complexity for the Skeptic ÇÒ Page 1 Parameterized Complexity for the Skeptic
Rod Downey £ School of Mathematical and Computing Sciences Victoria University PO Box 600 …