[图书][B] Categorical combinators, sequential algorithms, and functional programming
PL Curien - 2012 - books.google.com
This book is a revised edition of the monograph which appeared under the same title in the
series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a …
series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a …
The true concurrency of differential interaction nets
D Mazza - Mathematical Structures in Computer Science, 2018 - cambridge.org
We analyse the reduction of differential interaction nets from the point of view of so-called
'true concurrency,'that is, employing a non-interleaving model of parallelism. More precisely …
'true concurrency,'that is, employing a non-interleaving model of parallelism. More precisely …
Nondeterministic automata with concurrency relations and domains
D Kuske - Colloquium on Trees in Algebra and Programming, 1994 - Springer
We introduce an operational model of concurrent systems, called nondeterministic automata
with concurrency relations. These are nondeterministic labelled transition systems where the …
with concurrency relations. These are nondeterministic labelled transition systems where the …
Languages and logical definability in concurrency monoids
M Droste, D Kuske - International Workshop on Computer Science Logic, 1995 - Springer
Abstract Automata with concurrency relations A are labeled transition systems with a
collection of binary relations describing when two actions in a given state of the automaton …
collection of binary relations describing when two actions in a given state of the automaton …
Recognizable and logically definable languages of infinite computations in concurrent automata
M Droste, D Kuske - … Journal of Foundations of Computer Science, 1998 - World Scientific
Automata with concurrency relations, which occurred in formal verification methods of
concurrent programs, are labeled transition systems with a collection of binary relations …
concurrent programs, are labeled transition systems with a collection of binary relations …
[PDF][PDF] Automata with concurrency relations–a survey
M Droste, D Kuske - Advances in Logic, Artificial Intelligence and …, 2002 - ndl.ethernet.edu.et
Automata with concurrency relations, which occurred in the verification methods of
concurrent programs, are labeled transition systems with state-dependent concurrency …
concurrent programs, are labeled transition systems with state-dependent concurrency …
Symmetries of the partial order of traces
D Kuske - Order, 1999 - Springer
This paper deals with the automorphism group of the partial order of finite traces. We show
that any group can arise as such an automorphism group if we allow arbitrary large …
that any group can arise as such an automorphism group if we allow arbitrary large …
Universal homogeneous graph-like structures and domains
We present explicit constructions of universal homogeneous objects in categories of
domains with stable embedding–projection pairs as arrows. These results make use of a …
domains with stable embedding–projection pairs as arrows. These results make use of a …