Asynchronous wreath product and cascade decompositions for concurrent behaviours
We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between events, and can be said to support true concurrency....
Main Authors: | Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2022-06-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/7504/pdf |
Similar Items
-
Wreath Products of Forest Algebras, with Applications to Tree Logics
by: Mikolaj Bojanczyk, et al.
Published: (2012-09-01) -
New tools for state complexity
by: Pascal Caron, et al.
Published: (2020-03-01) -
Equivalence checking for weak bi-Kleene algebra
by: Tobias Kappé, et al.
Published: (2021-08-01) -
A Concurrent Pattern Calculus
by: Thomas Given-Wilson, et al.
Published: (2014-08-01) -
Analyzing Timed Systems Using Tree Automata
by: S. Akshay, et al.
Published: (2018-05-01)