[BOEK][B] Process algebra with timing

JCM Baeten, CA Middelburg - 2013 - books.google.com
This book is concerned with a number of theories that can be used for describ ing and
analyzing systems of interacting components in case it is desirable or necessary to regard their …

Process algebra for hybrid systems

JA Bergstra, CA Middelburg - theoretical computer science, 2005 - Elsevier
We propose a process algebra obtained by extending a combination of the process algebra
with continuous relative timing from Baeten and Middelburg (Process Algebra with Timing, …

A typed logic of partial functions reconstructed classically

CB Jones, CA Middelburg - Acta informatica, 1994 - Springer
This paper gives a comprehensive description of a typed version of the logic known as LPF.
This logic is basic to formal specification and verified design in the software development …

Thread algebra for strategic interleaving

JA Bergstra, CA Middelburg - Formal Aspects of Computing, 2007 - Springer
We take a thread as the behavior of a sequential deterministic program under execution
and multi-threading as the form of concurrency provided by contemporary programming …

[HTML][HTML] Inversive meadows and divisive meadows

JA Bergstra, CA Middelburg - Journal of Applied Logic, 2011 - Elsevier
Inversive meadows are commutative rings with a multiplicative identity element and a total
multiplicative inverse operation satisfying 0 −1 =0. Divisive meadows are inversive meadows …

Instruction sequence processing operators

JA Bergstra, CA Middelburg - Acta Informatica, 2012 - Springer
Instruction sequence is a key concept in practice, but it has as yet not come prominently into
the picture in theoretical circles. This paper concerns instruction sequences, the behaviours …

Process algebra with timing: real time and discrete time

JCM Baeten, CA Middelburg - Handbook of process algebra, 2001 - Elsevier
We present real time and discrete time versions of ACP with absolute timing and relative
timing. The starting-point is a new real time version with absolute timing, called ACP sat , …

[HTML][HTML] Transformation of fractions into simple fractions in divisive meadows

JA Bergstra, CA Middelburg - Journal of Applied Logic, 2016 - Elsevier
Meadows are alternatives for fields with a purely equational axiomatization. At the basis of
meadows lies the decision to make the multiplicative inverse operation total by imposing that …

A survey of paraconsistent logics

CA Middelburg - arXiv preprint arXiv:1103.4324, 2011 - arxiv.org
A survey of paraconsistent logics that are prominent representatives of the different
approaches that have been followed to develop paraconsistent logics is provided. The …

Variable binding operators in transition system specifications

CA Middelburg - The Journal of Logic and Algebraic Programming, 2001 - Elsevier
In this paper the approach to structural operational semantics (SOS) using transition system
specifications (TSSs) is extended to deal with variable binding operators and many-…