AbstractA concurrent system S is called determinism if for all states s of S we have that whenever S can evolve from state s into states s′ and s″ by doing an action a, it must be the case that s′ equals s″. It is well known that for deterministic concurrent systems, most of the interleaved equivalences (bisimulation-, failure-, trace-equivalence) coincide. In this paper we prove in the setting of event structures that also most of the non-interleaved equivalences coincide (with each other) on this domain. In the last section of the paper we show that, as a consequence of our result, the causal structure of a deterministic concurrent system can be unravelled by observers who are capable of observing the beginning and termination of events
Event structures are fundamental models in concurrency theory, providing a representation of events ...
In the study of behaviours of concurrent systems, traces are sets of behaviourally equivalent action...
For finite-state systems non-interleaving equivalences are computationallyat least as hard as interl...
AbstractA concurrent system S is called determinism if for all states s of S we have that whenever S...
Determinism is a theoretically and practically important concept in labelled transition systems and ...
AbstractMulti-level deterministically synchronized sequential processes, or (DS)∗SP, is a recursivel...
Event structures are one of the best known models for concurrency. Many variants of the basic model ...
Event structures are one of the best known models for concurrency. Many variants of the basic model ...
A flexible abstraction mechanism for models of concurrency, which allows systems which "look the sam...
Abstract. If an experiment s is conducted on a parallel process p, then, in general, different proce...
Kripke Structures and Labelled Transition Systems are the two most prominent semantic models used in...
We suggest an equivalence notion for event structures as a semantic model of concurrent systems. It ...
AbstractWe investigate an operational model of concurrent systems, called automata with concurrency ...
This paper offers three candidates for a deterministic, noninterleaving, behaviour model which gener...
Event structures are fundamental models in concurrency theory, providing a representation of events ...
Event structures are fundamental models in concurrency theory, providing a representation of events ...
In the study of behaviours of concurrent systems, traces are sets of behaviourally equivalent action...
For finite-state systems non-interleaving equivalences are computationallyat least as hard as interl...
AbstractA concurrent system S is called determinism if for all states s of S we have that whenever S...
Determinism is a theoretically and practically important concept in labelled transition systems and ...
AbstractMulti-level deterministically synchronized sequential processes, or (DS)∗SP, is a recursivel...
Event structures are one of the best known models for concurrency. Many variants of the basic model ...
Event structures are one of the best known models for concurrency. Many variants of the basic model ...
A flexible abstraction mechanism for models of concurrency, which allows systems which "look the sam...
Abstract. If an experiment s is conducted on a parallel process p, then, in general, different proce...
Kripke Structures and Labelled Transition Systems are the two most prominent semantic models used in...
We suggest an equivalence notion for event structures as a semantic model of concurrent systems. It ...
AbstractWe investigate an operational model of concurrent systems, called automata with concurrency ...
This paper offers three candidates for a deterministic, noninterleaving, behaviour model which gener...
Event structures are fundamental models in concurrency theory, providing a representation of events ...
Event structures are fundamental models in concurrency theory, providing a representation of events ...
In the study of behaviours of concurrent systems, traces are sets of behaviourally equivalent action...
For finite-state systems non-interleaving equivalences are computationallyat least as hard as interl...