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

Research output: Contribution to journalJournal articleResearchpeer-review


  • dcrpl-AI

    Accepted author manuscript, 569 KB, PDF document

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 eventreachability 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
Original languageEnglish
JournalActa Informatica
Pages (from-to)1-32
Number of pages32
Publication statusPublished - 21 Sep 2017
Externally publishedYes

Number of downloads are based on statistics from Google Scholar and

No data available

ID: 227990872