Replication, refinement \& reachability: complexity in dynamic condition-response graphs
From MaRDI portal
Publication:1671247
DOI10.1007/s00236-017-0303-8zbMath1398.68094OpenAlexW2760374955MaRDI QIDQ1671247
Tijs Slaats, Søren Debois, Thomas Troels 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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Software engineering and formal methods. 9th international conference, SEFM 2011, Montevideo, Uruguay, November 14--18, 2011. Proceedings
- An event structure semantics for general Petri nets
- On the nature of events: another perspective in concurrency
- Contextual Petri nets, asymmetric event structures, and processes
- Specification and verification of declarative open interaction models. A logic-based approach
- Contracts for cross-organizational workflows as timed dynamic condition response graphs
- Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion
- Dynamic Causality in Event Structures
- Nested Dynamic Condition Response Graphs
- Enabling Flexibility in Process-Aware Information Systems
- Adaptable processes
- Safety, Liveness and Run-Time Refinement for Modular Process-Aware Information Systems with Dynamic Sub Processes
- Mathematical Foundations of Computer Science 2004
- Concurrent Flexible Reversibility
- Applications and Theory of Petri Nets 2004
- CONCUR 2003 - Concurrency Theory
- Causal ambiguity and partial orders in event structures
This page was built for publication: Replication, refinement \& reachability: complexity in dynamic condition-response graphs
