Symbolic specification and verification of data-aware BPMN processes using rewriting modulo SMT
From MaRDI portal
Publication:6164536
Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of organizations, manpower planning in operations research (90B70)
Recommendations
Cited in
(10)- A rigorous methodology for specification and verification of business processes
- Probabilistic model checking of BPMN processes at runtime
- Formal verification of complex business processes based on high-level Petri nets
- Verification of time-aware business processes using constrained Horn clauses
- Verification and validation of formal data-centric business models
- Soundness verification of data-aware process models with variable-to-variable conditions
- Property specifications for workflow modelling
- Business processes resource management using rewriting logic and deep-learning-based predictive monitoring
- Refactoring of multi-instance BPMN processes with time and resources
- Bounded model checking of multitask PLC ST programs with preemption using rewriting modulo SMT
This page was built for publication: Symbolic specification and verification of data-aware BPMN processes using rewriting modulo SMT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164536)