7 Result(s)
within
J. J. M. M. Rutten
Computer Science
Programming Techniques
-
Chapter and Conference Paper
Contractions in comparing concurrency semantics
We define for a simple concurrent imperative language both operational and denotational semantic models as fixed points of contractions on complete metric spaces. Next, we develop a general method for comparin...
-
Chapter and Conference Paper
Correctness and full abstraction of metric semantics for concurrency
Four different semantic models are given for a simple uniform programming language, containing constructs for parallel composition, global nondeterminism and communication: linear semantics, failure semantics,...
-
Chapter and Conference Paper
The failure of failures in a paradigm for asynchronous communication
We develop a general framework for a variety of concurrent languages all based on asynchronous communication, like data flow, concurrent logic, concurrent constraint languages and CSP with asynchronous channel...
-
Chapter and Conference Paper
On blocks: locality and asynchronous communication
A general construct for locality in languages based on asynchronous communication is introduced which allows a uniform semantic description of such apparently diverse notions as the introduction of local varia...
-
Chapter and Conference Paper
Bisimulation for probabilistic transition systems: A coalgebraic approach
The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendier in terms of a set fu...
-
Chapter and Conference Paper
Automata and coinduction (an exercise in coalgebra)
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent...
-
Chapter and Conference Paper
Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series
Regular expressions are a standard means for denoting formal languages that are recognizable by finite automata. Much less familiar is the use of syntactic expressions for (formal) power series. Power series g...
