Proposition Algebra with Projective Limits (2008)
Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a proposition, atomic propositions may yield different...
Semantics and Applications of Process and Program Algebra (2008)
Vu Thuy Duong, Academisch Proefschrift, Thuy Duong Vu, Dr. A. Ponse
ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam, op gezag van de Rector Magnificus prof. dr. J.W. Zwemmer ten overstaan van een door het college voor promoties ingestelde...
We introduce a calculus for tuplices, which are expressions that generalize matrices and vectors. Tuplices have an underlying data type for quantities that are taken from a zero-totalized field. We...
An instruction sequence semigroup with repeaters (2008)
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction was designed to represent infinite sequences of primitive instructions as finite, linear programs....
A generic basis theorem for cancellation meadows (2008)
Let Q_0 denote the rational numbers expanded to a “meadow'', that is, after taking its zero-totalized form (0^{-1}=0) as the preferred interpretation. In this paper we consider “cancellation...
A meadow is a zero totalised field (0^{-1}=0), and a cancellation meadow is a meadow without proper zero divisors. In this paper we consider differential meadows, i.e., meadows equipped with...
Proposition algebra with projective limits (2008)
Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a proposition, atomic propositions may yield different...
Risk assessment for one-counter threads (2008)
Threads as contained in a thread algebra are used for the modeling of sequential program behavior. A thread that may use a counter to control its execution is called a ‘one-counter thread’. In...
We introduce a calculus for tuplices, which are expressions that generalize matrices and vectors. Tuplices have an underlying data type for quantities that are taken from a zero-totalized field. We...
Bergstra, J. A., Ponse, A., Van Der Zwaag, M. B.
We introduce a calculus for tuplices, which are expressions that generalize matrices and vectors. Tuplices have an underlying data type for quantities that are taken from a zero-totalized field. We...
Branching Time and Orthogonal Bisimulation Equivalence (2007)
J. A. Bergstra, A. Ponse, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Decision problems for pushdown threads (2007)
Bergstra, J.A., Bethke, I., Ponse, A.
Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, and a thread using a...
Execution architectures for program algebra (2007)
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purpose of explanation...
Date of the public defence: Members of the Thesis Committee: (2007)
Dr. A. Ponse, Dr. R. G. Belleman, Portegies Zwart
At the end of 2006 NVIDIA introduced a new generation of graphical processing units (GPUs) (the so called G80 architecture). These GPUs are more powerful than any of the GPUs released before; they...
Program Algebra and Thread Algebra (2006)
Jan A. Bergstra, Inge Bethke, Alban Ponse, I. Bethke, A. Ponse
These lecture notes comprise slightly abbreviated versions of a number of papers on program algebra and thread algebra. Program algebra in the form of PGA, an algebra of imperative programs dates...
A Bypass of Cohen’s Impossibility Result (2005)
Detecting illegal resource access in the setting of grid computing is similar to the problem of virus detection as put forward by Fred Cohen in 1984. We discuss Cohen’s impossibility result on...
Title: A Projection and Its Implementation of A Ruby Subset to Program Algebra (2005)
Ran Huo, Qiong He, Qiong He, Ran Huo, Dr. A Ponse
ii Ruby is a powerful and open-source object-oriented (OO) programming language. It has a very clear and lightweight syntax, making it attractive to work with. The object of this thesis is to define...
Execution Architectures for Program Algebra (2004)
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purpose of explanation...
Branching time and orthogonal bisimulation equivalence (2003)
We propose a refinement of branching bisimulation equivalence that we call orthogonal bisimulation equivalence. Typically, internal activity (the performance of τ-steps) may be compressed, but not...
Combining programs and state machines (2002)
State machines consume and process actions complementary to programs issuing actions. State machines maintain a state and reply with a boolean response to each action in their interface. As state...
Process algebra and conditional composition (2001)
We discern three non-classical truth values, and define a five-valued propositional logic. We combine this logic with process algebra via conditional composition (i.e., if-then-else-). In particular,...
Register-Machine Based Processes (2001)
study extensions of the process algebra axiom system ACP with two recursive operations: the binary Kleene star *, which is defined by x*y = x(x*y)+ y, and the push-down operation $, defined by x$y =...
Linearization in parallel pCRL (2001)
J. F. Groote, A. Ponse, Y. S. Usenko, Issn -x, Jan Friso Groote, Alban Ponse, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Branching Time and Orthogonal Bisimulation Equivalence (2000)
J. A. Bergstra, A. Ponse, Issn -x, Jan A. Bergstra, Alban Ponse, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Linearization in Parallel pCRL (2000)
J. F. Groote, A. Ponse, Y. S. Usenko, Mathematisch Centrum (smc, The Dutch Foundation, Jan Friso Groote, ...
We describe a linearization algorithm for parallel pCRL processes similar to the one implemented in the linearizer of the CRL Toolset. This algorithm finds its roots in formal language theory: the...
Data Flow Networks in Java (2000)
J.A. Bergstra, I. Bethke, A. Ponse
A survey of examples is produced highlighting the various features and possibilities with pipes and sockets in Java. An implementation of dataow networks is presented and a realization of the...
Kleene’s three-valued logic and process algebra (1998)
We propose a combination of Kleene’s three-valued logic and ACP process algebra via the guarded command construct. We present an operational semantics in SOS-style, and a completeness result.
Bochvar-McCarthy logic and process algebra (1998)
We propose a combination of Bochvar's strict three-valued logic, McCarthy's sequential three-valued logic, and process algebra via the conditional guard construct. This combination entails the...
Process algebra with combinators (1994)
Bergstra, J.A., Bethke, I., Ponse, A.
We introduce typed combinatory process algebra, a system combining process Mgebra with types and combinators. We describe its syntax and semantics, and by way of example, verify within this framework...
Process Algebra with Backtracking (1994)
. An extension of process algebra for modelling processes with backtracking is introduced. This extension is semantically based on processes that transform data because, in our view, backtracking is...
Process Algebra with Iteration and Nesting (1994)
Bergstra, J. A., Bethke, I., Ponse, A.
We introduce iteration in process algebra by means of (the original, binary version of) Kleene's star operation: x*y is the process that chooses between x and y, and upon termination of x has this...