Well-structured transition systems provide the right foundation to compute a finite basis of
the set of predecessors of the upward closure of a state. The dual problem, to compute a …

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 …

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 consider parity games on infinite graphs where configurations are represented by
control-states and integer vectors. This framework subsumes two classic game problems …

We study the relationship between name creation and replication in a setting of infinitestate
communicating automata. By name creation we mean the capacity of dynamically producing …

Time dependant models have been intensively studied for many reasons, among others
because of their applications in software verification and due to the development of …

We present an abstract interpretation based approach to solve the coverability problem of
well-structured transition systems. Our approach distinguishes from other attempts in that (1) …

We define representations for downward-closed subsets of a rich family of well-quasi-orders,
and more generally for closed subsets of an even richer family of Noetherian topological …

In this paper, we propose a novel method of calibrating a spherical image capture system
which acquires spherical images by using a pair of fish-eye conversion lenses with the field …

We consider priced timed Petri nets, ie, unbounded Petri nets where each token carries a
real-valued clock. Transition arcs are labeled with time intervals, which specify constraints …