• Keine Ergebnisse gefunden

Problem 1: Unfolding Prefix

N/A
N/A
Info
Herunterladen
Protected

Academic year: 2021

Aktie "Problem 1: Unfolding Prefix"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Jetzt herunterladen ( 2 Seite )

Volltext

(1)

Concurrency Theory (WS 2011/12) Out: Tue, Nov 22 Due: Mon, Nov 28

Exercise Sheet 6

Jun.-Prof. Roland Meyer, Georgel C˘alin Technische Universit¨at Kaiserslautern For the first three problems you must unfold the given Petri nets to a finite and complete prefix using the ERV algorithm and McMillan’s adequate order.

Also, you should give the sets of possible extensions and cut-offs at each iteration of the algorithm as well as argument why each event in the cut-off set is a cut-off.

Problem 1: Unfolding Prefix

t

3

t

2

t

1

t

4

p

1

p

3

p

2

p

4

Problem 2: Unfolding Prefix

p

1

p

2

p

3

p

4

p

5

t

1

t

2

t

3

t

4

Problem 3: Unfolding Prefix

p

1

t

2

p

4

t

3

t

1

p

2

t

4

p

5

t

5

p

3

(2)

Problem 4: SAT-Based Verification

Consider the Petri net depicted below.

p

1

t

1

p

2

p

3

t

2

t

3

p

4

t

4

(a) Compute the finite complete prefix (O, h) = (B, E, G) of the Petri net’s unfolding.

Express the reachability of the marking (0 0 0 1)

T

as violation constraint V .

(b) Find a general formula M characterizing reachability of a marking in a complete prefix

starting from the C ∧ V formula given in class. Use extra Boolean variables x

b

for every b ∈ B.

Referenzen

Jetzt herunterladen ( PDF - 2 Seite - 76.36 KB )

ÄHNLICHE DOKUMENTE

1 Das Dirichlet-Problem

⇒ Lassen wir also Lipschitz-Graphen als Minimalfl¨ achen zu, so finden wir in dieser erweiterten Klasse eine Fl¨ ache

Scalable High-Speed Prefix Matching

Our basic algorithm is based on three significant ideas: First, we use hashing to check whether an address D matches any prefix of a particular length; second, we use binary search

Problem Set 1

For problems without p˚q, you do not need to write up your solutions, but it is highly recommended that you think through them before the next Tuesday

1 Das Basler Problem

Euler gibt sie zuerst ohne Beweis in Methodus generalis summan- di progressiones (Eine allgemeine Methode zur Summierung von Reihen, E25; OI,14, S. 42–72; eingereicht

Problem Set 1

As another example, if two players guess correctly and one guesses incorrectly, the team loses. Describe a strategy for which the team has a probability to win that is at

Problem Set 1

Assuming that the coupon in each box is chosen independently and uniformly at random from the n possibilities, what is the expected number of boxes you have to buy before you can

1 Das DL-Problem

Wenn sich an dieser Stelle schon ein Paar bestehend aus (1, r) findet, so kann man x = r setzen und hat somit das DL-Problem gel¨ ost.. Als DL-Problem in einer Gruppe der Ordnung p