scispace - formally typeset
Open AccessJournal ArticleDOI

Degrees of Non-determinism and Concurrency: A Petri Net View

Mogens Nielsen, +1 more
- Vol. 13, Iss: 180
TLDR
The aim of this paper is to present an introduction to the theory of Petri nets, and to attempt a broader sketch of the scope and contents of net theory.
Abstract
The aim of this paper is to present an introduction to the theory of Petri nets. The subject matter of this theory is distributed systems and processes. In our presentation, we shall emphasise concepts at the expense of specific results and techniques. Applications of the theory, though many and varied, will not be dealt with here. Even in dealing with the concepts, we shall focus on those that we believe are relevant to the study of distributed systems in general (independent of the specific framework one might choose). In the concluding part, we will attempt a broader sketch of the scope and contents of net theory.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

Petri net models for algebraic theories of concurrency

TL;DR: The issue of interleaving semantics versus True concurrency in an algebraic setting is discussed.
Book ChapterDOI

Some equivalence notions for concurrent systems. An overview

Lucia Pomello
TL;DR: String-equivalence, Behaviour-equivalentence, Observation-equivals, Exhibited-Behaviour- Equivalences, Failure-Equivalence and Testing equivalence are re-defined and discussed on Petri Net models of concurrent systems in order to capture the concurrency degree of the systems, in terms of the subset languages approach.
Journal Article

A general conservative extension theorem in process algebras with inequalities

TL;DR: In this article, a general conservative extension theorem for transition system based process theories with easy-to-check and reasonable conditions is presented. But it is not shown how to prove the completeness of this theorem.
Journal ArticleDOI

A general conservative extension theorem in process algebras with inequalities

TL;DR: In this paper, a general conservative extension theorem for transition system based process theories with easy-to-check and reasonable conditions is presented. But it is not shown how to prove the completeness of this theorem.
Journal ArticleDOI

A simple process algebra based on atomic actions with resources

TL;DR: A congruence theorem is proved relating the two semantics, which implies the operational model itself is compositional, and implies the denotational model is adequate with respect to the operational semantics.