Polarized process algebra and program equivalence

Authors:
Jan A. Bergstra;Inge Bethke
Affiliations:
Applied Logic Group, Department of Philosophy, Utrecht University, Utrecht, The Netherlands and Programming Research Group, Informatics Institute, Faculty of Science, University of Amsterdam, Amst ...;Programming Research Group, Informatics Institute, Faculty of Science, University of Amsterdam, Amsterdam, The Netherlands
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 5
Cited 15

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Mathematical theory of domains

Mathematical theory of domains
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras

Journal of the ACM (JACM)
Axiomatizations for the Perpetual Loop in Process Algebra

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

Polarized process algebra with reactive composition

Theoretical Computer Science - Formal methods for components and objects
Thread Algebra with Multi-Level Strategies

Fundamenta Informaticae
Maurer computers for pipelined instruction processing†

Mathematical Structures in Computer Science
Maurer Computers with Single-Thread Control

Fundamenta Informaticae
Transmission Protocols for Instruction Streams

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Instruction Sequences with Dynamically Instantiated Instructions

Fundamenta Informaticae
On the operating unit size of load/store architectures†

Mathematical Structures in Computer Science
Data Linkage Dynamics with Shedding

Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
An introduction to program and thread algebra

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Model theory for process algebra

Processes, Terms and Cycles
A thread algebra with multi-level strategic interleaving

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Maurer Computers with Single-Thread Control

Fundamenta Informaticae
Thread Algebra with Multi-Level Strategies

Fundamenta Informaticae
On the Behaviours Produced by Instruction Sequences under Execution

Fundamenta Informaticae
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The basic polarized process algebra is completed yielding as a projective limit a cpo which also comprises infinite processes. It is shown that this model serves in a natural way as a semantics for several program algebras. In particular, the fully abstract model of the program algebra axioms of [2] is considered which results by working modulo behavioral congruence. This algebra is extended with a new basic instruction, named 'entry instruction' and denoted with '@'. Addition of @ allows many more equations and conditional equations to be stated. It becomes possible to find an axiomatization of program inequality. Technically this axiomatization is an infinite final algebra specification using conditional equations and auxiliary objects.