Comparative concurrency semantics and refinement of actions von Glabbeek, Rob van

Inhaltsverzeichnis

The difference between splitting in n and n+1 von Glabbeek, Rob van, Vaandrager, Frits W.

A deadlock-sensitive congruence for action refinement von Glabbeek, Rob van, Goltz, Ursula

The refinement theorem for ST-bisimulation semantics von Glabbeek, Rob van

Volltext öffnen

The linear time - branching time spectrum von Glabbeek, Rob van

Volltext öffnen

Equivalences and Refinement von Glabbeek, Rob van, Goltz, Ursula

Abstraction and empty process in process algebra von Baeten, Josephus C. M., Glabbeek, Rob van

Merge and termination in process algebra von Baeten, Josephus C. M., Glabbeek, Rob van

Refinement of actions and equivalence notions for concurrent systems von Glabbeek, Rob van, Goltz, Ursula

Ntyft/ntyxt rules reduced to ntree rules von Fokkink, Willem J. 1965-, Glabbeek, Rob van

What is branching time semantics and why to use it? von Glabbeek, Rob van

Modular specification of process algebras von Glabbeek, Rob van, Vaandrager, Frits 1962-

Refinement in branching time semantics von Glabbeek, Rob van

Branching time and abstraction in bisimulation semantics (extended abstract) von Glabbeek, Rob van

An interpolation theorem in equational logic von Rodenburg, P. H., Glabbeek, Rob van

Modular specifications in process algebra with curious queues von Glabbeek, Rob van, Vaandrager, Frits W.

Another look at abstraction in process algebra von Baeten, Josephus C. M., Glabbeek, Rob van

Bounded nondeterminism and the approximation induction principle in process algebra von Glabbeek, Rob van

The difference between splitting in n and n+1 von Glabbeek, Rob van

A complete axiomatization for branching bisimulation congruence of finite-state behaviours von Glabbeek, Rob van