Modelling concurrency with semi-commutations

DOI10.1007/3-540-55808-X_40MaRDI QIDQ5096854zbMATH OpenOpenAlexFDO

Authors Edward Ochmański

Publication date 18 August 2022

Published in Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55808-x_40

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 193318
• scientific article; zbMATH DE number 3872691
• scientific article; zbMATH DE number 3902012
• Modeling concurrency with interval traces
• Semi-commutations and Petri nets

Cites work

• Concurrent systems and inevitability
• scientific article; zbMATH DE number 4213467 (Why is no real title available?)
• scientific article; zbMATH DE number 4121456 (Why is no real title available?)
• Semi-commutations
• Semi-commutations and Petri nets

Cited in

(12)

• Semi-commutations and Petri nets
• An equational modeling of asynchronous concurrent programming
• Meta model of concurrent computation. II: Symmetric communication
• Building a Modal Interface Theory for Concurrency and Data
• Modelling Concurrency with Quotient Monoids
• scientific article; zbMATH DE number 125888 (Why is no real title available?)
• On regular compatibility of semi-commutations
• scientific article; zbMATH DE number 845927 (Why is no real title available?)
• On the synchronization of semi-traces
• Semi-trace morphisms and rational transductions
• Modelling concurrency with comtraces and generalized comtraces
• Cameo: an alternative model of concurrency for Eiffel

This page was built for publication: Modelling concurrency with semi-commutations

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