Modelling concurrency with comtraces and generalized comtraces

DOI10.1016/J.IC.2011.08.001MaRDI QIDQ651308zbMATH OpenOpenAlexFDO

Authors Ryszard Janicki, Dai Tri Man Lê

Publication date 12 December 2011

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2011.08.001

zbMATH Keywords

simultaneitycausalitycanonical representationtrace monoidgeneralized trace theorystep sequencestratified order structurestratified partial orderweak causality

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Trace-oriented models of concurrency
• Modeling concurrency with interval traces
• Modelling concurrency with semi-commutations
• scientific article; zbMATH DE number 125888
• Models for concurrency: Towards a classification
• Context for models of concurrency
• Communicating Sequential Processes. The First 25 Years
• Model checking concurrent programs
• Translating between models of concurrency

Cites work

• scientific article; zbMATH DE number 5347282 (Why is no real title available?)
• scientific article; zbMATH DE number 5506906 (Why is no real title available?)
• scientific article; zbMATH DE number 3669869 (Why is no real title available?)
• scientific article; zbMATH DE number 107452 (Why is no real title available?)
• scientific article; zbMATH DE number 2060760 (Why is no real title available?)
• scientific article; zbMATH DE number 795666 (Why is no real title available?)
• scientific article; zbMATH DE number 1435986 (Why is no real title available?)
• A Characterization of Combined Traces Using Labeled Stratified Order Structures
• A generalization of traces
• Applications and Theory of Petri Nets 2004
• Causal semantics of algebraic Petri nets distinguishing concurrency and synchronicity
• Combinatorial problems of commutation and rearrangements
• Concurrent and maximally concurrent evolution of nonsequential systems
• Fundamentals of modelling concurrency using discrete relational structures
• Modelling Concurrency with Quotient Monoids
• Modelling concurrent behaviours by commutativity and weak causality relations
• Notes on finite asynchronous automata
• Process semantics of general inhibitor nets
• Relational structures model of concurrency
• Semantics of inhibitor nets
• Structure of concurrency
• Trade-offs in true concurrency: Pomsets and mazurkiewicz traces

Cited in

(21)

• On three alternative characterizations of combined traces
• Modeling interval order structures with partially commutative monoids
• Algebraic structure of combined traces
• Multitraces, hypertraces and partial order semantics
• Relational structures for concurrent behaviours
• Classifying invariant structures of step traces
• Folded Hasse diagrams of combined traces
• Interval traces with mutex relation
• Algebraic structure of combined traces
• Cameo: an alternative model of concurrency for Eiffel
• Modeling concurrency with interval traces
• Visualisation of concurrent processes
• scientific article; zbMATH DE number 1931943 (Why is no real title available?)
• Algebraic structure of step traces and interval traces
• Step traces
• Connections between a concrete and an abstract model of concurrent systems
• Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
• Defining conditional independence using collapses
• Order structures for subclasses of generalised traces
• On congruences and partial orders
• Quotient monoids and concurrent behaviours

This page was built for publication: Modelling concurrency with comtraces and generalized comtraces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651308)