Fundamentals of modelling concurrency using discrete relational structures

DOI10.1007/s002360050090zbMath0934.68047OpenAlexW1972895017MaRDI QIDQ1369226

Ryszard Janicki, Maciej Koutny

Publication date: 17 November 1997

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050090

zbMATH Keywords

concurrency theoryextension completeness

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (14)

Boolean networks: beyond generalized asynchronicity ⋮ Process semantics of general inhibitor nets ⋮ On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller ⋮ On Interval Process Semantics of Petri Nets with Inhibitor Arcs ⋮ Non-atomic Transition Firing in Contextual Nets ⋮ Concurrency in Boolean networks ⋮ Modelling Concurrency with Quotient Monoids ⋮ Modelling concurrency with comtraces and generalized comtraces ⋮ Relational structures model of concurrency ⋮ The Mutex Paradigm of Concurrency ⋮ Interval semantics for Petri nets with inhibitor arcs ⋮ Modeling concurrency with interval traces ⋮ Relational structures for concurrent behaviours ⋮ On the continuous analogue of the Szpilrajn theorem. I

This page was built for publication: Fundamentals of modelling concurrency using discrete relational structures