Geoff Barrett
Abstract
Abstract
This paper presents a fixed point theorem for the infinite traces model of CSP. Unlike any other model of CSP, there is no complete partial order over the infinite traces model whose fixed point theory agrees with the operational semantics (A. W. Roscoe, Oxford University Computing Laboratory Technical Monograph PRG-67, 1988). This arises from the introduction of unbounded non-determinism. However, the subset of pre-deterministic processes, that is those which describe the behaviour of a process on some run of its implementation, do form a subset for which the usual order is complete. By requiring that each CSP operator has a monotonic implementation which preserves pre-determinism, it is possible to show that all CSP operators have a least fixed point. In effect, it is the requirement that all operators have a methodical implementation.
- [Bar89] Barrett, G.: The Semantics of Priority and Fairness in occam.Proc. MFPSV, Lecture Notes in Computer Science, Springer-Verlag LNCS 442, 194–208 (1989).Google Scholar
- [BaG89] Barrett, G and Goldsmith, M. H.: Classifying Unbounded Nondeterminism in CSP. in Category Theory and Topology in Computer Science, OUP (1991).Google Scholar
- [Bro83] Brookes, S. D.: A Model for Communicating Sequential Processes. Oxford University Computing Laboratory D Phil Thesis, 1983. (Available as a CMU technical report.)Google Scholar
- [Jeff88] Jeffery, A.: Fairness in CSP. Programming Research Group, Oxford University. Unpublished.Google Scholar
- [OlH86] Specification-Oriented Semantics for Communicating ProcessesActa Informatica198623966Google ScholarDigital Library
- [Ros88] Roscoe, A. W.:Two Papers on CSP. Oxford University Computing Laboratory Technical Monograph PRG-67, July 1988.Google Scholar
Index Terms
- The fixed point theory of unbounded non-determinism
Recommendations
Specification, Refinement and Verification of Concurrent Systems—An Integration of Object-Z and CSP
This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of ...
Mizoguchi-Takahashi's type fixed point theorem
Recently, Eldred [A.A. Eldred, J. Anuradha, P. Veeramani, On equivalence of generalized multi-valued contactions and Nadler's fixed point theorem, J. Math. Anal. Appl. (2007) doi:10.1016/j.jmaa.2007.01.087] claimed that Nadler's [S.B. Nadler Jr., ...
Generalized (C)-conditions and related fixed point theorems
In this manuscript, the notion of C-condition [K. Suzuki, Fixed point theorems and convergence theorems for some generalized nonexpansive mappings, J. Math. Anal. Appl. 340 (2008) 1088-1095] is generalized. Some new fixed point theorems are obtained.
Comments