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 …

Over the last few years there has been an increasing research effort directed towards the
automatic verification of infinite state systems. This paper is concerned with identifying …

Over the past few years increasing research effort has been directed towards the automatic
verification of infinite-state systems. This paper is concerned with identifying general …

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 …

In this paper we present an algorithm for efficiently computing optimal cost of reaching a
goal state in the model of Linearly Priced Timed Automata (LPTA). The central contribution …

" Constraints, such as linear or polynomial equalities, are used to finitely represent possibly
infinite sets of points. They provide an elegant way to combine classical relational data with …

We consider an extension of linear-time temporal logic (LTL) with constraints interpreted
over a concrete domain. We use a new automata-theoretic technique to show PSPACE …

Introduced forty years ago, relational databases proved unusually successful and durable.
However, relational database systems were not designed for modern applications and …

Abstract We study Linear Temporal Logic Modulo Theories over Finite Traces (LTL MT f), a
recently introduced extension of LTL over finite traces (LTL f) where propositions are …

We show that constraint logic programming (CLP) can serve as a conceptual basis and as a
practical implementation platform for the model checking of infinite-state systems. CLP …