Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data

DOI10.1007/978-3-319-41579-6_7MaRDI QIDQ3179169zbMATH OpenOpenAlexFDO

Authors Hadrien Bride, Fabien Peureux, Olga Kouchnarenko

Publication date 21 December 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41579-6_7

zbMATH Keywords

coloured Petri netsconstraint systemmodalitiesworkflows

Mathematics Subject Classification ID

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

• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• Verifying generalized soundness of workflow nets
• A system for deduction-based formal verification of workflow-oriented software models
• Verification problems in conceptual workflow specifications
• Verification of workflow nets
• Verification of workflow task structures: A Petri-net-based approach

Cites work

• An SMT-based approach to coverability analysis
• Consistency in networks of relations
• scientific article; zbMATH DE number 1670793 (Why is no real title available?)
• scientific article; zbMATH DE number 1302045 (Why is no real title available?)
• scientific article; zbMATH DE number 2006480 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Refinement and asynchronous composition of modal Petri nets

Cited in

(1)

• Verification and validation of formal data-centric business models

This page was built for publication: Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data

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