FG Modelle und Theorie Verteilter Systeme

5 Items

Recent Submissions
Shaping the selection of fields of study in Afghanistan through educational data mining approaches

Sherzad, Abdul Rahman (2018)

Every year around 250000 high school graduates participate in ‘Kankor’, the Afghan national university entrance exam, while the seating capacity of the country’s 36 public universities is one-fourth of that number. Currently, public and private sectors lack advisory systems to guide the increasing number of participants to choose their fields of study. This is further exacerbated by the fact th...

Event structures with higher-order dynamics

Karcher, David S. (2019)

Event Structure were introduced in 1979 [18] as a formal model to connect the theory of Petri nets and domain theory. Originally they consisted of atomic non-repeatable events, a binary causal dependency relation, and a binary conflict relation between those events. For a long time various extensions of the original formalism were used to define semantics for other structures such as classes of...

Synchrony versus causality in distributed systems

Peters, Kirstin ; Schicke-Uffmann, Jens-Wolfhard ; Goltz, Ursula ; Nestmann, Uwe (2014)

Given a synchronous system, we study the question whether – or, under which conditions – the behaviour of that system can be realized by a (non-trivially) distributed and hence asynchronous implementation. In this paper, we partially answer this question by examining the role of causality for the implementation of synchrony in two fundamental different formalisms of concurrency, Petri nets and ...

Breaking symmetries

Peters, Kirstin ; Nestmann, Uwe (2014)

A well-known result by Palamidessi tells us that πmix (the π-calculus with mixed choice) is more expressive than πsep (its subset with only separate choice). The proof of this result analyses their different expressive power concerning leader election in symmetric networks. Later on, Gorla offered an arguably simpler proof that, instead of leader election in symmetric networks, employed the red...

Full abstraction for expressiveness: history, myths and facts

Gorla, Daniele ; Nestmann, Uwe (2014)

What does it mean that an encoding is fully abstract? What does it not mean? In this position paper, we want to help the reader to evaluate the real benefits of using such a notion when studying the expressiveness of programming languages. Several examples and counterexamples are given. In some cases, we work at a very abstract level; in other cases, we give concrete samples taken from the fiel...