An algorithmic framework for checking coverability in well-structured transition systems:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
Oldenburg
Univ., Dep. für Informatik
2014
|
| Series: | Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften
Nr. 2014,1 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XXIII, 326 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV041616827 | ||
| 003 | DE-604 | ||
| 005 | 20140312 | ||
| 007 | t| | ||
| 008 | 140131s2014 xx d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)873425216 | ||
| 035 | |a (DE-599)GBV777142023 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-12 |a DE-91G |a DE-634 |a DE-83 | ||
| 084 | |a DAT 552d |2 stub | ||
| 084 | |a DAT 516d |2 stub | ||
| 100 | 1 | |a Strazny, Tim |e Verfasser |0 (DE-588)1047122863 |4 aut | |
| 245 | 1 | 0 | |a An algorithmic framework for checking coverability in well-structured transition systems |c Tim Strazny |
| 264 | 1 | |a Oldenburg |b Univ., Dep. für Informatik |c 2014 | |
| 300 | |a XXIII, 326 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften |v Nr. 2014,1 | |
| 502 | |a Zugl.: Oldenburg, Univ., Diss., 2013 | ||
| 650 | 0 | 7 | |a Transitionssystem |0 (DE-588)4329099-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Überdeckung |g Mathematik |0 (DE-588)4186551-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Transitionssystem |0 (DE-588)4329099-1 |D s |
| 689 | 0 | 1 | |a Überdeckung |g Mathematik |0 (DE-588)4186551-0 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften |v Nr. 2014,1 |w (DE-604)BV017870837 |9 2014,1 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027057934&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027057934 | |
Record in the Search Index
| _version_ | 1820868379705081856 |
|---|---|
| adam_text |
CONTENTS
I AN ALGORITHMIC FRAMEWORK 1
1 INTRODUCTION 3
1.1 CONTRIBUTION 5
1.2 RELATED APPROACHES 6
1.3 THESIS STRUCTURE 7
1.4 SOURCES 8
1.5 HOW TO READ THIS THESIS 8
2 PRELIMINARIES 11
2.1 FIRST GLANCE: PETRI NETS 12
2.2 BASICS OF WELL-STRUCTURE 16
2.3 WELL-STRUCTURED TRANSITION SYSTEMS 19
2.4 THE COVERABILITY PROBLEM 20
2.5 DECIDABILITY RESULTS 30
2.6 WELL-STRUCTURED LABELLED TRANSITION SYSTEMS 34
2.7 INSTANCES OF WSLTSS 36
2.7.1 PETRI NETS 36
2.7.2 PETRI NETS WITH TRANSFER 37
2.7.3 LOSSY CHANNEL SYSTEMS 40
2.8 PROGRAM CORRECTNESS 43
XI
HTTP://D-NB.INFO/1047618044
CONTENTS
3 ALGORITHMIC FRAMEWORK 51
3.1 PROOF OF THE BASIC BR 52
3.1.1 PARTIAL CORRECTNESS 53
3.1.2 TERMINATION 63
3.1.3 TOTAL CORRECTNESS 68
3.2 EXTENDING THE BASIC BR 69
3.3 FRAMEWORK 79
3.4 SEARCH SPACE CONSTRUCTIONS 81
3.4.1 OPTIMIZED PREDECESSORS AND DISTANCE REDUCTION . 82
3.4.2 WITNESS TRACES AND SEARCH STRATEGIES 84
3.5 ARGUMENTS FOR TERMINATION AND CORRECTNESS 85
4 PROOF OF THE ALGORITHMIC FRAMEWORK 87
4.1 PRELIMINARIES 88
4.2 PARTIAL CORRECTNESS 92
4.3 TERMINATION ' *_110
4.4 TOTAL CORRECTNESS 124
4.5 DIFFERENCES IN THE PARTIAL CORRECTNESS PROOFS 125
II INSTANTIATING THE FRAMEWORK 127
5 SSC INSTANCES AND GUIDED SEARCH 129
5.1 BACKWARD ACCELERATION - A NOVEL APPROACH 131
5.1.1 BACKWARD ACCELERATION IS AN SSC 136
5.1.2 PRACTICAL APPROACH TO BACKWARD ACCELERATION . . . 139
5.1.3 COMPUTATION OF MAXIMAL EXTENSIONS FOR PETRI NETS 141
5.2 PRUNING 143
5.3 PARTIAL-ORDER REDUCTION . . . . 147
5.4 COMBINATION OF SEARCH SPACE CONSTRUCTIONS .-.'152
5.5 GUIDED SEARCH 155
5.5.1 SYNTACTIC DISTANCE AND.SYNTACTIC WEIGHT 156
6 DATA STRUCTURES 159
6.1 RELATED WORK 160
6.2 OPERATIONS 161
6.3 FROM NECESSARY CONDITIONS TO EQUIVALENCE CLASSES . 164
6.4 EQUALITY CONDITIONS 167
XII
CONTENTS
6.5 TOTAL ORDER CONDITIONS 168
6.6 SUBSET CONDITIONS 170
6.6.1 FULL POWERSET SEARCH TREES 172
6.6.2 RELAXED POWERSET SEARCH TREES 176
6.6.3 PRELIMINARY EXPERIMENTS 184
6.7 HIERARCHY OF NECESSARY CONDITIONS 185
6.7.1 PRELIMINARY EXPERIMENTS 187
6.8 SELECT OPERATION 189
7 REFERENCE IMPLEMENTATION AND EXPERIMENTS 191
7.1 REFERENCE IMPLEMENTATION BW 192
7.1.1 ARCHITECTURE 193
7.1.2 EXTENSIBILITY 196
7.1.3 UNIT TESTS 204
7.1.4 USAGE: AN EXAMPLE 206
7.2 EXPERIMENTS 207
7.2.1 LOSSY CHANNEL SYSTEMS 208
7.2.2 PN AND PNT BENCHMARK MODELS 208
. 7.2.3 EXPERIMENTS ON SSCS AND SEARCH GUIDANCE . 211
7.2.4 TOOL COMPARISON 214
8 CONCLUSION 225
8.1 SUMMARY 225
8.2 DIRECTIONS FOR FUTURE WORK 227
8.2.1 ALGORITHMIC FRAMEWORK AND DISTANCE 227
8.2.2 IMPLEMENTATION 229
8.2.3 WELL-STRUCTURED TRANSITION SYSTEMS 230
III APPENDICES 233
A IMPLEMENTATION DETAILS 235
A.L GENERICS 235
A.2 COMMAND-LINE OPTIONS 236
B SOURCES OF SELECTED CASE STUDIES 239
B.L HOLONIC TRANSPORTATION SYSTEM 239
B.2 PNCSA PROTOCOL 246
XIII
CONTENTS
B.3 KANBAN PRODUCTION SYSTEM 250
B.4 DELEGATE BUFFER PROGRAM 255
C BENCHMARK DATA 265
C.L DATA STRUCTURES 266
C.2 SEARCH SPACE CONSTRUCTIONS AND SEARCH GUIDANCE 269
C.3 TOOL COMPARISON 286
BIBLIOGRAPHY 293
INDEX 313
XIV |
| any_adam_object | 1 |
| author | Strazny, Tim |
| author_GND | (DE-588)1047122863 |
| author_facet | Strazny, Tim |
| author_role | aut |
| author_sort | Strazny, Tim |
| author_variant | t s ts |
| building | Verbundindex |
| bvnumber | BV041616827 |
| classification_rvk | SS 5560 |
| classification_tum | DAT 552d DAT 516d |
| ctrlnum | (OCoLC)873425216 (DE-599)GBV777142023 |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV041616827</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140312</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">140131s2014 xx d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873425216</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV777142023</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 552d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Strazny, Tim</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1047122863</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An algorithmic framework for checking coverability in well-structured transition systems</subfield><subfield code="c">Tim Strazny</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oldenburg</subfield><subfield code="b">Univ., Dep. für Informatik</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIII, 326 S.</subfield><subfield code="b">graph. Darst.</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">Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften</subfield><subfield code="v">Nr. 2014,1</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Oldenburg, Univ., Diss., 2013</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Transitionssystem</subfield><subfield code="0">(DE-588)4329099-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Überdeckung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4186551-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Transitionssystem</subfield><subfield code="0">(DE-588)4329099-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Überdeckung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4186551-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften</subfield><subfield code="v">Nr. 2014,1</subfield><subfield code="w">(DE-604)BV017870837</subfield><subfield code="9">2014,1</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=027057934&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027057934</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV041616827 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:23:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027057934 |
| oclc_num | 873425216 |
| open_access_boolean | |
| owner | DE-739 DE-12 DE-91G DE-BY-TUM DE-634 DE-83 |
| owner_facet | DE-739 DE-12 DE-91G DE-BY-TUM DE-634 DE-83 |
| physical | XXIII, 326 S. graph. Darst. |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Univ., Dep. für Informatik |
| record_format | marc |
| series | Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften |
| series2 | Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften |
| spelling | Strazny, Tim Verfasser (DE-588)1047122863 aut An algorithmic framework for checking coverability in well-structured transition systems Tim Strazny Oldenburg Univ., Dep. für Informatik 2014 XXIII, 326 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften Nr. 2014,1 Zugl.: Oldenburg, Univ., Diss., 2013 Transitionssystem (DE-588)4329099-1 gnd rswk-swf Überdeckung Mathematik (DE-588)4186551-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Transitionssystem (DE-588)4329099-1 s Überdeckung Mathematik (DE-588)4186551-0 s Algorithmus (DE-588)4001183-5 s DE-604 Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften Nr. 2014,1 (DE-604)BV017870837 2014,1 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027057934&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Strazny, Tim An algorithmic framework for checking coverability in well-structured transition systems Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften Transitionssystem (DE-588)4329099-1 gnd Überdeckung Mathematik (DE-588)4186551-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4329099-1 (DE-588)4186551-0 (DE-588)4001183-5 (DE-588)4113937-9 |
| title | An algorithmic framework for checking coverability in well-structured transition systems |
| title_auth | An algorithmic framework for checking coverability in well-structured transition systems |
| title_exact_search | An algorithmic framework for checking coverability in well-structured transition systems |
| title_full | An algorithmic framework for checking coverability in well-structured transition systems Tim Strazny |
| title_fullStr | An algorithmic framework for checking coverability in well-structured transition systems Tim Strazny |
| title_full_unstemmed | An algorithmic framework for checking coverability in well-structured transition systems Tim Strazny |
| title_short | An algorithmic framework for checking coverability in well-structured transition systems |
| title_sort | an algorithmic framework for checking coverability in well structured transition systems |
| topic | Transitionssystem (DE-588)4329099-1 gnd Überdeckung Mathematik (DE-588)4186551-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Transitionssystem Überdeckung Mathematik Algorithmus Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027057934&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV017870837 |
| work_keys_str_mv | AT straznytim analgorithmicframeworkforcheckingcoverabilityinwellstructuredtransitionsystems |