We introduce a reversible process calculus with a new feature of execution control that
allows us to change the direction and pattern of computation. This feature allows us to model …

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 …

Formal semantic description is significant for design, reasoning and standardization of
programming languages, and it plays an important part in the optimization of the compiler …

We introduce a process calculus with a new prefixing operator that allows us to model
locally controlled reversibility. Actions can be undone spontaneously, as in other reversible …

We propose both an SOS transition rule format for the generative model of probabilistic
processes, and an SOS transition rule format for the reactive model of the probabilistic …

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 …

The two levels of data and actions on those data provided by the separation between
equations and rules in rewriting logic are completed by a third level of strategies to control …

Often fairness assumptions need to be made in order to establish liveness properties of
distributed systems, but in many situations they lead to false conclusions. This document …

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 …

Earlier we presented a method to decompose modal formulas for processes with the internal
action τ; congruence formats for branching and η-bisimilarity were derived on the basis of …