Deriving non-determinism from conjunction and disjunction

Authors:
Naijun Zhan;Mila Majster-Cederbaum
Affiliations:
Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China;Lehrstuhl für Praktische Informatik II, Fakultät für Mathematik und Informatik, Mannheim Universität, Mannheim, Deutschland
Venue:
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Year:
2005

Citing 7
Cited 1

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
A logic for the description of nondeterministic programs and their properties

Information and Control
Termination, deadlock, and divergence

Journal of the ACM (JACM)
Completeness of Kozen's axiomatisation of the propositional &mgr;-calculus

Information and Computation
Modal and temporal properties of processes

Modal and temporal properties of processes
Communication and Concurrency

Communication and Concurrency

Connection between logical and algebraic approaches to concurrent systems†

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that the non-deterministic choice “+”, which was proposed as a primitive operator in Synchronization Tree Logic (STL for short) can be defined essentially by conjunction and disjunction in the μ-calculus (μM for short). This is obtained by extending the μ-calculus with the non-deterministic choice “+” (denoted by μM+) and then showing that μM+ can be translated into μM. Furthermore, we also prove that STL can be encoded into μM+ and therefore into μM.