A Mathematical Game Semantics of Concurrency and Nondeterminism

نویسنده

  • Julian Gutierrez
چکیده

Concurrent games as event structures form a partial order model of concurrency where concurrent behaviour is captured by nondeterministic concurrent strategies—a class of maps of event structures. Extended with winning conditions, the model is also able to give semantics to logics of various kinds. An interesting subclass of this game model is the one considering deterministic strategies only, where the induced model of strategies can be fully characterised by closure operators. The model based on closure operators exposes many interesting mathematical properties and allows one to define connections with many other semantic models where closure operators are also used. However, such a closure operator semantics has not been investigated in the more general nondeterministic case. Here we do so, and show that some nondeterministic concurrent strategies can be characterised by a new definition of nondeterministic closure operators which agrees with the standard game model for event structures and with its extension with winning conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fully Abstract Game Semantics for Finite Nondeterminism

A game semantics of finite nondeterminism is proposed. In this model, a strategy may make a choice between different moves in a given situation; moreover, strategies carry extra information about their possible divergent behaviour. A Cartesian closed category is built and a model of a simple, higher-order nondeterministic imperative language is given. This model is shown to be fully abstract, w...

متن کامل

CC Programs with both In- and Non-determinism: A Concurrent Semantics

We present a concurrent semantics for concurrent constraint (cc) programming framework with both (\committed choice") indeterminism and (\backtracking") nondeterminism. The semantics extends the previous semantics for Indeterminate cc by (1) allowing each state to contain di erent or-parallel components and (2) splitting the concurrency relation into two to distinguish between andand or-concurr...

متن کامل

Concurrency and Concurrent Constraint Programming

The intent of this paper is to provide the basic ideas and the possible alternatives underlying the task of giving a semantics to a concurrent system/language, and to describe a particular approach which makes some speciic choices in order to give a semantics to the class of CC languages. In particular, we will discuss how to handle the issues of concurrency and nondeterminism, and we will exam...

متن کامل

Process Algebra Having Inherent Choice : Revised Semantics for Concurrent Systems 1

Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel composition introduces resolvable nondeterminism, i.e., nondeterminism that will be resolved in later design phases or by the operating system. Sometimes it is also important to express inherent nondeterminism for equa...

متن کامل

Probability and Nondeterminism in Operational Models of Concurrency

We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our survey is carried out from the perspective of probabilistic automata, a model originally developed for the analysis of randomized distributed algorithms.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015