In this chapter, we present a hierarchy of infinite-state systems based on the primitive
operations of sequential and parallel composition; the hierarchy includes a variety of …

There are many di erent formal models for systems with in nite state spaces. Among them
are context-free processes, Basic Parallel Processes, PA-processes, pushdown processes …

We survey principles of model checking techniques for the automatic analysis of reactive
systems. The use of model checking is exemplified by an analysis of the Needham …

1 Introduction Page 1 Decidability of model checking for in nite-state concurrent systems Javier
Esparza Laboratory for Foundations of Computer Science University of Edinburgh August 26 …

In this paper we propose a new approach to check history-preserving equivalence for Petri
nets. Exploiting this approach, history-preserving bisimulation is proved decidable for the …

We develop an automata-theoretic framework for reasoning about infinite-state sequential
systems. Our framework is based on the observation that states of such systems, which carry …

A new bisimulation notion is introduced for the specification of concurrent systems, which
resists to a large class of action refinements, even in the presence of invisible actions. The …

Regular model checking is being developed for algorithmic verification of several classes of
infinite-state systems whose configurations can be modeled as words over a finite alphabet …

We investigate the verification problem of two classes of infinite state systems wrt nonregular
properties (ie, nondefinable by finite-state Ω-automata). The systems we consider are Petri …

Bounded model checking has been recently introduced as an efficient verification method
for reactive systems. In this work we apply bounded model checking to asynchronous …