Interleaving isotactics – An equivalence notion on behaviour abstractions

Citation data:

Theoretical Computer Science, ISSN: 0304-3975, Vol: 737, Page: 1-18

Publication Year:
2018
Captures 4
Readers 4
Social Media 4
Tweets 4
DOI:
10.1016/j.tcs.2018.01.005
Author(s):
Artem Polyvyanyy; Jan Sürmeli; Matthias Weidlich
Publisher(s):
Elsevier BV
Tags:
Mathematics; Computer Science
Most Recent Tweet View All Tweets
article description
We study the equivalence of models that capture the behaviour of systems, such as process-oriented information systems. We focus on models that are not related by a bijection over their actions, but by an alignment between sets of their actions. For this setting, we propose interleaving isotactics as an equivalence notion based on abstractions that are induced by the alignment. We demonstrate that this notion is grounded in trace equivalence, provide a temporal logic characterisation of the properties it preserves, prove decidability of the respective verification problems, and present an implementation of a decision procedure for the equivalence notion.