4 results
Rob van Glabbeek ; Bas Luttik ; Nikola Trcka.
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL-X). This relation is obtained by De Nicola & Vaandrager by translating labelled transition systems to Kripke structures, while […]
Published on December 22, 2009
Rob J. van Glabbeek ; Ursula Goltz ; Jens-Wolfhard Schicke-Uffmann.
We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be implemented as LSGA nets up to branching ST-bisimilarity […]
Published on September 17, 2013
Taolue Chen ; Wan Fokkink ; Rob van Glabbeek.
A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its concrete counterpart, in the context of the process algebra BCCS. This transformation moreover preserves omega-completeness. It is applicable to semantics at least as […]
Published on September 22, 2015
Rob van Glabbeek ; Bas Luttik ; Linda Spaninks.
We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.
Published on August 28, 2020