Compositional relational semantics for indeterminate dataflow networks
EW Stark - Category Theory and Computer Science: Manchester …, 2005 - Springer
Given suitable categories T, C and functor F: T→ C, if X, Y are objects of T, then we define an
(X, Y)-relation in C to be a triple\left (R,\raise0. 3em \scriptscriptstyle- r, ̄ r\right), where R is …
(X, Y)-relation in C to be a triple\left (R,\raise0. 3em \scriptscriptstyle- r, ̄ r\right), where R is …
On relating rewriting systems and graph grammars to event structures
G Schied - … in Computer Science: International Workshop Dagstuhl …, 2005 - Springer
In this paper, we investigate how rewriting systems and especially graph grammars as
operational models of parallel and distributed systems can be related to event structures as …
operational models of parallel and distributed systems can be related to event structures as …
Concurrent automata vs. asynchronous systems
R Morin - … Symposium on Mathematical Foundations of Computer …, 2005 - Springer
We compare the expressive power of two automata-based finite-state models of
concurrency. We show that Droste's and Kuske's coherent stably concurrent automata and …
concurrency. We show that Droste's and Kuske's coherent stably concurrent automata and …
[PDF][PDF] Hierarchy of Asynchronous Automata
R emi MORIN - core.ac.uk
We study a natural notion of communication structure associated with asynchronous
automata: we characterize which transition systems are isomorphic to an asynchronous …
automata: we characterize which transition systems are isomorphic to an asynchronous …