Results 1 
6 of
6
Chu spaces and their interpretation as concurrent objects
, 2005
"... A Chu space is a binary relation =  from a set A to an antiset X defined as a set which transforms via converse functions. Chu spaces admit a great many interpretations by virtue of realizing all small concrete categories and most large ones arising in mathematical and computational practice. Of pa ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
A Chu space is a binary relation =  from a set A to an antiset X defined as a set which transforms via converse functions. Chu spaces admit a great many interpretations by virtue of realizing all small concrete categories and most large ones arising in mathematical and computational practice. Of particular interest for computer science is their interpretation as computational processes, which takes A to be a schedule of events distributed in time, X to be an automaton of states forming an information system in the sense of Scott, and the pairs (a, x) in the =  relation to be the individual transcriptions of the making of history. The traditional homogeneous binary relations of transition on X and precedence on A are recovered as respectively the right and left residuals of the heterogeneous binary relation =  with itself. The natural algebra of Chu spaces is that of linear logic, made a process algebra by the process interpretation.
New Connections between Mathematics and Computer Science
, 1996
"... A workshop on "New Connections between Mathematics and Computer Science" was held at the Isaac Newton Institute for Mathematical Sciences in Cambridge, England from 2024 November 1995. The workshop was supported by the Engineering and Physical Science Research Council of the United Kingdo ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A workshop on "New Connections between Mathematics and Computer Science" was held at the Isaac Newton Institute for Mathematical Sciences in Cambridge, England from 2024 November 1995. The workshop was supported by the Engineering and Physical Science Research Council of the United Kingdom, the London Mathematical Society and HewlettPackard's Basic Research Institute in the Mathematical Sciences. This document contains a report on the workshop, the abstracts of the talks and the accompanying bibliography.
StateTransition Based Techniques for Specifying RealTime Systems: A Review
"... The specification, verification, design and implementation of realtime system is a major software engineering problem. While logical correctness is a major issue in the development of large and complex software systems, realtime system development demands that timing correctness be satisfied addit ..."
Abstract
 Add to MetaCart
The specification, verification, design and implementation of realtime system is a major software engineering problem. While logical correctness is a major issue in the development of large and complex software systems, realtime system development demands that timing correctness be satisfied additionally. Formal methods of specification and verification are imperative for this task, and there has been considerable research in the area for the past two decades. Of these, statetransition based techniques are numerous and welldeveloped. This paper attempts to compare the approaches taken by workers in the area and provide an introduction to the major issues facing a realtime system developer who wishes to use one of these formal methods.
Internal Accession Date Only New Connections between Mathematics and Computer Science: report, abstracts and bibliography of a workshop
, 1996
"... dynamics; algorithms; algebraic topology; linear logic; complexity theory A workshop on "New Connections between Mathematics and Computer Science " was held at ..."
Abstract
 Add to MetaCart
(Show Context)
dynamics; algorithms; algebraic topology; linear logic; complexity theory A workshop on "New Connections between Mathematics and Computer Science " was held at
Modelling of cryptographic protocols A concurrency perspective FINAL DRAFT
"... Understanding the real behaviour of a cryptographic protocol is a very demanding task. This is mainly due to the immense amount of possible actions, some of which are progressing in parallel, that may happen during even a single protocol run. If one takes into consideration several, concurrently run ..."
Abstract
 Add to MetaCart
(Show Context)
Understanding the real behaviour of a cryptographic protocol is a very demanding task. This is mainly due to the immense amount of possible actions, some of which are progressing in parallel, that may happen during even a single protocol run. If one takes into consideration several, concurrently running but interacting protocol sessions, even the modelling problem becomes almost unsolvable. This is a literature study that attempts to collect and present the most important factors of modelling and verification of cryptographic protocols in an easily comprehensible and relatively concise form. In a way, this work covers over one hundred articles and conference papers published in the area of cryptographic protocols, plus quite a lot of introductory material. The approach taken is aimed for the uninitiated reader, having basic background in communications protocols and cryptography, but not necessarily any deeper notion of applying cryptography in communications. In particular, it is assumed that the reader may not be familiar with modal logic or process algebra. Thus, these basic tools are
Extending TNorms Beyond [0,1]: Relevant Results of Semigroup Theory
, 1999
"... Originally, fuzzy logic was proposed to describe human reasoning. Lately, it turned out that fuzzy logic is also a convenient approximation tool, and that moreover, sometimes a better approximation can be obtained if we use real values outside the interval [0, 1]; it is therefore necessary to descri ..."
Abstract
 Add to MetaCart
(Show Context)
Originally, fuzzy logic was proposed to describe human reasoning. Lately, it turned out that fuzzy logic is also a convenient approximation tool, and that moreover, sometimes a better approximation can be obtained if we use real values outside the interval [0, 1]; it is therefore necessary to describe possible extension of tnorms and tconorms to such new values. It is reasonable to require that this extension be associative, i.e., that the set of truth value with the corresponding operation form a semigroup. Semigroups have been extensively studied in mathematics. In this short paper, we describe several results from semigroup theory which we believe to be relevant for the proposed extension of tnorms and tconorms.