This note addresses the history of process algebra as an area of research in concurrency
theory, the theory of parallel and distributed systems in computer science. Origins are traced …

Abstract Structural Operational Semantics (SOS) provides a framework to give an
operational semantics to programming and specification languages, which, because of its …

Process algebra is a widely accepted and much used technique in the specification and
verification of parallel and distributed software systems. This book sets the standard for the …

A framework allowing a unified and rigorous definition of the semantics of concurrency is
proposed. The mathematical model introduces processes as elements of process domains …

As a preliminary overview, this work provides first a broad tutorial on the fluidization of
discrete event dynamic models, an efficient technique for dealing with the classical state …

Renaming operators are introduced in concrete process algebra (concrete means that
abstraction and silent moves are not considered). Examples of renaming operators are …

Many process algebras are defined by structural operational semantics (SOS). Indeed, most
such definitions are nicely structured and fit the GSOS format of Bloom et al.(J. Assoc …

A survey of process algebra is presented including the following features: merging
processes without communication, merging processes with communication, data flow …

In this study, we present rule formats for four main notions of bisimulation with silent moves.
Weak bisimulation is a congruence for any process algebra defined by WB cool rules; we …

A simple model, AT, for nondeterministic machines is presented which is based on certain
types of trees. A set of operations, Σ, is defined over AT and it is shown to be completely …