34 citations · 85 across the 19 of their papers we have counts for
19 papers
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…
Model Properties for Efficient Synthesis of Nonblocking Modular Supervisors
Martijn Goorden, Joanna van de Mortel-Fronczak, Michel Reniers +3
Supervisory control theory provides means to synthesize supervisors for systems with discrete-event behavior from models of the uncontrolled plant and of the control requirements.…
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…