We examine modal and temporal logics for processes. In section 1 we introduce concurrent
processes as terms of an algebraic language comprising a few basic operators, as …

This paper surveys various notions of equivalence for concurrent systems in the framework
of Elementary Net Systems, a fundamental class in the family of Petri Net models. Two types …

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 bisimulation up to congruence as a technique for proving language
equivalence of non-deterministic finite automata. Exploiting this technique, we devise an …

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 …

We consider a pushdown automaton as a word-rewriting system with labelled rules applied
only in a prefix way. The notion of pushdown transition graph is then extended to the notion …

We develop a model-checking algorithm that decides for a given context-free process
whether it satisfies a property written in the alternation-free modal mu-calculus. The central …

A context-free grammar(CFG) in Greibach Normal Form coincides, in another notation, with
a system of guarded recursion equations in Basic Process. $ dgebrzd. Hence, to each CFG …

The previous best upper bound on the complexity of deciding bisimilarity between normed
context-free processes is due to Huynh and Tian (1994), who put the problem in Σ2P …

In a previous paper the authors proved the decidability of bisimulation equivalence over two
subclasses of recursive processes involving a parallel composition operator, namely the so …