Verification of data-aware processes via satisfiability modulo theories:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
Cham
Springer
[2023]
|
| Series: | Lecture notes in business information processing
470 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XXVIII, 317 Seiten Illustrationen |
| ISBN: | 9783031427459 |
Staff View
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV049453847 | ||
| 003 | DE-604 | ||
| 005 | 20231213 | ||
| 007 | t | ||
| 008 | 231206s2023 a||| m||| 00||| eng d | ||
| 020 | |a 9783031427459 |9 978-3-031-42745-9 | ||
| 035 | |a (OCoLC)1414555056 | ||
| 035 | |a (DE-599)BVBBV049453847 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 | ||
| 082 | 0 | |a 658.05 |2 23 | |
| 082 | 0 | |a 650.0285 |2 23 | |
| 084 | |a QH 500 |0 (DE-625)141607: |2 rvk | ||
| 084 | |a DAT 000 |2 stub | ||
| 100 | 1 | |a Gianola, Alessandro |d 1993- |e Verfasser |0 (DE-588)1312290137 |4 aut | |
| 245 | 1 | 0 | |a Verification of data-aware processes via satisfiability modulo theories |c Alessandro Gianola |
| 264 | 1 | |a Cham |b Springer |c [2023] | |
| 300 | |a XXVIII, 317 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in business information processing |v 470 | |
| 502 | |b Dissertation |c Free University of Bozen |d 2022 | ||
| 650 | 4 | |a Business Informatics | |
| 650 | 4 | |a Artificial Intelligence | |
| 650 | 4 | |a IT in Business | |
| 650 | 4 | |a Business / Data processing | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Business information services | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-031-42747-3 |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-031-42746-6 |
| 830 | 0 | |a Lecture notes in business information processing |v 470 |w (DE-604)BV023204387 |9 470 | |
| 856 | 4 | 2 | |m Digitalisierung UB Augsburg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034799684&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-034799684 | ||
Record in the Search Index
| _version_ | 1804186221160693761 |
|---|---|
| adam_text | Contents 1 Introduction.................................................................................................. 1 1.1 Overview............................................................................................. 1 1.1.1 Finite-State Model Checking................................................... 2 1.1.2 Verification of Data-Aware Processes ................................... 3 1.1.3 Infinite-State Model Checking: from Parameterized Systems to SMT Verification ................................................. 5 1.1.4 Main Goal of the Book ........................................................... 6 1.2 Related Literature................................................................................ 7 1.2.1 Formal Models for Data-Aware (Business) Processes.......... 7 1.2.2 Verification of Data-Aware Processes ................................... 11 1.2.3 Model Checking for Infinite-State Systems using SMT-based Techniques........................................................... 16 1.3 Contributions of the Book................................................................... 19 1.3.1 Contributions of the First Part.................................................. 19 1.3.2 Contributions of the Second Part............................................ 25 1.3.3 Contributions of the Third Part................................................ 29 Part I Foundations of SMT-based Safety Verification of Artifact Systems 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..................................... 3 Array-Based Artifact Systems: General Framework.............................. 45 3.1 Read-Only DB Schemas...................................................................... 46 3.1.1 Relational View of DB Schemas............................................. 48 35 35 36 37 38 39 40 41 xxi
xxii 4 5 Contents 3.1.2 DB Extended-Schemas ........................................................... 3.2 Array-Based Artifact Systems.............................................................. 3.2.1 SAS........................................................................................... 3.2.2 U-RAS....................................................................................... 50 53 54 58 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............ 69 70 70 71 7| 7| 72 j 7^ 8^ 80 в| 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................................................................ 93 4.7.2 Freshness and Related Approaches......................................... 84 89 89 9C 93 94 Decidability Results via Termination of the Verification Machinery .. 91 5.1 Termination Result for SASs.............................................................. 9f 5.2 Termination Results for RASs............................................................ 99 5.2.1 Termination with Local Updates.............................................. IOC 5.2.2 Proof of Theorem 5.2 and an Example of (Strongly) Local RAS............................................................................... 101 5.2.3 Termination with Tree-Like Signatures.................................. IOC 5.2.4 Proof of Theorem 5.4 and an Example of Tree-Like RAS .. ,10( 5.3 Operations Representable as Strongly Local Transitions................... 111 5.3.1 Deletion Updates ...................................................................... 111 5.3.2 Insertion Updates...................................................................... 114 5.3.3 Propagation Updates ................................................................ Ilf 5.3.4 Bulk Updates.............................................................................. Ilf 5.4 A Summary of the Comparison with Related DAP
Formalisms .... 119 Part II Automated Reasoning Techniques for Data-Aware Process Verification
Contents xxiii preliminaries for (Uniform) Interpolation................................................. 123 6.1 General Preliminaries............................................................................ 123 6.1.1 Preliminaries on Uniform Interpolants or Covers.................... 124 6.2 Preliminaries on the Equality Interpolating Condition and Beth Definability ....................................................................................126 7 Uniform Interpolation for Database Theories (and Beyond)................ 129 7.1 Uniform Interpolation, Covers and Model Completions..................... 130 7.2 Model-Checking Applications.............................................................. 133 7.2.1 Covers for Database Schemas................................................... 136 7.3 Covers via Constrained Superposition ................................................ 137 7.4 Complexity Analysis of the Fragment for Database-Driven Applications................................................................................... 146 7.5 An Extension of the Constrained Superposition Calculus ................. 150 7.6 Remarks on MCMT Implementation .................................................. 152 8 Combination of Uniform Interpolants for DAPs Verification............... 155 8.1 Interpolation, Equality Interpolati ng Condition and Beth Definability 156 8.2 Convex Theories.................................................................................... 158 8.3 The Convex Combined Cover Algorithm............................................. 160 8.3.1 The
Necessity of the Equality Interpolating Condition.......... 164 8.3.2 An Example of Cover Computation......................................... 165 8.4 The Non-Convex Case: a Counterexample........................................... 168 8.5 Tame Combinations ...............................................................................169 8.5.1 An Example of Combined Covers for the Tame Combination 173 8.6 Discussion on Related Works on Covers............................................... 175 9 MCMT: a Concrete Model Checker for DAPs ......................................... 177 9.1 MCMT: a Brief Overview .................................................................... 177 9.2 Basic Syntax of MCMT........................................................................ 178 9.3 MCMT Specifications: Database-Driven Mode................................. 180 9.3.1 DB Schema Declaration .......................................................... 180 9.3.2 Initialization.............................................................................. 182 9.3.3 UnsafeStates.............................................................................. 183 9.3.4 Elimination of Existentially Quantified Variables................... 185 9.3.5 Transitions..................................................................................186 9.3.6 Universal Quantifiers in Guards.............................................. 189 9.4 Running MCMT....................................................................................189 9.4.1 Displayed
Information.............................................................. 190 9.5 Experiments on Concrete Data-Aware Processes................................. 191 PartHI Applications
xxiv Cont^ 10 Business Process Management and Petri Nets: Preliminaries..............|c 10.1 Business Process Management ............................................................ p 10.1.1 BPMN Basic Blocks and Concepts ........................................ 2( 10.1.2 Process Cases and Execution Semantics: an Informal View . 2( 10.1.3 Complex BPMN blocks............................................................ 2( 10.2 Colored Petri Nets................................................................................. 2( 10.2.1 Data Types................................................................................. 2( 10.2.2 Preliminary Notions for Colored Petri Nets.............................^ 10.2.3 Definition of Colored Petri Nets.............................................. 2( 10.2.4 Semantics of CPNs................................................................... 2j 10.2.5 Execution Semantics of CPNs................................................. 2j 11 DABs: a Theoretical Framework for Data-Aware BPMN..................... 2j 11.1 Data-Aware BPMN: Main Contributions........................................... 2| 11.2 Data-Aware BPMN.............................................................................. i 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................................................................ 25 11.3 Parameterized Safety Verification of DABs........................................ 2j 11.3.1 Array-Based Artifact Systems and Safety Checking: a : Brief Summary.......................................................................... 2 11.3.2 Verification Problems for DABs............................................. 2; 11.3.3 Translating DABs into Array-Based Artifact Systems......... 25 11.3.4 Verification Results ................................................................. 2 11.4 First Experiments with MCMT............................................................ 2 12 delta-BPMN: the Operational and Implemented Counterpart of DABs2’ 12.1 From DABs to delta-BPMN.................................................................. 2 12.1.1 DABs: a Symbolic Bridge Between RASs and delta-BPMN. 2 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................................. 2 12.3.3 Inspecting and Manipulating Data with PDMML................... 2 12.3.4 Guards for Conditional Flows................................................. 2 12.4 delta-BPMN in Action........................................................................ 2 12.4.1 Modeling delta-BPMN Processes with Camunda................... 2 12.4.2 Encoding delta-BPMN Camunda
Processes in MCMT........ 2 12.5 A Brief Discussion on Limitations of DABs and delta-BPMN........ 2 13 Catalog Object-Aware Nets.......................................................................... 2 13.1 The СОА-net Formal Model ................................................................ 2 13.1.1 Modeling Capabilities.............................................................. 2 13.2 From СОА-nets to MCMT.................................................................... 2
Contents xxv 13.2.1 Universal RASs: a Summary..................................................... 271 13.2.2 Encoding COA-nets into MCMT............................................. 272 13.2.3 Encoding Example.................................................................... 279 13.3 Unsafety Checking of СОА-nets and its Formal Properties.............. 282 13.3.1 Unsafety Properties .................................................................. 283 13.3.2 Verification Problem ................................................................ 285 13.3.3 Soundness and Completeness................................................... 285 13.3.4 Conservative COA-nets............................................................ 287 13.3.5 Bounded COA-nets .................................................................. 290 13.3.6 Discussion on Undecidability of COA-nets............................. 291 13.4 Comparison to Other Models................................................................ 292 14 Conclusions.................................................................................................... 297 14.1 Overview of the First Part and Relevant Future Work........................ 297 14.2 Overview of the Second Part and Relevant Future Work.................. 298 14.3 Conclusions for the Third Part and Relevant Future Work................ 300 14.3.1 Data-Aware BPMN and delta-BPMN ..................................... 300 14.3.2 COA-nets.................................................................................... 302 14.4 Additional Open
Directions.................................................................. 303 14.4.1 Verification of Artifact Systems Under Ontologies................. 303 14.4.2 Safety Verification of (Data-Aware) Multi-Agent Systems .. 303 14.5 Final Considerations.............................................................................. 306 References........................................................................................................307
|
| adam_txt |
Contents 1 Introduction. 1 1.1 Overview. 1 1.1.1 Finite-State Model Checking. 2 1.1.2 Verification of Data-Aware Processes . 3 1.1.3 Infinite-State Model Checking: from Parameterized Systems to SMT Verification . 5 1.1.4 Main Goal of the Book . 6 1.2 Related Literature. 7 1.2.1 Formal Models for Data-Aware (Business) Processes. 7 1.2.2 Verification of Data-Aware Processes . 11 1.2.3 Model Checking for Infinite-State Systems using SMT-based Techniques. 16 1.3 Contributions of the Book. 19 1.3.1 Contributions of the First Part. 19 1.3.2 Contributions of the Second Part. 25 1.3.3 Contributions of the Third Part. 29 Part I Foundations of SMT-based Safety Verification of Artifact Systems 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. 3 Array-Based Artifact Systems: General Framework. 45 3.1 Read-Only DB Schemas. 46 3.1.1 Relational View of DB Schemas. 48 35 35 36 37 38 39 40 41 xxi
xxii 4 5 Contents 3.1.2 DB Extended-Schemas . 3.2 Array-Based Artifact Systems. 3.2.1 SAS. 3.2.2 U-RAS. 50 53 54 58 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. 69 70 70 71 7| 7| 72 j 7^ 8^ 80 в| 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. 93 4.7.2 Freshness and Related Approaches. 84 89 89 9C 93 94 Decidability Results via Termination of the Verification Machinery . 91 5.1 Termination Result for SASs. 9f 5.2 Termination Results for RASs. 99 5.2.1 Termination with Local Updates. IOC 5.2.2 Proof of Theorem 5.2 and an Example of (Strongly) Local RAS. 101 5.2.3 Termination with Tree-Like Signatures. IOC 5.2.4 Proof of Theorem 5.4 and an Example of Tree-Like RAS . ,10( 5.3 Operations Representable as Strongly Local Transitions. 111 5.3.1 Deletion Updates . 111 5.3.2 Insertion Updates. 114 5.3.3 Propagation Updates . Ilf 5.3.4 Bulk Updates. Ilf 5.4 A Summary of the Comparison with Related DAP
Formalisms . 119 Part II Automated Reasoning Techniques for Data-Aware Process Verification
Contents xxiii preliminaries for (Uniform) Interpolation. 123 6.1 General Preliminaries. 123 6.1.1 Preliminaries on Uniform Interpolants or Covers. 124 6.2 Preliminaries on the Equality Interpolating Condition and Beth Definability .126 7 Uniform Interpolation for Database Theories (and Beyond). 129 7.1 Uniform Interpolation, Covers and Model Completions. 130 7.2 Model-Checking Applications. 133 7.2.1 Covers for Database Schemas. 136 7.3 Covers via Constrained Superposition . 137 7.4 Complexity Analysis of the Fragment for Database-Driven Applications. 146 7.5 An Extension of the Constrained Superposition Calculus . 150 7.6 Remarks on MCMT Implementation . 152 8 Combination of Uniform Interpolants for DAPs Verification. 155 8.1 Interpolation, Equality Interpolati ng Condition and Beth Definability 156 8.2 Convex Theories. 158 8.3 The Convex Combined Cover Algorithm. 160 8.3.1 The
Necessity of the Equality Interpolating Condition. 164 8.3.2 An Example of Cover Computation. 165 8.4 The Non-Convex Case: a Counterexample. 168 8.5 Tame Combinations .169 8.5.1 An Example of Combined Covers for the Tame Combination 173 8.6 Discussion on Related Works on Covers. 175 9 MCMT: a Concrete Model Checker for DAPs . 177 9.1 MCMT: a Brief Overview . 177 9.2 Basic Syntax of MCMT. 178 9.3 MCMT Specifications: Database-Driven Mode. 180 9.3.1 DB Schema Declaration . 180 9.3.2 Initialization. 182 9.3.3 UnsafeStates. 183 9.3.4 Elimination of Existentially Quantified Variables. 185 9.3.5 Transitions.186 9.3.6 Universal Quantifiers in Guards. 189 9.4 Running MCMT.189 9.4.1 Displayed
Information. 190 9.5 Experiments on Concrete Data-Aware Processes. 191 PartHI Applications
xxiv Cont^ 10 Business Process Management and Petri Nets: Preliminaries.|c 10.1 Business Process Management . p 10.1.1 BPMN Basic Blocks and Concepts . 2( 10.1.2 Process Cases and Execution Semantics: an Informal View . 2( 10.1.3 Complex BPMN blocks. 2( 10.2 Colored Petri Nets. 2( 10.2.1 Data Types. 2( 10.2.2 Preliminary Notions for Colored Petri Nets.^ 10.2.3 Definition of Colored Petri Nets. 2( 10.2.4 Semantics of CPNs. 2j 10.2.5 Execution Semantics of CPNs. 2j 11 DABs: a Theoretical Framework for Data-Aware BPMN. 2j 11.1 Data-Aware BPMN: Main Contributions. 2| 11.2 Data-Aware BPMN. i 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. 25 11.3 Parameterized Safety Verification of DABs. 2j 11.3.1 Array-Based Artifact Systems and Safety Checking: a : Brief Summary. 2 11.3.2 Verification Problems for DABs. 2; 11.3.3 Translating DABs into Array-Based Artifact Systems. 25 11.3.4 Verification Results . 2 11.4 First Experiments with MCMT. 2 12 delta-BPMN: the Operational and Implemented Counterpart of DABs2’ 12.1 From DABs to delta-BPMN. 2 12.1.1 DABs: a Symbolic Bridge Between RASs and delta-BPMN. 2' 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. 2 12.3.3 Inspecting and Manipulating Data with PDMML. 2 12.3.4 Guards for Conditional Flows. 2 12.4 delta-BPMN in Action. 2 12.4.1 Modeling delta-BPMN Processes with Camunda. 2 12.4.2 Encoding delta-BPMN Camunda
Processes in MCMT. 2 12.5 A Brief Discussion on Limitations of DABs and delta-BPMN. 2 13 Catalog Object-Aware Nets. 2 13.1 The СОА-net Formal Model . 2 13.1.1 Modeling Capabilities. 2 13.2 From СОА-nets to MCMT. 2
Contents xxv 13.2.1 Universal RASs: a Summary. 271 13.2.2 Encoding COA-nets into MCMT. 272 13.2.3 Encoding Example. 279 13.3 Unsafety Checking of СОА-nets and its Formal Properties. 282 13.3.1 Unsafety Properties . 283 13.3.2 Verification Problem . 285 13.3.3 Soundness and Completeness. 285 13.3.4 Conservative COA-nets. 287 13.3.5 Bounded COA-nets . 290 13.3.6 Discussion on Undecidability of COA-nets. 291 13.4 Comparison to Other Models. 292 14 Conclusions. 297 14.1 Overview of the First Part and Relevant Future Work. 297 14.2 Overview of the Second Part and Relevant Future Work. 298 14.3 Conclusions for the Third Part and Relevant Future Work. 300 14.3.1 Data-Aware BPMN and delta-BPMN . 300 14.3.2 COA-nets. 302 14.4 Additional Open
Directions. 303 14.4.1 Verification of Artifact Systems Under Ontologies. 303 14.4.2 Safety Verification of (Data-Aware) Multi-Agent Systems . 303 14.5 Final Considerations. 306 References.307 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Gianola, Alessandro 1993- |
| author_GND | (DE-588)1312290137 |
| author_facet | Gianola, Alessandro 1993- |
| author_role | aut |
| author_sort | Gianola, Alessandro 1993- |
| author_variant | a g ag |
| building | Verbundindex |
| bvnumber | BV049453847 |
| classification_rvk | QH 500 |
| classification_tum | DAT 000 |
| ctrlnum | (OCoLC)1414555056 (DE-599)BVBBV049453847 |
| dewey-full | 658.05 650.0285 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management 650 - Management and auxiliary services |
| dewey-raw | 658.05 650.0285 |
| dewey-search | 658.05 650.0285 |
| dewey-sort | 3658.05 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Informatik Wirtschaftswissenschaften |
| discipline_str_mv | Informatik Wirtschaftswissenschaften |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01865nam a2200457zcb4500</leader><controlfield tag="001">BV049453847</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20231213 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">231206s2023 a||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031427459</subfield><subfield code="9">978-3-031-42745-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1414555056</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049453847</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-384</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.05</subfield><subfield code="2">23</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">650.0285</subfield><subfield code="2">23</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="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gianola, Alessandro</subfield><subfield code="d">1993-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1312290137</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><subfield code="c">Alessandro Gianola</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="300" ind1=" " ind2=" "><subfield code="a">XXVIII, 317 Seiten</subfield><subfield code="b">Illustrationen</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in business information processing</subfield><subfield code="v">470</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Free University of Bozen</subfield><subfield code="d">2022</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business Informatics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">IT in Business</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business / Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business information services</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="z">978-3-031-42747-3</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-031-42746-6</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in business information processing</subfield><subfield code="v">470</subfield><subfield code="w">(DE-604)BV023204387</subfield><subfield code="9">470</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Augsburg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034799684&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034799684</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV049453847 |
| illustrated | Illustrated |
| index_date | 2024-07-03T23:13:29Z |
| indexdate | 2024-07-10T10:07:41Z |
| institution | BVB |
| isbn | 9783031427459 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034799684 |
| oclc_num | 1414555056 |
| open_access_boolean | |
| owner | DE-384 |
| owner_facet | DE-384 |
| physical | XXVIII, 317 Seiten Illustrationen |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in business information processing |
| series2 | Lecture notes in business information processing |
| spelling | Gianola, Alessandro 1993- Verfasser (DE-588)1312290137 aut Verification of data-aware processes via satisfiability modulo theories Alessandro Gianola Cham Springer [2023] XXVIII, 317 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Lecture notes in business information processing 470 Dissertation Free University of Bozen 2022 Business Informatics Artificial Intelligence IT in Business Business / Data processing Artificial intelligence Business information services (DE-588)4113937-9 Hochschulschrift gnd-content Erscheint auch als Druck-Ausgabe 978-3-031-42747-3 Erscheint auch als Online-Ausgabe 978-3-031-42746-6 Lecture notes in business information processing 470 (DE-604)BV023204387 470 Digitalisierung UB Augsburg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034799684&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Gianola, Alessandro 1993- Verification of data-aware processes via satisfiability modulo theories Lecture notes in business information processing Business Informatics Artificial Intelligence IT in Business Business / Data processing Artificial intelligence Business information services |
| 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_exact_search_txtP | Verification of data-aware processes via satisfiability modulo theories |
| title_full | Verification of data-aware processes via satisfiability modulo theories Alessandro Gianola |
| title_fullStr | Verification of data-aware processes via satisfiability modulo theories Alessandro Gianola |
| title_full_unstemmed | Verification of data-aware processes via satisfiability modulo theories Alessandro Gianola |
| title_short | Verification of data-aware processes via satisfiability modulo theories |
| title_sort | verification of data aware processes via satisfiability modulo theories |
| topic | Business Informatics Artificial Intelligence IT in Business Business / Data processing Artificial intelligence Business information services |
| topic_facet | Business Informatics Artificial Intelligence IT in Business Business / Data processing Artificial intelligence Business information services Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034799684&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV023204387 |
| work_keys_str_mv | AT gianolaalessandro verificationofdataawareprocessesviasatisfiabilitymodulotheories |