Denotational, Causal, and Operational Determinism in Event Structures
نویسنده
چکیده
Determinism is a theoretically and practically important concept in labelled transition systems and trees. We study its generalisation to event structures. It turns out that the result depends on what characterising property of tree determinism one sets out to generalise. We present three distinct notions of event structure determinism, and show that none of them shares all the pleasant properties of the one concept for trees.
منابع مشابه
Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or
Although Plotkin’s parallel-or is inherently deterministic, it has a non-deterministic interpretation in games based on (prime) event structures – in which an event has a unique causal history – because they do not directly support disjunctive causality. General event structures can express disjunctive causality and have a more permissive notion of determinism, but do not support hiding. We sho...
متن کاملApproaching the Denotational Semantics of Behavioral VHDL Descriptions
In this paper, we present a framework for de ning the formal semantics of behavioral VHDL92 descriptions. We propose a complementary application of denotational and operational semantics. The static semantics is de ned by denotational means. The de nition of the dynamic semantics is based on an operational model using Interval Event Structures.
متن کاملMetric Semantics for True Concurrent Real Time
This paper investigates the use of a complete metric space framework for providing denotational semantics to a real-time process algebra. The study is carried out in a non-interleaving setting and is based on a timed extension of Langerak's bundle event structures, a variant of Winskel's event structures. The distance function of the metric is based on the amount of time to which event structur...
متن کاملEvent Structures for Interrupt Process Algebras
Interruption is a useful feature in programming and specification languages. Therefore, process algebras has been extended with an additional interrupt operator. We invent a class of event structures, called interrupt event structures, to give a true concurrent semantic to process algebras containing interruption. Interrupt event structures are more expressive than other event structures with r...
متن کاملECSYM Part B1- Section 1d EVENTS, CAUSALITY AND SYMMETRY
Why? At present there are three main methodologies used in representing and analyzing the behaviour of computer programs and processes, all of them with their advantages, but all with their inadequacies and problems: • Denotational semantics and domain theory. This has provided a global mathematical setting for sequential computation, and thereby placed programming languages in connection with ...
متن کامل