Presentation is loading. Please wait.

Presentation is loading. Please wait.

A denotational framework for comparing models of computation Daniele Gasperini.

Similar presentations

Presentation on theme: "A denotational framework for comparing models of computation Daniele Gasperini."— Presentation transcript:

1 A denotational framework for comparing models of computation Daniele Gasperini

2 Abstract Aim: compare different model of computation and their certain essential features How: use a denotational framework

3 Main characteristics Denotational rather than operational Mathematical approach Main actors: – Processes – Signals – Events Tagged signal model

4 SIGNALS 1 Event e = tag : value – Set of values V – Set of tags T Tags: model time, precedence relationships, synchronization points Values: represent operands and result of computation Signal s = set of events = subset of T x V e є T x V

5 SIGNALS 2: Characteristics & notations Functional signals – e 1 = (t, v 1 ) є s and e 2 = (t, v 2 ) є s then v 1 = v 2 S = the set of all signals S N = collection/tuple of N signals λ = empty signal (no events) Λ = collection/tuple of N empty signals – λ є S and Λ є S N = bottom : absence of value

6 PROCESSES P = process : subset of S N for some N s = behavior of a process – s є S N and s є P → P = set of behaviors Composing processes Inputs and outputs Determinacy

7 Given M processes in S N a process Q composed of these processes is given by: Where P is the collection of processes Composing processes 1 P = set of behaviors s Composing = P 1 x P 2 x … P n

8 Composing processes 2: projections Process P = set of behaviors s

9 Inputs and outputs P I (size m)O (size n)

10 Determinacy A process is determinate if for any input A є B it has exactly one behavior or exactly no behaviors. Otherwise is nondeterminate. functional + functional = functional → preserve Functional + source processes with exacly one behavior = functional → preserve Depends on the tag system and the process

11 Tags systems The central role of a tag system is to establish ordering among events. specification implementation s 1 s 2 s 3 … i.e. time Ordering relation among events properties: reflectivetransitiveantisymmetric Ordering of tags Ordering of events

12 Timed models of computation The set of tags T is a totally ordered set Tag = timestamp

13 Flavors of timed models Metric time Continuous time Discrete event Discrete event simulators Synchronous and discrete-time systems Sequential systems

14 Metric time T totally ordered T Abelian group – closed to addition – zero – for every t є T there is another element -t є T such that t + (-t) = 0 – T has a metric Directly modeling physical systems

15 Continuous time T totally ordered T is a continuum T(s) = T for each signal s in any tuple s that satisfies the system

16 Discrete event T totally ordered The set of tags must be a discrete subset of T The set of tags must be order isomorphic The timestamps that appear in any behavior can be enumerated in chronological order. Many simulators (most digital circuit simulators)

17 Discrete events simulators Same characteristics of discrete event Events explicitly include timestamp The simulator operates by keeping a list of events sorted by timestamp Delta time (affects semantic and ensure strict causality)

18 Synchronous and discrete-time systems Two events are synchronous if they have the same tag Two signals are synchronous if all events in one signal are synchronous with an event in the other signal and vice versa A process is synchronous if every signal in any behavior of the process is synchronous with every other signal in the behavior

19 Sequential systems Single signal s The set of tags in the signal are totally ordered

20 Untimed models of computation Tags are partially ordered Partial order is present in many models of computations because denotes – Causality – Synchronization

21 Rendezvous of sequential processes Sequential processes reach a particular point at which they must verify that another process has reached a corresponding point before proceeding Communicating sequential processes and the calculus of communicating systems T(e 1 ) = T(e 2 ) = T(e 3 ) s1s1 s3s3 s2s2

22 Kahn process networks Processes communicate via channels, which are one-way unbounded FIFO queues with a single reader and a single writer. FIFOT(s) is totally ordered for each signal s Imposes an ordering on the events Be Σ(s) denote the sequence of values in s Two signals s and s’ sequence equivalent Σ(s) = Σ(s’) A process is sequence functional if given a set of equivalent tuples of input signals all possible outputs are sequence equivalent Sequence determinacy

23 Dataflow Special case of Kahn process networks A dataflow process is a Kahn process that is also sequential Self loop signal is called firing signal s’ s’’ s P e’ consumed by e i + 1 e i ≤ e’ ≤ e i + 1 e’’ produced by e i e i ≤ e’’ ≤ e i + 1

24 Petri Nets Similar to dataflow Events within signals need not be ordered s2s2 s1s1 f: s 2 → s 1 such that f(e) < e for all e є s 2 A firing (an event in s 2 ) has a corresponding token (an event in s 1 ) with a smaller tag

25 Heterogeneous systems V divided into subsets → carry the notion of data types T divided → separately model parts of heterogeneous system (continuous time, discrete event and dataflow subsystems)

26 The Role of Tags in composition of processes Aim: connect tagged signal model to well- known results in semantics Two cases: – Discrete event systems – Kahn process networks

27 Discrete event systems Causality Synchronous events Feedback loops Cantor metric The n-tuples of signals → metric space Distance of signals Three form of causality: Casual: two possible outputs differ no earlier than the inputs that produced them Strictly casual: two possible outputs differ later than the inputs that produced them (or not at all) Delta casual: there is a delay of at least Δ before any output of a process can be produced in reaction to an input event If a process is functional and delta casual then the feedback loop has exactly one behavior Simulators (VHDL, Verilog)

28 Monotonicity and continuity in Kahn process networks MonotonicityContinuity Determinacy of feedback compositions Constructive procedure for finding one unique behavior Causality Prefix order a natural partial ordering for signals that contains a totally ordered set of events Σ(s) sequence of values in the signal s A continuous process is monotonic, not all monotonic functions are continuous The feedback loops have an alternative interpretation of the composition Q that brings the sequence to be determinate (fixed point theorem)

Download ppt "A denotational framework for comparing models of computation Daniele Gasperini."

Similar presentations

Ads by Google