In this tutorial we give an overview of the process algebra EMPA, a calculus devised in order
to model and analyze features of real-world concurrent systems such as nondeterminism …

We present an overview and synthesis of existing results about process algebras for the
specification and analysis of timed systems. The motivation is double: present an overview …

The Concurrency Workbench is an automated tool for analyzing networks of finite-state
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …

In this paper we are interested in general properties of classes of transition system
specifications in Plotkin style. The discussion takes place in a setting of labelled transition …

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

A standard process algebra is extended by a new action σ which is meant to denote idling
until the next clock cycle. A semantic theory based on testing is developed for the new …

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 …

In this article the general approach to Plotkin-style operational semantics of Groote and
Vaandrager (1989) is extended to transition system specifications (TSSs) with rules that may …

CBS is a simple and natural CCS-like calculus where processes speak one at a time and
are heard instantaneously by all others. Speech is autonomous, contention between …

We present a general theory for the use of negative premises in the rules of Transition
System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in …