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

In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to
define operational semantics of programming languages by a set of rules of a certain shape …

A bisimulation for a coalgebra of a functor on the category of sets can be described via a
coalgebra in the category of relations, of a lifted functor. A final coalgebra then gives rise to …

This paper explores the connection between semantic equivalences and preorders for
concrete sequential processes, represented by means of labeled transition systems, and …

This chapter provides an overview of the addition of various forms of iteration, ie, recursive
operations, to process algebra. Of these operations,(the original, binary version of) the …

We present a method for decomposing modal formulas for processes with the internal action
τ. To decide whether a process algebra term satisfies a modal formula, one can check …

In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with
silent moves. He proved that weak bisimulation equivalence is a congruence for any …

Rule formats can quickly establish meta-theoretic properties of process algebras. It is then
desirable to identify domain-specific languages (DSLs) that can easily express rule formats …

We present a general and uniform method for defining structural operational semantics
(SOS) of process operators by traditional Plotkin-style transition rules equipped with …

In two earlier papers we derived congruence formats with regard to transition system
specifications for weak semantics on the basis of a decomposition method for modal …