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 …

In this paper various semantics in the linear time-branching time spectrum are presented in
a uniform, model-independent way. Restricted to the class of finitely branching, concrete …

In comparative concurrency semantics, one usually distinguishes between linear time and
branching time semantic equivalences. Milner's notion of observatin equivalence is often …

Induction is a pervasive tool in computer science and mathematics for defining objects and
reasoning on them. Coinduction is the dual of induction and as such it brings in quite …

This paper studies semantic equivalences and preorders for sequential systems with silent
moves, restricting attention to the ones that abstract from successful termination, stochastic …

Automated and semi-automated manipulation of so-called labelled transition systems has
become an important means in discovering flaws in software and hardware systems …

When manipulating concurrent processes it is desirable to suppress their internal details
and to consider two processes to be equivalent if their external behaviours are equivalent …

Recently, significant progress has been made in the development of timed process algebras
for the specification and analysis of real-time systems. This paper describes a timed process …

Most prior work on supervisory control of discrete event systems is for achieving
deterministic specifications, expressed as formal languages. In this paper we study …

The specification of priorities provides a convenient way of resolving conflicts in the design
of concurrent computing systems. Priorities have been widely used by operating systems to …