34 citations · 85 across the 19 of their papers we have counts for
12 papers · 1 filter
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
Luca Aceto, Valentina Castiglioni, Wan Fokkink +2
Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS extended with the binary left and communication merge operators. Moller proved th…
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
Clemens Grabmayer, Wan Fokkink
Robin Milner (1984) gave a sound proof system for bisimilarity of regular expressions interpreted as processes: Basic Process Algebra with unary Kleene star iteration, deadlock 0,…
Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence
Wan Fokkink, Rob van Glabbeek, Bas Luttik
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 formulas. Th…
Reliable Restricted Process Theory
Fatemeh Ghassemi, Wan Fokkink
Malfunctions of a mobile ad hoc network (MANET) protocol caused by a conceptual mistake in the protocol design, rather than unreliable communication, can often be detected only by…
Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity
Wan Fokkink, Rob van Glabbeek
Earlier we presented a method to decompose modal formulas for processes with the internal action , and congruence formats for branching and -bisimilarity were derived on the…
On the Axiomatizability of Impossible Futures
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 proc…
Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics
Maciej Gazda, Wan Fokkink
One of the basic sanity properties of a behavioural semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addr…
Modal Logic and the Approximation Induction Principle
Maciej Gazda, Wan Fokkink
We prove a compactness theorem in the context of Hennessy-Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Princ…
On Finite Bases for Weak Semantics: Failures versus Impossible Futures
Taolue Chen, Wan Fokkink, Rob van Glabbeek
We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results re…
A Finite Equational Base for CCS with Left Merge and Communication Merge
Luca Aceto, Wan Fokkink, Anna Ingolfsdottir +1
Using the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and -complete set of valid equations) for the fragment of CCS witho…
Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy's Merge
Luca Aceto, Wan Fokkink, Anna Ingolfsdottir +1
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an au…
Precongruence Formats for Decorated Trace Semantics
B. Bloom, W. J. Fokkink, R. J. van Glabbeek
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats o…