Verification of Data-Aware Processes Via Satisfiability Modulo Theories:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer
2023
|
| Ausgabe: | 1st ed |
| Schriftenreihe: | Lecture Notes in Business Information Processing Series
v.470 |
| Schlagworte: | |
| Online-Zugang: | DE-2070s |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 Online-Ressource (335 Seiten) |
| ISBN: | 9783031427466 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV050102141 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 241218s2023 xx o|||| 00||| eng d | ||
| 020 | |a 9783031427466 |9 978-3-031-42746-6 | ||
| 035 | |a (ZDB-30-PQE)EBC30836052 | ||
| 035 | |a (ZDB-30-PAD)EBC30836052 | ||
| 035 | |a (ZDB-89-EBL)EBL30836052 | ||
| 035 | |a (OCoLC)1406839224 | ||
| 035 | |a (DE-599)BVBBV050102141 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-2070s | ||
| 082 | 0 | |a 658.05 | |
| 084 | |a QH 500 |0 (DE-625)141607: |2 rvk | ||
| 100 | 1 | |a Gianola, Alessandro |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Verification of Data-Aware Processes Via Satisfiability Modulo Theories |
| 250 | |a 1st ed | ||
| 264 | 1 | |a Cham |b Springer |c 2023 | |
| 264 | 4 | |c ©2023 | |
| 300 | |a 1 Online-Ressource (335 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Lecture Notes in Business Information Processing Series |v v.470 | |
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 505 | 8 | |a Intro -- Preface -- Contributions -- Book Structure -- Detailed Index of Main Notions -- Acknowledgements -- Contents -- Acronyms -- Chapter 1 Introduction -- 1.1 Overview -- 1.1.1 Finite-State Model Checking -- 1.1.2 Verification of Data-Aware Processes -- 1.1.3 Infinite-State Model Checking: from Parameterized Systems to SMT Verification -- 1.1.4 Main Goal of the Book -- 1.2 Related Literature -- 1.2.1 Formal Models for Data-Aware (Business) Processes -- 1.2.2 Verification of Data-Aware Processes -- 1.2.3 Model Checking for Infinite-State Systems using SMT-based Techniques -- 1.3 Contributions of the Book -- 1.3.1 Contributions of the First Part -- 1.3.2 Contributions of the Second Part -- 1.3.3 Contributions of the Third Part -- Part I Foundations of SMT-based Safety Verification of Artifact Systems -- Chapter 2 Preliminaries from Model Theory and Logic -- 2.1 Preliminaries -- 2.2 Substructures and Embeddings -- 2.3 Robinson Diagrams and Amalgamation -- 2.4 Model Completions -- 2.5 Satisfiability Modulo Theories (SMT) -- 2.6 Definable Extensions and λ-Notations -- 2.7 Typed Relational Databases with Constraints -- Chapter 3 Array-Based Artifact Systems: General Framework -- 3.1 Read-Only DB Schemas -- 3.1.1 Relational View of DB Schemas -- 3.1.2 DB Extended-Schemas -- 3.2 Array-Based Artifact Systems -- 3.2.1 Simple Artifact Systems -- 3.2.2 Universal Relational Artifact Systems -- Chapter 4 Safety Verification of Artifact Systems -- 4.1 Model-Theoretic Requirements of DB Schemas -- 4.1.1 Finite Model Property -- 4.1.2 The Constraint Satisfiabilty Problem Is Decidable -- 4.1.3 Model Completion of DB Theories -- 4.1.4 Assumption for the Technical Machinery -- 4.2 Parameterized Safety via Backward Reachability for SASs -- 4.3 Parameterized Safety via Backward Reachability for U-RASs and RASs | |
| 505 | 8 | |a 4.4 Handling U-RASs via SMT-based Backward Reachability -- 4.4.1 Eliminating Universal Quantifiers from U-RASs -- 4.4.2 Modified SMT-based Backward Search for U-RASs -- 4.5 Effectiveness and Soundness for BReachRAS -- 4.6 Examples of DB Schemas Satisfying the Assumption -- 4.6.1 Examples of DB Theories with the Finite Model Property -- 4.6.2 Examples of Model Completions of DB Theories -- 4.7 Discussion -- 4.7.1 Model Checking via Quantifier Elimination in Model Completions -- 4.7.2 Freshness and Related Approaches -- Chapter 5 Decidability Results via Termination of the Verification Machinery -- 5.1 Termination Result for SASs -- 5.2 Termination Results for RASs -- 5.2.1 Termination with Local Updates -- 5.2.2 Proof of Theorem 5.2 and an Example of (Strongly) Local RAS -- 5.2.3 Termination with Tree-Like Signatures -- 5.2.4 Proof of Theorem 5.4 and an Example of Tree-Like RAS -- 5.3 Operations Representable as Strongly Local Transitions -- 5.3.1 Deletion Updates -- 5.3.2 Insertion Updates -- 5.3.3 Propagation Updates -- 5.3.4 Bulk Updates -- 5.4 A Summary of the Comparison with Related DAP Formalisms -- Part II Automated Reasoning Techniques for Data-Aware Process Verification -- Chapter 6 Preliminaries for (Uniform) Interpolation -- 6.1 General Preliminaries -- 6.1.1 Preliminaries on Uniform Interpolants or Covers -- 6.2 Preliminaries on the Equality Interpolating Condition and Beth Definability -- Chapter 7 Uniform Interpolation for Database Theories (and Beyond) -- 7.1 Uniform Interpolation, Covers and Model Completions -- 7.2 Model-Checking Applications -- 7.2.1 Covers for Database Schemas -- 7.3 Covers via Constrained Superposition -- 7.4 Complexity Analysis of the Fragment for Database-Driven Applications -- 7.5 An Extension of the Constrained Superposition Calculus -- 7.6 Remarks on MCMT Implementation | |
| 505 | 8 | |a Chapter 8 Combination of Uniform Interpolants for DAPs Verification -- 8.1 Interpolation, Equality Interpolating Condition and Beth Definability -- 8.2 Convex Theories -- 8.3 The Convex Combined Cover Algorithm -- 8.3.1 The Necessity of the Equality Interpolating Condition. -- 8.3.2 An Example of Cover Computation -- 8.4 The Non-Convex Case: a Counterexample -- 8.5 Tame Combinations -- 8.5.1 An Example of Combined Covers for the Tame Combination -- 8.6 Discussion on Related Works on Covers -- Chapter 9 MCMT: a Concrete Model Checker for DAPs -- 9.1 MCMT: a Brief Overview -- 9.2 Basic Syntax of MCMT -- 9.3 MCMT Specifications: Database-Driven Mode -- 9.3.1 DB Schema Declaration -- 9.3.2 Initialization -- 9.3.3 Unsafe States -- 9.3.4 Elimination of Existentially Quantified Variables -- 9.3.5 Transitions -- 9.3.6 Universal Quantifiers in Guards -- 9.4 Running MCMT -- 9.4.1 Displayed Information -- 9.5 Experiments on Concrete Data-Aware Processes -- Part III Applications -- Chapter 10 Business Process Management and Petri Nets: Preliminaries -- 10.1 Business Process Management -- 10.1.1 BPMN Basic Blocks and Concepts -- 10.1.2 Process Cases and Execution Semantics: an Informal View -- 10.1.3 Complex BPMN blocks -- 10.2 Colored Petri Nets -- 10.2.1 Data Types -- 10.2.2 Preliminary Notions for Colored Petri Nets -- 10.2.3 Definition of Colored Petri Nets -- 10.2.4 Semantics of CPNs -- 10.2.5 Execution Semantics of CPNs -- Chapter 11 DABs: a Theoretical Framework for Data-Aware BPMN -- 11.1 Data-Aware BPMN: Main Contributions -- 11.2 Data-Aware BPMN -- 11.2.1 The Data Schema -- 11.2.2 Tasks, Events, and Impact on Data -- 11.2.3 Process Schema -- 11.2.4 Execution Semantics -- 11.3 Parameterized Safety Verification of DABs -- 11.3.1 Array-Based Artifact Systems and Safety Checking: a Brief Summary -- 11.3.2 Verification Problems for DABs | |
| 505 | 8 | |a 11.3.3 Translating DABs into Array-Based Artifact Systems -- 11.3.4 Verification Results -- 11.4 First Experiments with MCMT -- Chapter 12 delta-BPMN: the Operational and Implemented Counterpart of DABs -- 12.1 From DABs to delta-BPMN -- 12.1.1 DABs: a Symbolic Bridge Between RASs and delta-BPMN -- 12.2 Requirement Analysis for delta-BPMN and Related Existing Tools -- 12.3 The PDMML Language -- 12.3.1 Sources of Data and their Definition -- 12.3.2 The Process Component of delta-BPMN -- 12.3.3 Inspecting and Manipulating Data with PDMML -- 12.3.4 Guards for Conditional Flows -- 12.4 delta-BPMN in Action -- 12.4.1 Modeling delta-BPMN Processes with Camunda -- 12.4.2 Encoding delta-BPMN Camunda Processes in MCMT -- 12.5 A Brief Discussion on Limitations of DABs and delta-BPMN -- Chapter 13 Catalog Object-Aware Nets -- 13.1 The COA-net Formal Model -- 13.1.1 Modeling Capabilities -- 13.2 From COA-nets to MCMT -- 13.2.1 Universal RASs: a Summary -- 13.2.2 Encoding COA-nets into MCMT -- 13.2.3 Encoding Example -- 13.3 Unsafety Checking of COA-nets and its Formal Properties -- 13.3.1 Unsafety Properties -- 13.3.2 Verification Problem -- 13.3.3 Soundness and Completeness -- 13.3.4 Conservative COA-nets -- 13.3.5 Bounded COA-nets -- 13.3.6 Discussion on Undecidability of COA-nets -- 13.4 Comparison to Other Models -- Chapter 14 Conclusions -- 14.1 Overview of the First Part and Relevant FutureWork -- 14.2 Overview of the Second Part and Relevant FutureWork -- 14.3 Conclusions for the Third Part and Relevant FutureWork -- 14.3.1 Data-Aware BPMN and delta-BPMN -- 14.3.2 COA-nets -- 14.4 Additional Open Directions -- 14.4.1 Verification of Artifact Systems Under Ontologies -- 14.4.2 Safety Verification of (Data-Aware) Multi-Agent Systems -- 14.5 Final Considerations -- Correction to: Verification of Data-Aware Processes via Satisfiability Modulo Theories | |
| 505 | 8 | |a Correction to: A. Gianola: Verification of Data-Aware Processes via Satisfiability Modulo Theories, LNBIP 470, https://doi.org/10.1007/978-3-031-42746-6 -- References | |
| 650 | 4 | |a Business-Data processing | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Gianola, Alessandro |t Verification of Data-Aware Processes Via Satisfiability Modulo Theories |d Cham : Springer,c2023 |z 9783031427459 |
| 912 | |a ZDB-30-PQE | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035439303 | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/hwr/detail.action?docID=30836052 |l DE-2070s |p ZDB-30-PQE |q HWR_PDA_PQE |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1820889672849555456 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Gianola, Alessandro |
| author_facet | Gianola, Alessandro |
| author_role | aut |
| author_sort | Gianola, Alessandro |
| author_variant | a g ag |
| building | Verbundindex |
| bvnumber | BV050102141 |
| classification_rvk | QH 500 |
| collection | ZDB-30-PQE |
| contents | Intro -- Preface -- Contributions -- Book Structure -- Detailed Index of Main Notions -- Acknowledgements -- Contents -- Acronyms -- Chapter 1 Introduction -- 1.1 Overview -- 1.1.1 Finite-State Model Checking -- 1.1.2 Verification of Data-Aware Processes -- 1.1.3 Infinite-State Model Checking: from Parameterized Systems to SMT Verification -- 1.1.4 Main Goal of the Book -- 1.2 Related Literature -- 1.2.1 Formal Models for Data-Aware (Business) Processes -- 1.2.2 Verification of Data-Aware Processes -- 1.2.3 Model Checking for Infinite-State Systems using SMT-based Techniques -- 1.3 Contributions of the Book -- 1.3.1 Contributions of the First Part -- 1.3.2 Contributions of the Second Part -- 1.3.3 Contributions of the Third Part -- Part I Foundations of SMT-based Safety Verification of Artifact Systems -- Chapter 2 Preliminaries from Model Theory and Logic -- 2.1 Preliminaries -- 2.2 Substructures and Embeddings -- 2.3 Robinson Diagrams and Amalgamation -- 2.4 Model Completions -- 2.5 Satisfiability Modulo Theories (SMT) -- 2.6 Definable Extensions and λ-Notations -- 2.7 Typed Relational Databases with Constraints -- Chapter 3 Array-Based Artifact Systems: General Framework -- 3.1 Read-Only DB Schemas -- 3.1.1 Relational View of DB Schemas -- 3.1.2 DB Extended-Schemas -- 3.2 Array-Based Artifact Systems -- 3.2.1 Simple Artifact Systems -- 3.2.2 Universal Relational Artifact Systems -- Chapter 4 Safety Verification of Artifact Systems -- 4.1 Model-Theoretic Requirements of DB Schemas -- 4.1.1 Finite Model Property -- 4.1.2 The Constraint Satisfiabilty Problem Is Decidable -- 4.1.3 Model Completion of DB Theories -- 4.1.4 Assumption for the Technical Machinery -- 4.2 Parameterized Safety via Backward Reachability for SASs -- 4.3 Parameterized Safety via Backward Reachability for U-RASs and RASs 4.4 Handling U-RASs via SMT-based Backward Reachability -- 4.4.1 Eliminating Universal Quantifiers from U-RASs -- 4.4.2 Modified SMT-based Backward Search for U-RASs -- 4.5 Effectiveness and Soundness for BReachRAS -- 4.6 Examples of DB Schemas Satisfying the Assumption -- 4.6.1 Examples of DB Theories with the Finite Model Property -- 4.6.2 Examples of Model Completions of DB Theories -- 4.7 Discussion -- 4.7.1 Model Checking via Quantifier Elimination in Model Completions -- 4.7.2 Freshness and Related Approaches -- Chapter 5 Decidability Results via Termination of the Verification Machinery -- 5.1 Termination Result for SASs -- 5.2 Termination Results for RASs -- 5.2.1 Termination with Local Updates -- 5.2.2 Proof of Theorem 5.2 and an Example of (Strongly) Local RAS -- 5.2.3 Termination with Tree-Like Signatures -- 5.2.4 Proof of Theorem 5.4 and an Example of Tree-Like RAS -- 5.3 Operations Representable as Strongly Local Transitions -- 5.3.1 Deletion Updates -- 5.3.2 Insertion Updates -- 5.3.3 Propagation Updates -- 5.3.4 Bulk Updates -- 5.4 A Summary of the Comparison with Related DAP Formalisms -- Part II Automated Reasoning Techniques for Data-Aware Process Verification -- Chapter 6 Preliminaries for (Uniform) Interpolation -- 6.1 General Preliminaries -- 6.1.1 Preliminaries on Uniform Interpolants or Covers -- 6.2 Preliminaries on the Equality Interpolating Condition and Beth Definability -- Chapter 7 Uniform Interpolation for Database Theories (and Beyond) -- 7.1 Uniform Interpolation, Covers and Model Completions -- 7.2 Model-Checking Applications -- 7.2.1 Covers for Database Schemas -- 7.3 Covers via Constrained Superposition -- 7.4 Complexity Analysis of the Fragment for Database-Driven Applications -- 7.5 An Extension of the Constrained Superposition Calculus -- 7.6 Remarks on MCMT Implementation Chapter 8 Combination of Uniform Interpolants for DAPs Verification -- 8.1 Interpolation, Equality Interpolating Condition and Beth Definability -- 8.2 Convex Theories -- 8.3 The Convex Combined Cover Algorithm -- 8.3.1 The Necessity of the Equality Interpolating Condition. -- 8.3.2 An Example of Cover Computation -- 8.4 The Non-Convex Case: a Counterexample -- 8.5 Tame Combinations -- 8.5.1 An Example of Combined Covers for the Tame Combination -- 8.6 Discussion on Related Works on Covers -- Chapter 9 MCMT: a Concrete Model Checker for DAPs -- 9.1 MCMT: a Brief Overview -- 9.2 Basic Syntax of MCMT -- 9.3 MCMT Specifications: Database-Driven Mode -- 9.3.1 DB Schema Declaration -- 9.3.2 Initialization -- 9.3.3 Unsafe States -- 9.3.4 Elimination of Existentially Quantified Variables -- 9.3.5 Transitions -- 9.3.6 Universal Quantifiers in Guards -- 9.4 Running MCMT -- 9.4.1 Displayed Information -- 9.5 Experiments on Concrete Data-Aware Processes -- Part III Applications -- Chapter 10 Business Process Management and Petri Nets: Preliminaries -- 10.1 Business Process Management -- 10.1.1 BPMN Basic Blocks and Concepts -- 10.1.2 Process Cases and Execution Semantics: an Informal View -- 10.1.3 Complex BPMN blocks -- 10.2 Colored Petri Nets -- 10.2.1 Data Types -- 10.2.2 Preliminary Notions for Colored Petri Nets -- 10.2.3 Definition of Colored Petri Nets -- 10.2.4 Semantics of CPNs -- 10.2.5 Execution Semantics of CPNs -- Chapter 11 DABs: a Theoretical Framework for Data-Aware BPMN -- 11.1 Data-Aware BPMN: Main Contributions -- 11.2 Data-Aware BPMN -- 11.2.1 The Data Schema -- 11.2.2 Tasks, Events, and Impact on Data -- 11.2.3 Process Schema -- 11.2.4 Execution Semantics -- 11.3 Parameterized Safety Verification of DABs -- 11.3.1 Array-Based Artifact Systems and Safety Checking: a Brief Summary -- 11.3.2 Verification Problems for DABs 11.3.3 Translating DABs into Array-Based Artifact Systems -- 11.3.4 Verification Results -- 11.4 First Experiments with MCMT -- Chapter 12 delta-BPMN: the Operational and Implemented Counterpart of DABs -- 12.1 From DABs to delta-BPMN -- 12.1.1 DABs: a Symbolic Bridge Between RASs and delta-BPMN -- 12.2 Requirement Analysis for delta-BPMN and Related Existing Tools -- 12.3 The PDMML Language -- 12.3.1 Sources of Data and their Definition -- 12.3.2 The Process Component of delta-BPMN -- 12.3.3 Inspecting and Manipulating Data with PDMML -- 12.3.4 Guards for Conditional Flows -- 12.4 delta-BPMN in Action -- 12.4.1 Modeling delta-BPMN Processes with Camunda -- 12.4.2 Encoding delta-BPMN Camunda Processes in MCMT -- 12.5 A Brief Discussion on Limitations of DABs and delta-BPMN -- Chapter 13 Catalog Object-Aware Nets -- 13.1 The COA-net Formal Model -- 13.1.1 Modeling Capabilities -- 13.2 From COA-nets to MCMT -- 13.2.1 Universal RASs: a Summary -- 13.2.2 Encoding COA-nets into MCMT -- 13.2.3 Encoding Example -- 13.3 Unsafety Checking of COA-nets and its Formal Properties -- 13.3.1 Unsafety Properties -- 13.3.2 Verification Problem -- 13.3.3 Soundness and Completeness -- 13.3.4 Conservative COA-nets -- 13.3.5 Bounded COA-nets -- 13.3.6 Discussion on Undecidability of COA-nets -- 13.4 Comparison to Other Models -- Chapter 14 Conclusions -- 14.1 Overview of the First Part and Relevant FutureWork -- 14.2 Overview of the Second Part and Relevant FutureWork -- 14.3 Conclusions for the Third Part and Relevant FutureWork -- 14.3.1 Data-Aware BPMN and delta-BPMN -- 14.3.2 COA-nets -- 14.4 Additional Open Directions -- 14.4.1 Verification of Artifact Systems Under Ontologies -- 14.4.2 Safety Verification of (Data-Aware) Multi-Agent Systems -- 14.5 Final Considerations -- Correction to: Verification of Data-Aware Processes via Satisfiability Modulo Theories Correction to: A. Gianola: Verification of Data-Aware Processes via Satisfiability Modulo Theories, LNBIP 470, https://doi.org/10.1007/978-3-031-42746-6 -- References |
| ctrlnum | (ZDB-30-PQE)EBC30836052 (ZDB-30-PAD)EBC30836052 (ZDB-89-EBL)EBL30836052 (OCoLC)1406839224 (DE-599)BVBBV050102141 |
| dewey-full | 658.05 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.05 |
| dewey-search | 658.05 |
| dewey-sort | 3658.05 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Wirtschaftswissenschaften |
| edition | 1st ed |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV050102141</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">241218s2023 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031427466</subfield><subfield code="9">978-3-031-42746-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC30836052</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PAD)EBC30836052</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL30836052</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1406839224</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050102141</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-2070s</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.05</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 500</subfield><subfield code="0">(DE-625)141607:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gianola, Alessandro</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Verification of Data-Aware Processes Via Satisfiability Modulo Theories</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">2023</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (335 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Lecture Notes in Business Information Processing Series</subfield><subfield code="v">v.470</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Intro -- Preface -- Contributions -- Book Structure -- Detailed Index of Main Notions -- Acknowledgements -- Contents -- Acronyms -- Chapter 1 Introduction -- 1.1 Overview -- 1.1.1 Finite-State Model Checking -- 1.1.2 Verification of Data-Aware Processes -- 1.1.3 Infinite-State Model Checking: from Parameterized Systems to SMT Verification -- 1.1.4 Main Goal of the Book -- 1.2 Related Literature -- 1.2.1 Formal Models for Data-Aware (Business) Processes -- 1.2.2 Verification of Data-Aware Processes -- 1.2.3 Model Checking for Infinite-State Systems using SMT-based Techniques -- 1.3 Contributions of the Book -- 1.3.1 Contributions of the First Part -- 1.3.2 Contributions of the Second Part -- 1.3.3 Contributions of the Third Part -- Part I Foundations of SMT-based Safety Verification of Artifact Systems -- Chapter 2 Preliminaries from Model Theory and Logic -- 2.1 Preliminaries -- 2.2 Substructures and Embeddings -- 2.3 Robinson Diagrams and Amalgamation -- 2.4 Model Completions -- 2.5 Satisfiability Modulo Theories (SMT) -- 2.6 Definable Extensions and λ-Notations -- 2.7 Typed Relational Databases with Constraints -- Chapter 3 Array-Based Artifact Systems: General Framework -- 3.1 Read-Only DB Schemas -- 3.1.1 Relational View of DB Schemas -- 3.1.2 DB Extended-Schemas -- 3.2 Array-Based Artifact Systems -- 3.2.1 Simple Artifact Systems -- 3.2.2 Universal Relational Artifact Systems -- Chapter 4 Safety Verification of Artifact Systems -- 4.1 Model-Theoretic Requirements of DB Schemas -- 4.1.1 Finite Model Property -- 4.1.2 The Constraint Satisfiabilty Problem Is Decidable -- 4.1.3 Model Completion of DB Theories -- 4.1.4 Assumption for the Technical Machinery -- 4.2 Parameterized Safety via Backward Reachability for SASs -- 4.3 Parameterized Safety via Backward Reachability for U-RASs and RASs</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">4.4 Handling U-RASs via SMT-based Backward Reachability -- 4.4.1 Eliminating Universal Quantifiers from U-RASs -- 4.4.2 Modified SMT-based Backward Search for U-RASs -- 4.5 Effectiveness and Soundness for BReachRAS -- 4.6 Examples of DB Schemas Satisfying the Assumption -- 4.6.1 Examples of DB Theories with the Finite Model Property -- 4.6.2 Examples of Model Completions of DB Theories -- 4.7 Discussion -- 4.7.1 Model Checking via Quantifier Elimination in Model Completions -- 4.7.2 Freshness and Related Approaches -- Chapter 5 Decidability Results via Termination of the Verification Machinery -- 5.1 Termination Result for SASs -- 5.2 Termination Results for RASs -- 5.2.1 Termination with Local Updates -- 5.2.2 Proof of Theorem 5.2 and an Example of (Strongly) Local RAS -- 5.2.3 Termination with Tree-Like Signatures -- 5.2.4 Proof of Theorem 5.4 and an Example of Tree-Like RAS -- 5.3 Operations Representable as Strongly Local Transitions -- 5.3.1 Deletion Updates -- 5.3.2 Insertion Updates -- 5.3.3 Propagation Updates -- 5.3.4 Bulk Updates -- 5.4 A Summary of the Comparison with Related DAP Formalisms -- Part II Automated Reasoning Techniques for Data-Aware Process Verification -- Chapter 6 Preliminaries for (Uniform) Interpolation -- 6.1 General Preliminaries -- 6.1.1 Preliminaries on Uniform Interpolants or Covers -- 6.2 Preliminaries on the Equality Interpolating Condition and Beth Definability -- Chapter 7 Uniform Interpolation for Database Theories (and Beyond) -- 7.1 Uniform Interpolation, Covers and Model Completions -- 7.2 Model-Checking Applications -- 7.2.1 Covers for Database Schemas -- 7.3 Covers via Constrained Superposition -- 7.4 Complexity Analysis of the Fragment for Database-Driven Applications -- 7.5 An Extension of the Constrained Superposition Calculus -- 7.6 Remarks on MCMT Implementation</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Chapter 8 Combination of Uniform Interpolants for DAPs Verification -- 8.1 Interpolation, Equality Interpolating Condition and Beth Definability -- 8.2 Convex Theories -- 8.3 The Convex Combined Cover Algorithm -- 8.3.1 The Necessity of the Equality Interpolating Condition. -- 8.3.2 An Example of Cover Computation -- 8.4 The Non-Convex Case: a Counterexample -- 8.5 Tame Combinations -- 8.5.1 An Example of Combined Covers for the Tame Combination -- 8.6 Discussion on Related Works on Covers -- Chapter 9 MCMT: a Concrete Model Checker for DAPs -- 9.1 MCMT: a Brief Overview -- 9.2 Basic Syntax of MCMT -- 9.3 MCMT Specifications: Database-Driven Mode -- 9.3.1 DB Schema Declaration -- 9.3.2 Initialization -- 9.3.3 Unsafe States -- 9.3.4 Elimination of Existentially Quantified Variables -- 9.3.5 Transitions -- 9.3.6 Universal Quantifiers in Guards -- 9.4 Running MCMT -- 9.4.1 Displayed Information -- 9.5 Experiments on Concrete Data-Aware Processes -- Part III Applications -- Chapter 10 Business Process Management and Petri Nets: Preliminaries -- 10.1 Business Process Management -- 10.1.1 BPMN Basic Blocks and Concepts -- 10.1.2 Process Cases and Execution Semantics: an Informal View -- 10.1.3 Complex BPMN blocks -- 10.2 Colored Petri Nets -- 10.2.1 Data Types -- 10.2.2 Preliminary Notions for Colored Petri Nets -- 10.2.3 Definition of Colored Petri Nets -- 10.2.4 Semantics of CPNs -- 10.2.5 Execution Semantics of CPNs -- Chapter 11 DABs: a Theoretical Framework for Data-Aware BPMN -- 11.1 Data-Aware BPMN: Main Contributions -- 11.2 Data-Aware BPMN -- 11.2.1 The Data Schema -- 11.2.2 Tasks, Events, and Impact on Data -- 11.2.3 Process Schema -- 11.2.4 Execution Semantics -- 11.3 Parameterized Safety Verification of DABs -- 11.3.1 Array-Based Artifact Systems and Safety Checking: a Brief Summary -- 11.3.2 Verification Problems for DABs</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">11.3.3 Translating DABs into Array-Based Artifact Systems -- 11.3.4 Verification Results -- 11.4 First Experiments with MCMT -- Chapter 12 delta-BPMN: the Operational and Implemented Counterpart of DABs -- 12.1 From DABs to delta-BPMN -- 12.1.1 DABs: a Symbolic Bridge Between RASs and delta-BPMN -- 12.2 Requirement Analysis for delta-BPMN and Related Existing Tools -- 12.3 The PDMML Language -- 12.3.1 Sources of Data and their Definition -- 12.3.2 The Process Component of delta-BPMN -- 12.3.3 Inspecting and Manipulating Data with PDMML -- 12.3.4 Guards for Conditional Flows -- 12.4 delta-BPMN in Action -- 12.4.1 Modeling delta-BPMN Processes with Camunda -- 12.4.2 Encoding delta-BPMN Camunda Processes in MCMT -- 12.5 A Brief Discussion on Limitations of DABs and delta-BPMN -- Chapter 13 Catalog Object-Aware Nets -- 13.1 The COA-net Formal Model -- 13.1.1 Modeling Capabilities -- 13.2 From COA-nets to MCMT -- 13.2.1 Universal RASs: a Summary -- 13.2.2 Encoding COA-nets into MCMT -- 13.2.3 Encoding Example -- 13.3 Unsafety Checking of COA-nets and its Formal Properties -- 13.3.1 Unsafety Properties -- 13.3.2 Verification Problem -- 13.3.3 Soundness and Completeness -- 13.3.4 Conservative COA-nets -- 13.3.5 Bounded COA-nets -- 13.3.6 Discussion on Undecidability of COA-nets -- 13.4 Comparison to Other Models -- Chapter 14 Conclusions -- 14.1 Overview of the First Part and Relevant FutureWork -- 14.2 Overview of the Second Part and Relevant FutureWork -- 14.3 Conclusions for the Third Part and Relevant FutureWork -- 14.3.1 Data-Aware BPMN and delta-BPMN -- 14.3.2 COA-nets -- 14.4 Additional Open Directions -- 14.4.1 Verification of Artifact Systems Under Ontologies -- 14.4.2 Safety Verification of (Data-Aware) Multi-Agent Systems -- 14.5 Final Considerations -- Correction to: Verification of Data-Aware Processes via Satisfiability Modulo Theories</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Correction to: A. Gianola: Verification of Data-Aware Processes via Satisfiability Modulo Theories, LNBIP 470, https://doi.org/10.1007/978-3-031-42746-6 -- References</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business-Data processing</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Gianola, Alessandro</subfield><subfield code="t">Verification of Data-Aware Processes Via Satisfiability Modulo Theories</subfield><subfield code="d">Cham : Springer,c2023</subfield><subfield code="z">9783031427459</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035439303</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/hwr/detail.action?docID=30836052</subfield><subfield code="l">DE-2070s</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">HWR_PDA_PQE</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV050102141 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T19:01:53Z |
| institution | BVB |
| isbn | 9783031427466 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035439303 |
| oclc_num | 1406839224 |
| open_access_boolean | |
| owner | DE-2070s |
| owner_facet | DE-2070s |
| physical | 1 Online-Ressource (335 Seiten) |
| psigel | ZDB-30-PQE ZDB-30-PQE HWR_PDA_PQE |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Springer |
| record_format | marc |
| series2 | Lecture Notes in Business Information Processing Series |
| spelling | Gianola, Alessandro Verfasser aut Verification of Data-Aware Processes Via Satisfiability Modulo Theories 1st ed Cham Springer 2023 ©2023 1 Online-Ressource (335 Seiten) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Business Information Processing Series v.470 Description based on publisher supplied metadata and other sources Intro -- Preface -- Contributions -- Book Structure -- Detailed Index of Main Notions -- Acknowledgements -- Contents -- Acronyms -- Chapter 1 Introduction -- 1.1 Overview -- 1.1.1 Finite-State Model Checking -- 1.1.2 Verification of Data-Aware Processes -- 1.1.3 Infinite-State Model Checking: from Parameterized Systems to SMT Verification -- 1.1.4 Main Goal of the Book -- 1.2 Related Literature -- 1.2.1 Formal Models for Data-Aware (Business) Processes -- 1.2.2 Verification of Data-Aware Processes -- 1.2.3 Model Checking for Infinite-State Systems using SMT-based Techniques -- 1.3 Contributions of the Book -- 1.3.1 Contributions of the First Part -- 1.3.2 Contributions of the Second Part -- 1.3.3 Contributions of the Third Part -- Part I Foundations of SMT-based Safety Verification of Artifact Systems -- Chapter 2 Preliminaries from Model Theory and Logic -- 2.1 Preliminaries -- 2.2 Substructures and Embeddings -- 2.3 Robinson Diagrams and Amalgamation -- 2.4 Model Completions -- 2.5 Satisfiability Modulo Theories (SMT) -- 2.6 Definable Extensions and λ-Notations -- 2.7 Typed Relational Databases with Constraints -- Chapter 3 Array-Based Artifact Systems: General Framework -- 3.1 Read-Only DB Schemas -- 3.1.1 Relational View of DB Schemas -- 3.1.2 DB Extended-Schemas -- 3.2 Array-Based Artifact Systems -- 3.2.1 Simple Artifact Systems -- 3.2.2 Universal Relational Artifact Systems -- Chapter 4 Safety Verification of Artifact Systems -- 4.1 Model-Theoretic Requirements of DB Schemas -- 4.1.1 Finite Model Property -- 4.1.2 The Constraint Satisfiabilty Problem Is Decidable -- 4.1.3 Model Completion of DB Theories -- 4.1.4 Assumption for the Technical Machinery -- 4.2 Parameterized Safety via Backward Reachability for SASs -- 4.3 Parameterized Safety via Backward Reachability for U-RASs and RASs 4.4 Handling U-RASs via SMT-based Backward Reachability -- 4.4.1 Eliminating Universal Quantifiers from U-RASs -- 4.4.2 Modified SMT-based Backward Search for U-RASs -- 4.5 Effectiveness and Soundness for BReachRAS -- 4.6 Examples of DB Schemas Satisfying the Assumption -- 4.6.1 Examples of DB Theories with the Finite Model Property -- 4.6.2 Examples of Model Completions of DB Theories -- 4.7 Discussion -- 4.7.1 Model Checking via Quantifier Elimination in Model Completions -- 4.7.2 Freshness and Related Approaches -- Chapter 5 Decidability Results via Termination of the Verification Machinery -- 5.1 Termination Result for SASs -- 5.2 Termination Results for RASs -- 5.2.1 Termination with Local Updates -- 5.2.2 Proof of Theorem 5.2 and an Example of (Strongly) Local RAS -- 5.2.3 Termination with Tree-Like Signatures -- 5.2.4 Proof of Theorem 5.4 and an Example of Tree-Like RAS -- 5.3 Operations Representable as Strongly Local Transitions -- 5.3.1 Deletion Updates -- 5.3.2 Insertion Updates -- 5.3.3 Propagation Updates -- 5.3.4 Bulk Updates -- 5.4 A Summary of the Comparison with Related DAP Formalisms -- Part II Automated Reasoning Techniques for Data-Aware Process Verification -- Chapter 6 Preliminaries for (Uniform) Interpolation -- 6.1 General Preliminaries -- 6.1.1 Preliminaries on Uniform Interpolants or Covers -- 6.2 Preliminaries on the Equality Interpolating Condition and Beth Definability -- Chapter 7 Uniform Interpolation for Database Theories (and Beyond) -- 7.1 Uniform Interpolation, Covers and Model Completions -- 7.2 Model-Checking Applications -- 7.2.1 Covers for Database Schemas -- 7.3 Covers via Constrained Superposition -- 7.4 Complexity Analysis of the Fragment for Database-Driven Applications -- 7.5 An Extension of the Constrained Superposition Calculus -- 7.6 Remarks on MCMT Implementation Chapter 8 Combination of Uniform Interpolants for DAPs Verification -- 8.1 Interpolation, Equality Interpolating Condition and Beth Definability -- 8.2 Convex Theories -- 8.3 The Convex Combined Cover Algorithm -- 8.3.1 The Necessity of the Equality Interpolating Condition. -- 8.3.2 An Example of Cover Computation -- 8.4 The Non-Convex Case: a Counterexample -- 8.5 Tame Combinations -- 8.5.1 An Example of Combined Covers for the Tame Combination -- 8.6 Discussion on Related Works on Covers -- Chapter 9 MCMT: a Concrete Model Checker for DAPs -- 9.1 MCMT: a Brief Overview -- 9.2 Basic Syntax of MCMT -- 9.3 MCMT Specifications: Database-Driven Mode -- 9.3.1 DB Schema Declaration -- 9.3.2 Initialization -- 9.3.3 Unsafe States -- 9.3.4 Elimination of Existentially Quantified Variables -- 9.3.5 Transitions -- 9.3.6 Universal Quantifiers in Guards -- 9.4 Running MCMT -- 9.4.1 Displayed Information -- 9.5 Experiments on Concrete Data-Aware Processes -- Part III Applications -- Chapter 10 Business Process Management and Petri Nets: Preliminaries -- 10.1 Business Process Management -- 10.1.1 BPMN Basic Blocks and Concepts -- 10.1.2 Process Cases and Execution Semantics: an Informal View -- 10.1.3 Complex BPMN blocks -- 10.2 Colored Petri Nets -- 10.2.1 Data Types -- 10.2.2 Preliminary Notions for Colored Petri Nets -- 10.2.3 Definition of Colored Petri Nets -- 10.2.4 Semantics of CPNs -- 10.2.5 Execution Semantics of CPNs -- Chapter 11 DABs: a Theoretical Framework for Data-Aware BPMN -- 11.1 Data-Aware BPMN: Main Contributions -- 11.2 Data-Aware BPMN -- 11.2.1 The Data Schema -- 11.2.2 Tasks, Events, and Impact on Data -- 11.2.3 Process Schema -- 11.2.4 Execution Semantics -- 11.3 Parameterized Safety Verification of DABs -- 11.3.1 Array-Based Artifact Systems and Safety Checking: a Brief Summary -- 11.3.2 Verification Problems for DABs 11.3.3 Translating DABs into Array-Based Artifact Systems -- 11.3.4 Verification Results -- 11.4 First Experiments with MCMT -- Chapter 12 delta-BPMN: the Operational and Implemented Counterpart of DABs -- 12.1 From DABs to delta-BPMN -- 12.1.1 DABs: a Symbolic Bridge Between RASs and delta-BPMN -- 12.2 Requirement Analysis for delta-BPMN and Related Existing Tools -- 12.3 The PDMML Language -- 12.3.1 Sources of Data and their Definition -- 12.3.2 The Process Component of delta-BPMN -- 12.3.3 Inspecting and Manipulating Data with PDMML -- 12.3.4 Guards for Conditional Flows -- 12.4 delta-BPMN in Action -- 12.4.1 Modeling delta-BPMN Processes with Camunda -- 12.4.2 Encoding delta-BPMN Camunda Processes in MCMT -- 12.5 A Brief Discussion on Limitations of DABs and delta-BPMN -- Chapter 13 Catalog Object-Aware Nets -- 13.1 The COA-net Formal Model -- 13.1.1 Modeling Capabilities -- 13.2 From COA-nets to MCMT -- 13.2.1 Universal RASs: a Summary -- 13.2.2 Encoding COA-nets into MCMT -- 13.2.3 Encoding Example -- 13.3 Unsafety Checking of COA-nets and its Formal Properties -- 13.3.1 Unsafety Properties -- 13.3.2 Verification Problem -- 13.3.3 Soundness and Completeness -- 13.3.4 Conservative COA-nets -- 13.3.5 Bounded COA-nets -- 13.3.6 Discussion on Undecidability of COA-nets -- 13.4 Comparison to Other Models -- Chapter 14 Conclusions -- 14.1 Overview of the First Part and Relevant FutureWork -- 14.2 Overview of the Second Part and Relevant FutureWork -- 14.3 Conclusions for the Third Part and Relevant FutureWork -- 14.3.1 Data-Aware BPMN and delta-BPMN -- 14.3.2 COA-nets -- 14.4 Additional Open Directions -- 14.4.1 Verification of Artifact Systems Under Ontologies -- 14.4.2 Safety Verification of (Data-Aware) Multi-Agent Systems -- 14.5 Final Considerations -- Correction to: Verification of Data-Aware Processes via Satisfiability Modulo Theories Correction to: A. Gianola: Verification of Data-Aware Processes via Satisfiability Modulo Theories, LNBIP 470, https://doi.org/10.1007/978-3-031-42746-6 -- References Business-Data processing (DE-588)4113937-9 Hochschulschrift gnd-content Erscheint auch als Druck-Ausgabe Gianola, Alessandro Verification of Data-Aware Processes Via Satisfiability Modulo Theories Cham : Springer,c2023 9783031427459 |
| spellingShingle | Gianola, Alessandro Verification of Data-Aware Processes Via Satisfiability Modulo Theories Intro -- Preface -- Contributions -- Book Structure -- Detailed Index of Main Notions -- Acknowledgements -- Contents -- Acronyms -- Chapter 1 Introduction -- 1.1 Overview -- 1.1.1 Finite-State Model Checking -- 1.1.2 Verification of Data-Aware Processes -- 1.1.3 Infinite-State Model Checking: from Parameterized Systems to SMT Verification -- 1.1.4 Main Goal of the Book -- 1.2 Related Literature -- 1.2.1 Formal Models for Data-Aware (Business) Processes -- 1.2.2 Verification of Data-Aware Processes -- 1.2.3 Model Checking for Infinite-State Systems using SMT-based Techniques -- 1.3 Contributions of the Book -- 1.3.1 Contributions of the First Part -- 1.3.2 Contributions of the Second Part -- 1.3.3 Contributions of the Third Part -- Part I Foundations of SMT-based Safety Verification of Artifact Systems -- Chapter 2 Preliminaries from Model Theory and Logic -- 2.1 Preliminaries -- 2.2 Substructures and Embeddings -- 2.3 Robinson Diagrams and Amalgamation -- 2.4 Model Completions -- 2.5 Satisfiability Modulo Theories (SMT) -- 2.6 Definable Extensions and λ-Notations -- 2.7 Typed Relational Databases with Constraints -- Chapter 3 Array-Based Artifact Systems: General Framework -- 3.1 Read-Only DB Schemas -- 3.1.1 Relational View of DB Schemas -- 3.1.2 DB Extended-Schemas -- 3.2 Array-Based Artifact Systems -- 3.2.1 Simple Artifact Systems -- 3.2.2 Universal Relational Artifact Systems -- Chapter 4 Safety Verification of Artifact Systems -- 4.1 Model-Theoretic Requirements of DB Schemas -- 4.1.1 Finite Model Property -- 4.1.2 The Constraint Satisfiabilty Problem Is Decidable -- 4.1.3 Model Completion of DB Theories -- 4.1.4 Assumption for the Technical Machinery -- 4.2 Parameterized Safety via Backward Reachability for SASs -- 4.3 Parameterized Safety via Backward Reachability for U-RASs and RASs 4.4 Handling U-RASs via SMT-based Backward Reachability -- 4.4.1 Eliminating Universal Quantifiers from U-RASs -- 4.4.2 Modified SMT-based Backward Search for U-RASs -- 4.5 Effectiveness and Soundness for BReachRAS -- 4.6 Examples of DB Schemas Satisfying the Assumption -- 4.6.1 Examples of DB Theories with the Finite Model Property -- 4.6.2 Examples of Model Completions of DB Theories -- 4.7 Discussion -- 4.7.1 Model Checking via Quantifier Elimination in Model Completions -- 4.7.2 Freshness and Related Approaches -- Chapter 5 Decidability Results via Termination of the Verification Machinery -- 5.1 Termination Result for SASs -- 5.2 Termination Results for RASs -- 5.2.1 Termination with Local Updates -- 5.2.2 Proof of Theorem 5.2 and an Example of (Strongly) Local RAS -- 5.2.3 Termination with Tree-Like Signatures -- 5.2.4 Proof of Theorem 5.4 and an Example of Tree-Like RAS -- 5.3 Operations Representable as Strongly Local Transitions -- 5.3.1 Deletion Updates -- 5.3.2 Insertion Updates -- 5.3.3 Propagation Updates -- 5.3.4 Bulk Updates -- 5.4 A Summary of the Comparison with Related DAP Formalisms -- Part II Automated Reasoning Techniques for Data-Aware Process Verification -- Chapter 6 Preliminaries for (Uniform) Interpolation -- 6.1 General Preliminaries -- 6.1.1 Preliminaries on Uniform Interpolants or Covers -- 6.2 Preliminaries on the Equality Interpolating Condition and Beth Definability -- Chapter 7 Uniform Interpolation for Database Theories (and Beyond) -- 7.1 Uniform Interpolation, Covers and Model Completions -- 7.2 Model-Checking Applications -- 7.2.1 Covers for Database Schemas -- 7.3 Covers via Constrained Superposition -- 7.4 Complexity Analysis of the Fragment for Database-Driven Applications -- 7.5 An Extension of the Constrained Superposition Calculus -- 7.6 Remarks on MCMT Implementation Chapter 8 Combination of Uniform Interpolants for DAPs Verification -- 8.1 Interpolation, Equality Interpolating Condition and Beth Definability -- 8.2 Convex Theories -- 8.3 The Convex Combined Cover Algorithm -- 8.3.1 The Necessity of the Equality Interpolating Condition. -- 8.3.2 An Example of Cover Computation -- 8.4 The Non-Convex Case: a Counterexample -- 8.5 Tame Combinations -- 8.5.1 An Example of Combined Covers for the Tame Combination -- 8.6 Discussion on Related Works on Covers -- Chapter 9 MCMT: a Concrete Model Checker for DAPs -- 9.1 MCMT: a Brief Overview -- 9.2 Basic Syntax of MCMT -- 9.3 MCMT Specifications: Database-Driven Mode -- 9.3.1 DB Schema Declaration -- 9.3.2 Initialization -- 9.3.3 Unsafe States -- 9.3.4 Elimination of Existentially Quantified Variables -- 9.3.5 Transitions -- 9.3.6 Universal Quantifiers in Guards -- 9.4 Running MCMT -- 9.4.1 Displayed Information -- 9.5 Experiments on Concrete Data-Aware Processes -- Part III Applications -- Chapter 10 Business Process Management and Petri Nets: Preliminaries -- 10.1 Business Process Management -- 10.1.1 BPMN Basic Blocks and Concepts -- 10.1.2 Process Cases and Execution Semantics: an Informal View -- 10.1.3 Complex BPMN blocks -- 10.2 Colored Petri Nets -- 10.2.1 Data Types -- 10.2.2 Preliminary Notions for Colored Petri Nets -- 10.2.3 Definition of Colored Petri Nets -- 10.2.4 Semantics of CPNs -- 10.2.5 Execution Semantics of CPNs -- Chapter 11 DABs: a Theoretical Framework for Data-Aware BPMN -- 11.1 Data-Aware BPMN: Main Contributions -- 11.2 Data-Aware BPMN -- 11.2.1 The Data Schema -- 11.2.2 Tasks, Events, and Impact on Data -- 11.2.3 Process Schema -- 11.2.4 Execution Semantics -- 11.3 Parameterized Safety Verification of DABs -- 11.3.1 Array-Based Artifact Systems and Safety Checking: a Brief Summary -- 11.3.2 Verification Problems for DABs 11.3.3 Translating DABs into Array-Based Artifact Systems -- 11.3.4 Verification Results -- 11.4 First Experiments with MCMT -- Chapter 12 delta-BPMN: the Operational and Implemented Counterpart of DABs -- 12.1 From DABs to delta-BPMN -- 12.1.1 DABs: a Symbolic Bridge Between RASs and delta-BPMN -- 12.2 Requirement Analysis for delta-BPMN and Related Existing Tools -- 12.3 The PDMML Language -- 12.3.1 Sources of Data and their Definition -- 12.3.2 The Process Component of delta-BPMN -- 12.3.3 Inspecting and Manipulating Data with PDMML -- 12.3.4 Guards for Conditional Flows -- 12.4 delta-BPMN in Action -- 12.4.1 Modeling delta-BPMN Processes with Camunda -- 12.4.2 Encoding delta-BPMN Camunda Processes in MCMT -- 12.5 A Brief Discussion on Limitations of DABs and delta-BPMN -- Chapter 13 Catalog Object-Aware Nets -- 13.1 The COA-net Formal Model -- 13.1.1 Modeling Capabilities -- 13.2 From COA-nets to MCMT -- 13.2.1 Universal RASs: a Summary -- 13.2.2 Encoding COA-nets into MCMT -- 13.2.3 Encoding Example -- 13.3 Unsafety Checking of COA-nets and its Formal Properties -- 13.3.1 Unsafety Properties -- 13.3.2 Verification Problem -- 13.3.3 Soundness and Completeness -- 13.3.4 Conservative COA-nets -- 13.3.5 Bounded COA-nets -- 13.3.6 Discussion on Undecidability of COA-nets -- 13.4 Comparison to Other Models -- Chapter 14 Conclusions -- 14.1 Overview of the First Part and Relevant FutureWork -- 14.2 Overview of the Second Part and Relevant FutureWork -- 14.3 Conclusions for the Third Part and Relevant FutureWork -- 14.3.1 Data-Aware BPMN and delta-BPMN -- 14.3.2 COA-nets -- 14.4 Additional Open Directions -- 14.4.1 Verification of Artifact Systems Under Ontologies -- 14.4.2 Safety Verification of (Data-Aware) Multi-Agent Systems -- 14.5 Final Considerations -- Correction to: Verification of Data-Aware Processes via Satisfiability Modulo Theories Correction to: A. Gianola: Verification of Data-Aware Processes via Satisfiability Modulo Theories, LNBIP 470, https://doi.org/10.1007/978-3-031-42746-6 -- References Business-Data processing |
| subject_GND | (DE-588)4113937-9 |
| title | Verification of Data-Aware Processes Via Satisfiability Modulo Theories |
| title_auth | Verification of Data-Aware Processes Via Satisfiability Modulo Theories |
| title_exact_search | Verification of Data-Aware Processes Via Satisfiability Modulo Theories |
| title_full | Verification of Data-Aware Processes Via Satisfiability Modulo Theories |
| title_fullStr | Verification of Data-Aware Processes Via Satisfiability Modulo Theories |
| title_full_unstemmed | Verification of Data-Aware Processes Via Satisfiability Modulo Theories |
| title_short | Verification of Data-Aware Processes Via Satisfiability Modulo Theories |
| title_sort | verification of data aware processes via satisfiability modulo theories |
| topic | Business-Data processing |
| topic_facet | Business-Data processing Hochschulschrift |
| work_keys_str_mv | AT gianolaalessandro verificationofdataawareprocessesviasatisfiabilitymodulotheories |