Information and Computation
Partial commutation and traces
Handbook of formal languages, vol. 3
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Relational structures model of concurrency
Acta Informatica
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Hasse Diagrams of Combined Traces
ACSD '12 Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design
| Hi-index | 0.89 |
To represent concurrent behaviours one can use concepts originating from language theory, including traces and comtraces. Traces can express notions such as concurrency and causality, whereas comtraces can also capture weak causality and simultaneity. This paper is concerned with the development of efficient data structures and algorithms for manipulating comtraces. We introduce and investigate folded Hasse diagrams of comtraces which generalise Hasse diagrams defined for partial orders and traces. We also develop an efficient on-line algorithm for deriving Hasse diagrams from language theoretic representations of comtraces. Finally, we briefly discuss how folded Hasse diagrams could be used to implement efficiently some basic operations on comtraces.