Introduction to Process Algebra

Fokkink, Wan

doi:10.1007/978-3-662-04293-9

Cited by 218 publications

(181 citation statements)

References 162 publications

Supporting

Mentioning

166

Contrasting

Unclassified

Order By: Relevance

“…In [7], we show that the processes considered in BTA+REC can be viewed as processes that are definable over ACP [14].…”

Section: Basic Thread Algebramentioning

confidence: 99%

See 1 more Smart Citation

Machine structure oriented control code logic

Bergstra

Middelburg

2009

Acta Informatica

View full text Add to dashboard Cite

Control code is a concept that is closely related to a frequently occurring practitioner's view on what is a program: code that is capable of controlling the behaviour of some machine. We present a logical approach to explain issues concerning control codes that are independent of the details of the behaviours that are controlled. Using this approach, such issues can be explained at a very abstract level. We illustrate this among other things by means of an example about the production of a new compiler from an existing one. The approach is based on abstract machine models, called machine structures. We introduce a model of systems that provide execution environments for the executable codes of machine structures and use it to go into portability of control codes.

show abstract

“…In [7], we show that the processes considered in BTA+REC can be viewed as processes that are definable over ACP [14].…”

Section: Basic Thread Algebramentioning

confidence: 99%

“…The reason to use basic thread algebra is that it has been designed as an algebra of processes that interact with machines of the kind to which also the execution architecture belongs. It is quite awkward to describe processes of that kind using a general process algebra such as ACP [14], CCS [21] or CSP [17].…”

Section: Introductionmentioning

confidence: 99%

Machine structure oriented control code logic

Bergstra

Middelburg

2009

Acta Informatica

View full text Add to dashboard Cite

show abstract

“…The interleaving of two sentences (x <%> y) can be defined conveniently in terms of left-interleave (denoted by x %> y, and also known as the left-merge operator [Bergstra and Klop, 1985]), which expresses that the first symbol should be taken from the left-hand side operand. The algebra of communicating processes field traditionally defines interleave in terms of left-interleave (and "communication interleave") to obtain a sound and complete axiomatisation [Fokkink, 2000].…”

Section: Interleavementioning

confidence: 99%

A Programming Tutor for Haskell

Jeuring

Gerdes

Heeren

2012

Central European Functional Programming School

View full text Add to dashboard Cite

“…[BW90,FokOO,Mil89]). Below we present the transition system for the basic process language with explicit termination c, deadlock {) (which has no rules)' a prefixing operation 'a. '…”

Section: Preliminariesmentioning

confidence: 99%