• Keine Ergebnisse gefunden

We extend lossy channel systems with a transition that, given a channel c and a word w ∈ Σ ∗ checks whether w is contained in c as a subword:

N/A
N/A
Protected

Academic year: 2021

Aktie "We extend lossy channel systems with a transition that, given a channel c and a word w ∈ Σ ∗ checks whether w is contained in c as a subword:"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

WS 2019 / 2020 28.01.2020 Exercises to the lecture

Concurrency Theory Sheet 9 Dr. Prakash Saivasan

Peter Chini Delivery until 04.02.2020 at 12:00

Exercise 9.1 (Lossy Channel Systems with conditionals)

We extend lossy channel systems with a transition that, given a channel c and a word w ∈ Σ checks whether w is contained in c as a subword:

q check w in c p

Formally, we extend the transition relation on configurations of a lossy channel systems by the rule:

(q, W ) → (p, W ) if q −−−−−−−−→ check w in c p and w ≤ W (c).

Given an extended lossy channel system L = (Q, q 0 , C, M, → L ), construct a lossy channel system L 0 = (Q 0 , q 0 , C, M 0 , → L

0

) with Q ⊆ Q 0 and M ⊆ M 0 such that:

(q 1 , W ) → L (q 2 , W 0 ) if and only if (q 1 , W ) → L

0

(q 2 , W 0 ), for each q 1 , q 2 ∈ Q and W, W 0 channel contents.

Exercise 9.2 (Ideals)

Let (C, ≤) be a well quasi ordering. An ideal is a subset I ⊆ C which is non-empty, downward closed, and directed. Directed means that for each x, y ∈ I there exists a z ∈ I such that x ≤ z and y ≤ z.

a) Let (A, ≤ A ) and (B, ≤ B ) be two wqos and (A × B, ≤) their product. Show that a subset J ⊆ A × B is an ideal if and only if J = I A × I B where I A , I B are ideals in A and B , respectively.

Hint: For one direction you need to show that J = proj A (J ) × proj B (J ), where proj A denotes the projection to A: proj A (a, b) = a.

b) Show that the ideals of ( N , ≤) are N itself and all sets of the form n ↓ for n ∈ N . c) Derive that the ideals of N d are of the form M ↓, where M is a generalized marking,

a vector M ∈ (N ∪ {ω}) d .

Delivery until 04.02.2020 at 12:00

Referenzen

ÄHNLICHE DOKUMENTE

Prove correctness of

Lehrstuhl Theoretische Informatik Markus Lohrey. Grundlagen der Theoretischen Informatik

sie erschienen im »Simplicissimus« vom 25. Der Zeichner - der zwei Jahre zuvor von Oslo nach München ge- kommene Olaf Gulbransson - hatte sich genannt; daß er dann nicht

Para acceder a EPSON PhotoStarter, haga doble clic en el icono Macintosh HD y luego en la carpeta en la que esté instalado EPSON PhotoStarter3.x.. Haga doble clic en el icono EPSON

lih selbst gezeigt werden, so lange bis nur noh Axiome oder Prämissen

Übungsblatt.

ü  Lower uncertainties for the retrieval of all the five pigments using Gaussian decomposition and of 9 types of pigments using SVD-NNLS were obtained with the

Abstract—The ceil walls of representatives of the genera CMorfMa, Monoraph;diMm, /In/dsfroaesmus and Sc^n^fsmM.s contained 24-74 % neutral sugars, 1-24 % uronic acids, 2-16 %