Replication, refinement & reachability: complexity in dynamic condition-response graphs

19Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We explore the complexity of reachability and run-time refinement under safety and liveness constraints in event-based process models. Our study is framed in the DCR⋆ process language, which supports modular specification through a compositional operational semantics. DCR⋆ encompasses the “Dynamic Condition Response (DCR) graphs” declarative process model for analysis, execution and safe run-time refinement of process-aware information systems; including replication of sub-processes. We prove that event-reachability and refinement are np-hard for DCR⋆ processes without replication, and that these finite state processes recognise exactly the languages that are the union of a regular and an ω-regular language. Moreover, we prove that event-reachability and refinement are undecidable in general for DCR⋆ processes with replication and local events, and we provide a tractable approximation for refinement. A prototype implementation of the DCR⋆ language is available at http://dcr.tools/acta16.

Cite

CITATION STYLE

APA

Debois, S., Hildebrandt, T. T., & Slaats, T. (2018). Replication, refinement & reachability: complexity in dynamic condition-response graphs. Acta Informatica, 55(6), 489–520. https://doi.org/10.1007/s00236-017-0303-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free