Modelling Concurrency with Quotient Monoids

DOI10.1007/978-3-540-68746-7_18zbMath1143.68486OpenAlexW1573072008MaRDI QIDQ3510871

Ryszard Janicki, Dai Tri Man Lê

Publication date: 3 July 2008

Published in: Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68746-7_18

zbMATH Keywords

canonical representationstracesquotient monoidsstep sequencescomtracesstratified order structuresstratified partial orders

Mathematics Subject Classification ID

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

Related Items (1)

Modelling concurrency with comtraces and generalized comtraces

Cites Work

• Unnamed Item
• Unnamed Item
• Process semantics of general inhibitor nets
• Structure of concurrency
• Concurrent and maximally concurrent evolution of nonsequential systems
• PARLE '91. Parallel architectures and languages Europe. Vol. 1: Parallel architectures and algorithms. Eindhoven, The Netherlands, June 10--13, 1991. Proceedings
• Fundamentals of modelling concurrency using discrete relational structures
• Semantics of inhibitor nets
• Combinatorial problems of commutation and rearrangements
• Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations*

This page was built for publication: Modelling Concurrency with Quotient Monoids