Synchrony vs. Causality in Asynchronous Petri Nets
Authors:
Open Access
- 20 August 2011
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 64, 119-131
Abstract
Given a synchronous system, we study the question whether the behaviour of that system can be exhibited by a (non-trivially) distributed and hence asynchronous implementation. In this paper we show, by counterexample, that synchronous systems cannot in general be implemented in an asynchronous fashion without either introducing an infinite implementation or changing the causal structure of the system behaviour.Comment: In Proceedings EXPRESS 2011, arXiv:1108.407Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Distributable nets2005
- Distributing Finite Automata Through Petri Net SynthesisFormal Aspects of Computing, 2002
- Refinement of actions and equivalence notions for concurrent systemsActa Informatica, 2001
- The linear time — Branching time spectrum II1993
- The pomset model of parallel processes: Unifying the temporal and the spatialLecture Notes in Computer Science, 1985
- Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairnessLecture Notes in Computer Science, 1984