The design of concurrent software systems, in particular process-aware information systems, involves behavioral modeling at various stages. Recently, approaches to behavioral analysis of such systems have been based on declarative abstractions defined as sets of behavioral relations. However, these relations are typically defined in an ad-hoc manner. In this paper, we address the lack of a systematic exploration of the fundamental relations that can be used to capture the behavior of concurrent systems, i.e., co-occurrence, conflict, causality, and concurrency. Besides the definition of the spectrum of behavioral relations, which we refer to as the 4C spectrum, we also show that our relations give rise to implication lattices. We further provide operationalizations of the proposed relations, starting by proposing techniques for computing relations in unlabeled systems, which are then lifted to become applicable in the context of labeled systems, i.e., systems in which state transitions have semantic annotations. Finally, we report on experimental results on efficiency of the proposed computations.
|Title of host publication||Proceedings of the Application and Theory of Petri Nets and Concurrency - 35th International Conference, PETRI NETS, 23-27 June 2014, Tunis, Tunisia|
|Editors||Gianfranco Ciardo, Ekkart Kindler|
|Place of Publication||Berlin|
|Publication status||Published - 2014|
|Name||Lecture Notes in Computer Science|