Functional units for natural numbers (2009)
Bergstra, J. A., Middelburg, C. A.
Interaction with services provided by an execution environment forms part of the behaviours exhibited by instruction sequences under execution. Mechanisms related to the kind of interaction in...
Instruction sequence processing operators (2009)
Bergstra, J. A., Middelburg, C. A.
This paper concerns instruction sequences whose execution involves the processing of instructions by an execution environment that offers a family of services and may yield a Boolean value at...
Partial Komori fields and imperative Komori fields (2009)
Bergstra, J. A., Middelburg, C. A.
This paper is concerned with the status of 1/0 and ways to deal with it. These matters are treated in the setting of Komori fields, also known as non-trivial cancellation meadows. Different...
Bergstra, J. A., Middelburg, C. A.
An inversive meadow is a commutative ring with identity equipped with a multiplicative inverse operation made total by choosing 0 as its value at 0. Previously, inversive meadows were shortly called...
Indirect jumps improve instruction sequence performance (2009)
Bergstra, J. A., Middelburg, C. A.
Instruction sequences with direct and indirect jump instructions are as expressive as instruction sequences with direct jump instructions only. We show that, in the case where the number of...
Inversive Meadows and Divisive Meadows (2009)
Bergstra, J. A., Middelburg, C. A.
An inversive meadow is a commutative ring with identity and a total multiplicative inverse operation whose value at 0 is 0. Previously, inversive meadows were shortly called meadows. In this paper,...
Instruction sequence notations with probabilistic instructions (2009)
Bergstra, J. A., Middelburg, C. A.
This paper concerns probabilistic instruction sequences. We use the term probabilistic instruction sequence for an instruction sequence that contains probabilistic instructions, i.e. instructions...
A protocol for instruction stream processing (2009)
Bergstra, J. A., Middelburg, C. A.
The behaviour produced by an instruction sequence under execution is a behaviour to be controlled by some execution environment: each step performed actuates the processing of an instruction by the...
A process calculus with finitary comprehended terms (2009)
Bergstra, J. A., Middelburg, C. A.
Meadow enriched ACP process algebras are essentially enrichments of models of the axiom system ACP that concern processes in which data are involved, the mathematical structure of data being a...
Transmission protocols for instruction streams (2009)
Bergstra, J. A., Middelburg, C. A.
Threads as considered in thread algebra model behaviours to be controlled by some execution environment: upon each action performed by a thread, a reply from its execution environment -- which takes...
Timed tuplix calculus and the Wesseling and van den Berg equation (2009)
Bergstra, J. A., Middelburg, C. A.
We formalize a cumulative interest compliant conservation requirement for pure financial products proposed by Wesseling and van den Bergh to make financial issues relating to these products amenable...
Meadow enriched ACP process algebras (2009)
Bergstra, J. A., Middelburg, C. A.
We introduce the notion of an ACP process algebra. The models of the axiom system ACP are the origin of this notion. ACP process algebras have to do with processes in which no data are involved. We...
On the expressiveness of single-pass instruction sequences (2009)
Bergstra, J.A., Middelburg, C.A.
We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under execution is considered to produce a behaviour to be controlled by some execution environment....
Thread extraction for polyadic instruction sequences (2009)
Bergstra, J.A., Middelburg, C.A.
Instruction sequences are often fragmented. An important reason for instruction sequence fragmentation is that the execution architecture at hand to execute instruction sequences sets bounds to the...
Instruction sequences for the production of processes (2008)
Bergstra, J. A., Middelburg, C. A.
Single-pass instruction sequences under execution are considered to produce behaviours to be controlled by some execution environment. Threads as considered in thread algebra model such behaviours:...
On the expressiveness of single-pass instruction sequences (2008)
Bergstra, J. A., Middelburg, C. A.
We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under execution is considered to produce a behaviour to be controlled by some execution environment....
Instruction sequences and non-uniform complexity theory (2008)
Bergstra, J. A., Middelburg, C. A.
We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of...
Data linkage dynamics with shedding (2008)
Bergstra, J. A., Middelburg, C. A.
We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage...
Data linkage algebra, data linkage dynamics, and priority rewriting (2008)
Bergstra, J. A., Middelburg, C. A.
We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple model of computation...
A Thread Calculus with Molecular Dynamics ⋆ (2008)
J. A. Bergstra, C. A. Middelburg
Abstract. In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and interaction between threads and services. In the current paper, we extend that theory with...
Process Algebra with Conditionals in the Presence of Epsilon (2008)
J. A. Bergstra, C. A. Middelburg
Abstract. In a previous paper, we presented several extensions of ACP with conditional expressions, including one with a retrospection operator on conditions to allow for looking back on conditions...
Splitting bisimulations and retrospective conditions (2008)
J. A. Bergstra, C. A. Middelburg
Abstract. We investigate conditions in the setting of the algebraic theory about processes known as ACP. We present ACP c, an extension of ACP with guarded commands, and its main models, called its...
Machine Structure Oriented Control Code Logic ⋆ (2008)
J. A. Bergstra, C. A. Middelburg
Abstract. 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...
IOS Press Located Actions in Process Algebra with Timing (2008)
J. A. Bergstra, C. A. Middelburg
Abstract. We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to...
Preferential Choice and Coordination Conditions (2008)
J. A. Bergstra, C. A. Middelburg
Abstract. We present a process algebra with conditional expressions of which the conditions concern the enabledness of actions in the context in which a process is placed. With those conditions, it...
Thread algebra for poly-threading (2008)
Bergstra, J. A., Middelburg, C. A.
Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs are often...
Thread extraction for polyadic instruction sequences (2008)
Bergstra, J. A., Middelburg, C. A.
Instruction sequences are often fragmented. An important reason for instruction sequence fragmentation is that the execution architecture at hand to execute instruction sequences sets bounds to the...
Programming an interpreter using molecular dynamics (2008)
Bergstra, J. A., Middelburg, C. A.
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation developed in the setting...
Instruction sequences and non-uniform complexity theory (2008)
Bergstra, J.A., Middelburg, C.A.
We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of...
Thread algebra for poly-threading (2008)
Bergstra, J.A., Middelburg, C.A.
Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs are often...
Instruction sequences for the production of processes (2008)
Bergstra, J.A., Middelburg, C.A.
Single-pass instruction sequences under execution are considered to produce behaviours to be controlled by some execution environment. Threads as considered in thread algebra model such behaviours:...
Data linkage algebra, data linkage dynamics, and priority rewriting (2008)
Bergstra, J.A., Middelburg, C.A.
We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple model of computation...
Data linkage dynamics with shedding (2008)
Bergstra, J.A., Middelburg, C.A.
We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage...
Program algebra with a jump-shift instruction (2008)
Bergstra, J.A., Middelburg, C.A.
We study sequential programs that are instruction sequences with jump-shift instructions in the setting of PGA (ProGram Algebra). Jump-shift instructions preceding a jump instruction increase the...
Parallel processes with implicit computational capital (2008)
Bergstra, J.A., Middelburg, C.A.
We propose a process algebra which is concerned with processes that have an implicit computational capital. This process algebra is intended to be helpful when designing computer-based systems of...
Maurer computers for pipelined instruction processing (2008)
Bergstra, J.A., Middelburg, C.A.
We model micro-architectures with non-pipelined instruction processing and pipelined instruction processing using Maurer machines, basic thread algebra and program algebra. We show that stored...
Simulating Turing machines on Maurer machines (2008)
Bergstra, J.A., Middelburg, C.A.
In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the current paper, we investigate the connections between Turing machines and Maurer machines with the...
Distributed strategic interleaving with load balancing (2008)
Bergstra, J.A., Middelburg, C.A.
In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and interaction of threads with services. In the current paper, we assume that the threads and services are...
Program algebra with a jump-shift instruction (2007)
Bergstra, J. A., Middelburg, C. A.
We study sequential programs that are instruction sequences with jump-shift instructions in the setting of PGA (ProGram Algebra). Jump-shift instructions preceding a jump instruction increase the...
Instruction sequences with dynamically instantiated instructions (2007)
Bergstra, J. A., Middelburg, C. A.
We study sequential programs that are instruction sequences with dynamically instantiated instructions. We define the meaning of such programs in two different ways. In either case, we give a...
VVSL Specification of a Transaction-oriented Access Handler (2007)
Middelburg Dept Of, C. A. Middelburg
VVSL is a mathematically well-defined VDM-like specification language with features for (1) modular structuring and (2) specifying operations which interfere through a partially shared state. This...
Real Time Process Algebra with Time-dependent Conditions (2007)
We extend the main real time version of ACP presented in [6] with conditionals in which the condition depends on time. This extension facilitates flexible dependence of process behaviour on...
Real Time Process Algebra with Time-dependent Conditions (2007)
We extend the main real time version of ACP presented in [6] with conditionals in which the condition depends on time. This extension facilitates exible dependence of process behaviour on...
Discrete-time Process Algebra and the Semantics of SDL (2007)
J. A. Bergstra, C. A. Middelburg, Y. S. Usenko
development of high integrity computing systems, (ii) highest level post-graduate university teaching, (iii) international level research, and, through the above, (iv) use of as sophisticated...
Operational Conservativity with Binding Terms (2007)
In a previous paper the approach to structural operational semantics using transition system specications (TSSs) was extended to deal with variable binding operators. It was shown that in this...
Operational Conservativity with Binding Terms (2007)
Middelburg Computing Science, C. A. Middelburg
In a previous paper the approach to structural operational semantics using transition system speci cations (TSSs) was extended to deal with variable binding operators. It was shown that in this...
Instruction sequences with indirect jumps (2007)
Bergstra, J. A., Middelburg, C. A.
We study sequential programs that are instruction sequences with direct and indirect jump instructions. The intuition is that indirect jump instructions are jump instructions where the position of...
An interface group for process components (2007)
Bergstra, J. A., Middelburg, C. A.
We take a process component as a pair of an interface and a behaviour. We study the composition of interacting process components in the setting of process algebra. We formalize the interfaces of...
Machine structure oriented control code logic (2007)
Bergstra, J. A., Middelburg, C. A.
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...
On the operating unit size of load/store architectures (2007)
Bergstra, J. A., Middelburg, C. A.
We introduce a strict version of the concept of a load/store instruction set architecture in the setting of Maurer machines. We take the view that transformations on the states of a Maurer machine...
A thread calculus with molecular dynamics (2007)
Bergstra, J. A., Middelburg, C. A.
We present a theory of threads, interleaving of threads, and interaction between threads and services with features of molecular dynamics, a model of computation that bears on computations in which...
Instruction Sequences with Indirect Jumps (2007)
J.A. Bergstra, C.A. Middelburg
We study sequential programs that are instruction sequences with direct and indirect jump instructions. The intuition is that indirect jump instructions are jump instructions where the position of...
Programming an Interpreter Using Molecular Dynamics (2007)
J.A. Bergstra, C.A. Middelburg
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation developed in the setting...
An Interface Group for Process Components ⋆ (2007)
J. A. Bergstra, C. A. Middelburg, J. A. Bergstra, C. A. Middelburg, J. A. Bergstra, C. A. Middelburg
Abstract. We take a process component as a pair of an interface and a behaviour. We study the composition of interacting process components in the setting of process algebra. We formalize the...
Instruction sequences with indirect jumps (2007)
J. A. Bergstra, J. A. Bergstra, J. A. Bergstra, C. A. Middelburg, C. A. Middelburg, C. A. Middelburg
Abstract. We study sequential programs that are instruction sequences with direct and indirect jump instructions. The intuition is that indirect jump instructions are jump instructions where the...
On the Operating Unit Size of Load/Store Arc hitectures, Programming Research Group (2007)
J. A. Bergstra, C. A. Middelburg
Abstract. We introduce a strict version of the concept of a load/store instruction set architecture in the setting of Maurer machines. We take the view that transformations on the states of a Maurer...
Programming an interpreter using molecular dynamics (2007)
Bergstra, J.A., Middelburg, C.A.
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation developed in the setting...
Continuity Controlled Hybrid Automata (2006)
J. A. Bergstra, C. A. Middelburg
Abstract. We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of...
Thread Algebra for Strategic Interleaving (2005)
Bergstra, J.A., Middelburg, C.A.
We present an extension of the polarized process algebra BPPA, an algebraic theory about sequential program behaviors. The extension is called thread algebra and is proposed as a tool for the...
Maurer Computers with Single-Thread Control (2005)
Bergstra, J.A., Middelburg, C.A.
We present the development of a theory of stored threads and their execution. The work builds upon Maurer’s theory of computer instructions and the thread algebra of Bergstra et al. The theory...
Preferential Choice and Coordination Conditions (2005)
Bergstra, J.A., Middelburg, C.A.
We present a process algebra with conditional expressions of which the conditions concern the enabledness of actions in the context in which a process is placed. With those conditions, it becomes...
Process Algebra with Conditionals in the Presence of Epsilon (2005)
Bergstra, J.A., Middelburg, C.A.
In a previous paper, we presented several extensions of ACP with conditional expressions, including one with a retrospection operator on conditions to allow for looking back on conditions under which...
Process algebra for hybrid systems (2005)
Bergstra, J.A., Middelburg, C.A.
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, Springer,Berlin, 2002,...
Strong Splitting Bisimulation Equivalence (2005)
Bergstra, J.A., Middelburg, C.A.
We present ACPc, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition...
A thread algebra with multi-level strategic interleaving (2005)
J. A. Bergstra, C. A. Middelburg
Abstract. In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on...
Strong splitting bisimulation equivalence (2005)
J. A. Bergstra, C. A. Middelburg
Abstract. We present ACP c, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for...
A thread algebra with multi-level strategic interleaving (2005)
J. A. Bergstra, C. A. Middelburg
Abstract. In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on...
A thread algebra with multi-level strategic interleaving (2005)
J. A. Bergstra, C. A. Middelburg
Abstract. In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on...
A thread algebra with multi-level strategic interleaving (2005)
J. A. Bergstra, C. A. Middelburg
Abstract In a previous paper, we developed an algebraic theory about threads and a form of concurrency where some deterministic interleaving strategy determines how threads that exist concurrently...
Strong splitting bisimulation equivalence (2005)
J. A. Bergstra, C. A. Middelburg
Abstract. We present ACP c, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for...
Continuity controlled Hybrid Automata (2004)
Bergstra, J.A., Middelburg, C.A.
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid...
Process algebra for Hybrid systems (2004)
Bergstra, J.A., Middelburg, C.A.
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, Springer, Chap. 4,...
Continuity Controlled Hybrid Automata (2004)
Bergstra, J.A., Middelburg, C.A.
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid...
Model Theory for Process Algebra (2004)
Bergstra, J.A., Middelburg, C.A.
We present a first-order extension of the algebraic theory about processes known as ACP and its main models. Useful predicates on processes, such as deadlock freedom and determinism, can be added to...
Thread Algebra with Multi-Level Strategic Interleaving (2004)
Bergstra, J.A., Middelburg, C.A.
In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on thread...
Located Actions in Process Algebra with Timing (2004)
Bergstra, J.A., Middelburg, C.A.
We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially...
Model Theory For Process Algebra (2004)
J. A. Bergstra, C. A. Middelburg
Abstract. We present a first-order extension of the algebraic theory about processes known as ACP and its main models. Useful predicates on processes, such as deadlock freedom and determinism, can be...
Process algebra for hybrid systems (2003)
J. A. Bergstra, C. A. Middelburg
Abstract. 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, Springer,...
J. A. Bergstra, C. A. Middelburg
Abstract. We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] to...
A new equivalence for processes with timing. With an application to protocol verification (2002)
Baeten, J.C.M., Middelburg, C.A., Reniers, M.A.
We propose a variant of the version of branching bisimilation equivalence for processes with discrete relative timing from Baeten, Bergstra, and Reniers. We show that this new equivalence allows for...
Process algebra with nonstandard timing (2002)
The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebra from the framework of process algebras with timing presented by...
Revisiting timing in process algebra (2002)
We shortly review the framework of process algebras with timing presented by Baeten and Middelburg [Handbook of Process Algebra, Elsevier, 2001, Chapter 10]. In order to cover processes that are...
C. A. Middelburg, M. A. Reniers
Abstract. We propose a variant of the version of branching bisimulation equivalence for processes with discrete relative timing from Baeten, Bergstra, and Reniers. We show that this new equivalence...
Operational conservativity with binding terms (2001)
In a previous paper the approach to structural operational semantics using transition system specifications (TSSs) was extended to deal with variable binding operators. It was shown that in this...
Process algebra with nonstandard timing (2001)
Abstract. The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with timing...
Variable binding operators in transition system specifications (2001)
In this paper the approach to structural operational semantics (SOS) using transition system specications (TSSs) is extended to deal with variable binding operators and many-sortedness. Bisimulation...
Variable Binding Operators in Transition System Specifications (2001)
In this paper the approach to structural operational semantics (SOS) using transition system specications (TSSs) is extended to deal with variable binding operators and many-sortedness....
Variable binding operators in transition system specifications (2000)
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-sortedness. Verhoef's...
Real time process algebra with time-dependent conditions (2000)
Baeten, J.C.M., Middelburg, C.A.
We extend the main real time version of ACP presented in [6] with conditionals in which the condition depends on time. This extension facilitates flexible dependence of proccess behaviour on...
Process Algebra with Timing: Real Time and Discrete Time (2000)
C. A. Middelburg, Eindhoven The Netherlands
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 , featuring urgent...
Process Algebra with Timing: Real Time and Discrete Time (2000)
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 , featuring urgent...
Process Algebra with Timing: Real Time and Discrete Time (2000)
C. A. Middelburg, Eindhoven The Netherlands
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 , featuring urgent...
Process algebra with timing: Real time and discrete time (1999)
Baeten, J.C.M., Middelburg, C.A.
We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint is a new real time version with absolute timing, called ACPsat , featuring urgent...
Discrete Time Process Algebra and the Semantics of SDL (1998)
Issn -x, J. A. Bergstra, J. A. Bergstra, C. A. Middelburg, C. A. Middelburg, Y. S. Usenko, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Discrete-time Process Algebra and the Semantics of SDL (1998)
Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, J.A. Bergstra, J. A. Bergstra, C. A. Middelburg, ...
We present an extension of discrete time process algebra with relative timing where recursion, propositional signals and conditions, a counting process creation operator, and the state operator are...
Truth of Duration Calculus Formulae in Timed Frames (1998)
. Duration calculus is a logical formalism designed for expressing and refining real-time requirements for systems. Timed frames are essentially transition systems meant for modeling the...
Discrete Time Process Algebra and the Semantics of SDL (1998)
J.A. Bergstra, C.A. Middelburg, Y.S. Usenko
We present an extension of discrete time process algebra with relative timing where recursion, propositional signals and conditions, a counting process creation operator, and the state operator are...
Discrete Time Network Algebra for a Semantic Foundation of SDL (1997)
J.A. Bergstra, C. A. Middelburg, R. Soricut
We propose a process algebra model of asynchronous dataflow networks as a semantic foundation for the specification language SDL. The model, which extends a model of network algebra, is close to the...
Network Algebra for Asynchronous Dataflow (1997)
J.A. Bergstra, C. A. Middelburg, Gh. Stefanescu
Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory of networks, called BNA (Basic Network Algebra), is presented....
Truth of duration calculus formulae in timed frames (1996)
Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, C. A. Middelburg, C. A. Middelburg
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Algebra of Timed Frames (1996)
J.A. Bergstra, W.J. Fokkink, C. A. Middelburg
Timed frames are introduced as objects that can form a basis of a model theory for discrete time process algebra. An algebraic setting for timed frames is proposed and results concerning its...
Algebra of Timed Frames (1996)
Bergstra Fokkink, J. A. Bergstra, C. A. Middelburg
Timed frames are introduced as objects that can form a basis of a model theory for discrete time process algebra. An algebraic setting for timed frames is proposed and results concerning its...
Truth of duration calculus formulae in timed frames (1996)
Issn -x, C. A. Middelburg, C. A. Middelburg
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Algebra of Timed Frames (1995)
Bergstra, J.A., Fokkink, W.J., Middelburg, C.A.
Timed frames are introduced as objects that can form a basis of a model theory for discrete time process algebra. An algebraic setting for timed frames is proposed and results concerning its...
Process Algebra Semantics of φSDL (1995)
Bergstra, J.A., Middelburg, C.A.
A new semantics of an interesting subset of the specification language SDL is given by a translation to a discrete-time variant of process algebra in the form of ACP extended with data as in μCRL....
Network Algebra for Synchronous and Asynchronous Dataflow (1995)
J.A. Bergstra, C. A. Middelburg, Gh. Stefanescu
Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory, called BNA (Basic Network Algebra), is presented. BNA, which...
Process Algebra Semantics of phiSDL (1995)
J.A. Bergstra, C.A. Middelburg
A new semantics of an interesting subset of the specification language SDL is given by a translation to a discrete-time variant of process algebra in the form of ACP extended with data as in ¯CRL....
On the Semantics of Modular Structuring Facilities in Specification Languages (1994)
A mathematical framework for the semantics of modular structuring facilities in specification languages is described informally and in broad outline. Its use for a semantics of the modular...
A Simple Language for Expressing Properties of Telecommunication Services and Features (1994)
Middelburg Dept Of, C. A. Middelburg
This paper reports on a quest for a language for expressing properties of telecommunication services and features, which may play a part in feature interaction detection. A language is sought with a...
A Typed Logic of Partial Functions Reconstructed Classically (1994)
Jones And Middelburg, C. B. Jones, C. A. Middelburg
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 method VDM. If...
On the Semantics of Modular Structuring Facilities in Specification Languages (1994)
A mathematical framework for the semantics of modular structuring facilities in specification languages is described informally and in broad outline. Its use for a semantics of the modular...
A Typed Logic of Partial Functions Reconstructed Classically (1994)
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 method VDM. If...
A Typed Logic of Partial Functions Reconstructed Classically (1993)
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 method VDM. If...
Specification of Interfering Programs based on Inter-conditions (1992)
Flat VVSL is an extension of a VDM specification language wherein operations, which interfere through a shared state, can be specified in a VDM-like style with the use of inter-conditions in addition...
Modular Structuring of VDM Specifications in VVSL (1992)
VVSL is a language for writing modularly structured VDM specifications. Its modularization mechanism permits two modules to have parts of their state in common, including hidden parts. Firstly, this...
Experiences with Combining Formalisms in VVSL (1991)
This paper primarily reports on semantic aspects of how a formal specification of the PCTE interfaces has been achieved in a situation where only a combination of existing formalisms could meet the...
Timed tuplix calculus and the Wesseling and van den Bergh equation
J. A. Bergstra, C. A. Middelburg
We formalize a cumulative interest compliant conservation requirement for pure financial products proposed by Wesseling and van den Bergh to make financial issues relating to these products amenable...