Structure of concurrency
type: Item
instance of: scholarly article
title: Structure of concurrency
zbMATH Open document ID: 0814.68061
DOI: 10.1016/0304-3975(93)90238-O
author: Ryszard Janicki
author: Maciej Koutny
published in: Theoretical Computer Science
publication date: 1993-10-17T00:00:00Z
review text: A new approach to the semantic of concurrency is proposed. It is motivated by the remark that the causal order of events is sometimes insufficient to describe adequately some aspect of concurrent behaviour, this happens for example in the case of systems with priority and for Petri nets with inhibitor arcs. Three levels of description are distinguished. At the bottom level -- called observation level -- the system is represented by partial orders with the ordering giving precedence of events and incomparability denoting simultaneity. Relations between observations and interval orders are thoroughly examined. The next level discussed is the invariant level. Roughly, invariants are relations that are universally satisfied over the set of observations of a system. Further developments of the theory lead to the notions of histories and paradigms, where paradigms are intended to capture structural properties of histories.
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 417333
zbMATH Keywords: semantic of concurrency
zbMATH Keywords: systems with priority
zbMATH Keywords: Petri nets
reviewed by: Wiesław Zielonka
MaRDI profile type: Publication
cites work: Q3683545
cites work: Petri net semantics of priority systems
cites work: Concurrent histories: a basis for observing distributed systems
cites work: Intransitive indifference with unequal indifference intervals
cites work: Betweenness, orders and interval graphs
cites work: Theory of relations. Transl. from the French by P. Clote
cites work: Incidence matrices and interval graphs
cites work: A resource-based prioritized bisimulation for real-time systems
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q3777424
cites work: A formal semantics for concurrent systems with a priority relation
cites work: Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
cites work: The mutual exclusion problem
cites work: On interprocess communication. I: Basic formalism
cites work: Q3939202
cites work: A methodology for programming with concurrency: An informal presentation
cites work: A calculus of communicating systems
cites work: Calculi for synchrony and asynchrony
cites work: Q4124795
cites work: Q4733430
cites work: Q3911403
cites work: Modeling concurrency with partial orders
cites work: Q3670575
cites work: Subset languages of Petri nets. I: The relationship to string languages and normal forms
cites work: Q3925868
cites work: Concurrent Machines
cites work: Q3771632
cites work: Q3355248
cites work: Q3667958
cites work: Notes on finite asynchronous automata
Recommended article: Q4040941
Recommended article: Q3823148
Recommended article: Relational structures model of concurrency
Recommended article: Q3975177
Recommended article: Concurrency in synchronous systems
Recommended article: Relational structures for concurrent behaviours
Recommended article: Concurrent Programming
Recommended article: Q3992668
Recommended article: Nebenläufige Programme
description: scientific article; zbMATH DE number 417333