Replication, refinement \& reachability: complexity in dynamic condition-response graphs (Q1671247): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00236-017-0303-8 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-017-0303-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2760374955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Causality in Event Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contextual Petri nets, asymmetric event structures, and processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software engineering and formal methods. 9th international conference, SEFM 2011, Montevideo, Uruguay, November 14--18, 2011. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptable processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety, Liveness and Run-Time Refinement for Modular Process-Aware Information Systems with Dynamic Sub Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Dynamic Condition Response Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracts for cross-organizational workflows as timed dynamic condition response graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An event structure semantics for general Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Flexible Reversibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causal ambiguity and partial orders in event structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications and Theory of Petri Nets 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification and verification of declarative open interaction models. A logic-based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nature of events: another perspective in concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enabling Flexibility in Process-Aware Information Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking LTL using constraint programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00236-017-0303-8 / rank
 
Normal rank

Latest revision as of 02:16, 11 December 2024

scientific article
Language Label Description Also known as
English
Replication, refinement \& reachability: complexity in dynamic condition-response graphs
scientific article

    Statements

    Replication, refinement \& reachability: complexity in dynamic condition-response graphs (English)
    0 references
    0 references
    0 references
    6 September 2018
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references