A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems
From MaRDI portal
Publication:6635514
DOI10.46298/LMCS-20(4:4)2024MaRDI QIDQ6635514
Tim Kräuter, Adrian Rutle, Harald König, Yngve Lamo
Publication date: 12 November 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transactions on Petri Nets and Other Models of Concurrency II. Special issue on concurrency in process-aware information systems
- Explicit State Model Checking for Graph Grammars
- Nested Quantification in Graph Transformation Rules
- Handbook of Model Checking
- How Much Are Your Geraniums? Taking Graph Conditions Beyond First Order
- Formalization and analysis of BPMN using graph transformation systems
This page was built for publication: A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635514)
