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

DOI10.1007/S00236-017-0303-8MaRDI QIDQ1671247zbMATH OpenOpenAlexFDO

Authors Søren Debois, Tijs Slaats, Thomas Hildebrandt

Publication date 6 September 2018

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-017-0303-8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Safety, liveness and run-time refinement for modular process-aware information systems with dynamic sub processes
• Nested dynamic condition response graphs
• Contracts for cross-organizational workflows as timed dynamic condition response graphs
• Reachability for dynamic parametric processes
• scientific article; zbMATH DE number 1696537

Cites work

• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 140240 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Adaptable processes
• An event structure semantics for general Petri nets
• Applications and Theory of Petri Nets 2004
• Bundle event structures and CCSP.
• Causal ambiguity and partial orders in event structures
• Concurrent flexible reversibility
• Contextual Petri nets, asymmetric event structures, and processes
• Contracts for cross-organizational workflows as timed dynamic condition response graphs
• Enabling flexibility in process-aware information systems. Challenges, methods, technologies
• Event structures for arbitrary disruption
• Mathematical Foundations of Computer Science 2004
• Model checking LTL using constraint programming
• Nested dynamic condition response graphs
• On the nature of events: another perspective in concurrency
• Safety, liveness and run-time refinement for modular process-aware information systems with dynamic sub processes
• Software engineering and formal methods. 9th international conference, SEFM 2011, Montevideo, Uruguay, November 14--18, 2011. Proceedings
• Specification and verification of declarative open interaction models. A logic-based approach
• Type-checking liveness for collaborative processes with bounded and unbounded recursion

Cited in

(6)

• Business process compliance using reference models of law
• Nested dynamic condition response graphs
• Safety, liveness and run-time refinement for modular process-aware information systems with dynamic sub processes
• Declarative choreographies and liveness
• Contracts for cross-organizational workflows as timed dynamic condition response graphs
• Transforming dynamic condition response graphs to safe Petri nets

This page was built for publication: Replication, refinement \& reachability: complexity in dynamic condition-response graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671247)