• Publications
  • Influence
Introduction to Process Algebra
  • W. Fokkink
  • Mathematics, Computer Science
  • Texts in Theoretical Computer Science. An EATCS…
  • 23 December 1999
TLDR
Automated and semi-automated manipulation of so-called labelled transition systems has become an important means in discovering flaws in software and hardware systems . Expand
  • 391
  • 31
  • PDF
Structural Operational Semantics
  • 108
  • 21
µCRL: A Toolset for Analysing Algebraic Specifications
TLDR
µCRL [13] is a language for specifying and verifying distributed systems in a process-algebraic fashion. Expand
  • 182
  • 10
  • PDF
A Conservative Look at Operational Semantics with Variable Binding
TLDR
We set up a formal framework to describe transition system specifications in the style of Plotkin. Expand
  • 64
  • 8
  • PDF
A Relation Between Partitions and the Number of Divisors
Since the partitions 1 + 2 + 4 and 7 contain an odd number of summands, they are called odd partitions, whereas the other three partitions are called even. Add the smallest numbers of the oddExpand
  • 19
  • 8
  • PDF
Analyzing a chi model of a turntable system using Spin, CADP and Uppaal
TLDR
We compare the input formalisms, the expressiveness of the temporal logics, and the algorithmic techniques for model checking that are used in those tools. Expand
  • 53
  • 6
  • PDF
Lazy rewriting on eager machinery
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, redundant rewrite steps are avoided, and the termination behavior of a term-rewriting system can beExpand
  • 42
  • 6
  • PDF
Precongruence formats for decorated trace semantics
TLDR
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labeled transition systems, and formats of transition system specifications using Plotkin's structural approach. Expand
  • 73
  • 5
  • PDF
Rooted Branching Bisimulation as a Congruence
  • W. Fokkink
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • 1 February 2000
TLDR
This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. Expand
  • 52
  • 5
  • PDF
A Complete Equational Axiomatization for Prefix Iteration
  • W. Fokkink
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 23 December 1994
TLDR
We present a finite equational axiomatization for MPA*δ, which is a subalgebra of BPAδ equivalent to Milner's basic CCS. Expand
  • 43
  • 5
  • PDF
...
1
2
3
4
5
...