• Publications
  • Influence
Syntax and semantics of CRL
TLDR
A simple specification language based on CRL (Common Representation Language)and therefore called μCRL (micro CRL) is proposed. Expand
  • 383
  • 45
Structured Operational Semantics and Bisimulation as a Congruence
TLDR
In this paper the question is considered in which cases a transition system specification in Plotkin style has ‘good’ properties and deserves the predicate ‘structured’. Expand
  • 412
  • 38
  • PDF
Transition System Specifications with Negative Premises
  • J. Groote
  • Business, Mathematics
  • Theor. Comput. Sci.
  • 27 September 1993
TLDR
We present a general method, based on the stratification technique in logic programming, to prove consistency of a set of rules and we show how a specific transition relation can be associated with a TSS in a natural way. Expand
  • 244
  • 18
Modeling and Analysis of Communicating Systems
TLDR
We introduce behavioral modeling, a rigorous approach to behavioral specification and verification of concurrent and distributed systems. Expand
  • 159
  • 13
  • PDF
The Formal Specification Language mCRL2
TLDR
We introduce mCRL2, a specification language that can be used to specify and analyse the behaviour of distributed systems. Expand
  • 179
  • 12
  • PDF
µ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
The meaning of negative premises in transition system specifications
TLDR
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). Expand
  • 109
  • 10
  • PDF
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
TLDR
This paper presents an efficient algorithm for the Relational Coarsest Partition with Stuttering problem (RCPS). Expand
  • 233
  • 9
An Overview of the mCRL2 Toolset and Its Recent Advances
TLDR
The analysis of complex distributed systems requires dedicated software tools. Expand
  • 150
  • 9
  • PDF
Parameterised boolean equation systems
TLDR
We present techniques similar to GauB elimination as outlined in [Mader, Lecture Notes in Computer Science, Vol. 1019, 1995, pp. 72-88] that allow to solve each equation system provided a single equation can be solved. Expand
  • 80
  • 9
  • PDF