An Unbounded Nondeterministic Model for CSP-like Languages | Zendy

Luming Lai | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Unbounded Nondeterministic Model for CSP-like Languages

Author(s) -

Luming Lai

Publication year - 1998

Publication title -

electronic workshops in computing

Language(s) - English

Resource type - Conference proceedings

ISSN - 1477-9358

DOI - 10.14236/ewic/fm1998.8

Subject(s) - nondeterministic algorithm , computer science , programming language , expressive power , denotational semantics , semantics (computer science) , process calculus , set (abstract data type) , theoretical computer science , operational semantics

The main contribution of this paper is the introduction of unbounded nondeterminism into CSP-like languages with specification, which increases the expressive power of the specification language. This is achieved by extending the finite message set of such mixed languages to an infinite one. A denotational semantics and a refinement order are defined for such a language and the CSP constructors are proved to be monotone on the specification space and continuous on the process space, which are needed for a simple treatment of iterations on both spaces of the mixed CSP-like language.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research