Transforming dynamic condition response graphs to safe Petri nets

DOI10.1007/978-3-031-33620-1_22MaRDI QIDQ6535206zbMATH OpenFDO

Authors Vlad Paul Cosma, Thomas Hildebrandt, Tijs Slaats

Publication date 16 November 2023

Full work available at URL https://doi.org/10.1007/978-3-031-33620-1_22

zbMATH Keywords

bisimilarityDCR graphsPetri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Replication, refinement \& reachability: complexity in dynamic condition-response graphs
• scientific article; zbMATH DE number 3905851
• The conversion of dynamic fault trees to stochastic Petri nets, as a case of graph transformation
• Petri net transformations in the Petri Net Baukasten
• Nested dynamic condition response graphs

Cites work

• Applications and Theory of Petri Nets 2005
• Contextual nets
• Contracts for cross-organizational workflows as timed dynamic condition response graphs
• Extending PNML scope: a framework to combine Petri nets types
• scientific article; zbMATH DE number 1759628 (Why is no real title available?)
• Infinite behaviour of Petri nets
• On the high complexity of Petri nets -languages
• Reduction rules for reset/inhibitor nets
• Replication, refinement \& reachability: complexity in dynamic condition-response graphs
• Specification and verification of declarative open interaction models. A logic-based approach

Cited in

(1)

• scientific article; zbMATH DE number 5286860 (Why is no real title available?)

This page was built for publication: Transforming dynamic condition response graphs to safe Petri nets

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