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...