The expressive power of indeterminate primitives in asynchronous computation
P Panangaden - International Conference on Foundations of Software …, 1995 - Springer
It has long been realized that the exigencies of systems programming require primitives that
behave indeterminately. The best-known dataflow primitive is the so called fair merge which …
behave indeterminately. The best-known dataflow primitive is the so called fair merge which …
Recognizable languages in concurrency monoids
M Droste - Theoretical Computer Science, 1995 - Elsevier
Automata with concurrency relations A are labelled transition systems with a collection of
binary relations indicating when two actions, in a given state of the automaton, are …
binary relations indicating when two actions, in a given state of the automaton, are …
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 …
An event-based SOS for a language with refinement
A Rensink - Structures in Concurrency Theory: Proceedings of the …, 1995 - Springer
The notion of action refinement has been studied intensively in the past few years. It is
usually introduced in the form of an operator in a process algebraic language, for which a …
usually introduced in the form of an operator in a process algebraic language, for which a …
Keeping track of the latest gossip in message-passing systems
Consider a distributed system in which processes exchange information by passing
messages. The gossip problem is the following: Whenever a process q receives a message …
messages. The gossip problem is the following: Whenever a process q receives a message …
Dependence orders for computations of concurrent automata
F Bracho, M Droste, D Kuske - STACS 95: 12th Annual Symposium on …, 1995 - Springer
An automaton with concurrency relations A is a labeled transition system with a collection of
binary relations indicating when two events in a given state of the automaton can happen …
binary relations indicating when two events in a given state of the automaton can happen …
Context-free event domains are recognizable
E Badouel, P Darondeau, JC Raoult - … AMAST'95 Montreal, Canada, July 3 …, 1995 - Springer
The possibly non distributive event domains which arise from Winskel's event structures with
binary conflict are known to coincide with the domains of configurations of Stark's trace …
binary conflict are known to coincide with the domains of configurations of Stark's trace …
Graphs for generalized traces
I Biermann, B Rozoy - Structures in Concurrency Theory: Proceedings of …, 1995 - Springer
Mazurkiewicz traces form a model suitable for the investigation of some aspects of
concurrency. We want to investigate one of its generalization based on the weakening of the …
concurrency. We want to investigate one of its generalization based on the weakening of the …
An Event-Based SOS for a Language with Refinement
J Desel, A Rensink - Structures in Concurrency Theory, 1995 - research.utwente.nl
The notion of action refinement has been studied intensively in the past few years. It is
usually introduced in the form of an operator in a process algebraic language, for which a …
usually introduced in the form of an operator in a process algebraic language, for which a …