Modelling & Mining Event-based Concurrent Declarative Processes as Dynamic Condition Response Graphs
Dynamic Condition Response (DCR) Graphs was introduced in 2010 as a generalisation of prime event structures motivated by the aim to provide a formal foundation for trustworthy, flexible and run-time adaptable workflow management systems for which both safety and liveness properties could be guaranteed. DCR Graphs allow for finite event-based representations of concurrent processes with both finite and infinite behaviours. The formal languages recognised by DCR graphs are exactly languages being the union of a regular and an omega-regular language. Today the DCR graph technology is supported by both commercial tools for collaborative process design and simulation and adaptive case management and academic tools for process design, simulation and analysis and process mining. The theory has also been developed substantially, providing support for inference of independence between events, safe distribution and refinement, time, data and dynamically created sub-processes. In the talk we give an introduction to the theory and tools for DCR graphs and application to the modelling and mining of so-called “truly” concurrent event-based processes.