Axioms for Behavioural Congruence of Single-Pass Instruction Sequences

In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on instruction sequences are paid attention to: instruction sequence congruence, structural congruence, and behavioural congruence. Sound and complete axiom systems for the first two congruences were already given in early papers on program algebra. The current paper is the first one that is concerned with an axiom system for the third congruence. The presented axiom system is especially notable for its axioms that have to do with forward jump instructions.

[1]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[4]  Jan A. Bergstra,et al.  On the Behaviours Produced by Instruction Sequences under Execution , 2011, Fundam. Informaticae.

[5]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[6]  Jan A. Bergstra,et al.  Instruction sequence processing operators , 2009, Acta Informatica.

[7]  Jan A. Bergstra,et al.  Program algebra for sequential code , 2002, J. Log. Algebraic Methods Program..

[8]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[9]  Jan A. Bergstra,et al.  Instruction Sequence Size Complexity of Parity , 2016, Fundam. Informaticae.

[10]  Jan A. Bergstra,et al.  Instruction Sequence Based Non-uniform Complexity Classes , 2014, Sci. Ann. Comput. Sci..

[11]  Jan A. Bergstra,et al.  On Instruction Sets for Boolean Registers in Program Algebra , 2016, Sci. Ann. Comput. Sci..

[12]  Jan A. Bergstra,et al.  Instruction Sequences for Computer Science , 2012, Atlantis Studies in Computing.