Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data

DOI10.1007/978-3-319-41579-6_7zbMath1461.68111OpenAlexW2480564986MaRDI QIDQ3179169

Fabien Peureux, Hadrien Bride, 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

workflowscoloured Petri netsmodalitiesconstraint system

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)

Cites Work

• Consistency in networks of relations
• Refinement and Asynchronous Composition of Modal Petri Nets
• An SMT-Based Approach to Coverability Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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