On congruences and partial orders

DOI10.1007/3-540-60246-1_149zbMATH Open1193.68171OpenAlexW1510181236MaRDI QIDQ3569032FDOQ3569032

Authors: Serge Bauget, Paul Gastin 

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60246-1_149

Recommendations

• Modelling Concurrency with Quotient Monoids
• Modelling concurrency with comtraces and generalized comtraces
• Multitraces, hypertraces and partial order semantics
• Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
• Combinatorics on traces

Mathematics Subject Classification ID

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

Cited In (8)

• Order structures for subclasses of generalised traces
• Two theorems on units of orders
• Synchronization languages
• Congruences in ordered pairs of partitions
• Visualisation of concurrent processes
• Title not available (Why is that?)
• Multitraces, hypertraces and partial order semantics
• Trade-offs in true concurrency: Pomsets and mazurkiewicz traces

This page was built for publication: On congruences and partial orders

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