Availability: Principles of model checking | Technische Universität München

Principles of model checking:

Saved in:

Bibliographic Details
Main Authors:	Baier, Christel (Author), Katoen, Joost-Pieter 1964- (Author)
Format:	Book
Language:	English
Published:	Cambridge, MA [u.a.] MIT Press 2008
Subjects:	Model Checking Programmverifikation
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016427288&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Item Description:	Includes bibliographical references and index
Physical Description:	XVII, 975 S. graph. Darst.
ISBN:	9780262026499

Staff View

MARC


LEADER	00000nam a2200000zc 4500
001	BV023241745
003	DE-604
005	20170529
007	t\|
008	080407s2008 xxud\|\|\| \|\|\|\| 00\|\|\| eng d
010			\|a 2007037603
020			\|a 9780262026499 \|9 978-0-262-02649-9
035			\|a (OCoLC)171152628
035			\|a (DE-599)BVBBV023241745
040			\|a DE-604 \|b ger \|e aacr
041	0		\|a eng
044			\|a xxu \|c US
049			\|a DE-29T \|a DE-92 \|a DE-384 \|a DE-473 \|a DE-20 \|a DE-91G \|a DE-634 \|a DE-83 \|a DE-898 \|a DE-739 \|a DE-11 \|a DE-91 \|a DE-188 \|a DE-706 \|a DE-523
050		0	\|a QA76.76.V47
082	0		\|a 004.2/4
084			\|a ST 233 \|0 (DE-625)143620: \|2 rvk
084			\|a DAT 325f \|2 stub
100	1		\|a Baier, Christel \|e Verfasser \|0 (DE-588)12400301X \|4 aut
245	1	0	\|a Principles of model checking \|c Christel Baier ; Joost-Pieter Katoen
264		1	\|a Cambridge, MA [u.a.] \|b MIT Press \|c 2008
300			\|a XVII, 975 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
500			\|a Includes bibliographical references and index
650	0	7	\|a Model Checking \|0 (DE-588)4434799-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Programmverifikation \|0 (DE-588)4135576-3 \|2 gnd \|9 rswk-swf
689	0	0	\|a Programmverifikation \|0 (DE-588)4135576-3 \|D s
689	0	1	\|a Model Checking \|0 (DE-588)4434799-6 \|D s
689	0		\|5 DE-604
700	1		\|a Katoen, Joost-Pieter \|d 1964- \|e Verfasser \|0 (DE-588)12099996X \|4 aut
856	4	2	\|m Digitalisierung UB Augsburg \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016427288&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-016427288

Record in the Search Index

DE-BY-TUM_call_number	0003 DAT 325f 2010 L 925 0004 DAT 325f 2010 B 2964 0102 DAT 325f 2009 B 480 0104 DAT 325f 2009 B 480 0303 DAT 325f 2009 L 208
DE-BY-TUM_katkey	1662209
DE-BY-TUM_location	00 01 03
DE-BY-TUM_media_number	040007488077 040007488088 040007488099 040007488102 040007488124 040007488146 040007488157 040007487963 040007487974 040007487985 040007488000 040007488011 040007488044 040007488055 040007488066 040007713548 040007713559 040007713560 040007713571 040007713582 040007713593 040007713606 040007713639 040007713651 040007713662 040007713673 040007713684 040007713695 040007713720 040007713731 040007713742 040007713753 040007371066 040007371099 040007371102 040007371113 040007371033 040007371044 040007487952 040007713719 040007371022 040010229662 040010227513 040010145912 040071402945 040071402989 040071402956 040071402967 040071402978 040071298141 040071298152 040071298163 040008683043 040071298221 040071298185 040071298196 040071298210 040071298209 040071298232 040071298174
_version_	1821933503889014784
adam_text	Contents Foreword xiii Preface xv 1 System Verification 1 1.1 Model Checking .................................. 7 1.2 Characteristics of Model Checking ....................... 11 1.2.1 The Model-Checking Process ...................... 11 1.2.2 Strengths and Weaknesses ........................ 14 1.3 Bibliographic Notes ................................ 16 2 Modelling Concurrent Systems 19 2.1 Transition Systems ................................ 19 2.1.1 Executions ................................ 24 2.1.2 Modeling Hardware and Software Systems ............... 26 2.2 Parallelism and Communication ......................... 35 2.2.1 Concurrency and Interleaving ...................... 36 2.2.2 Communication via Shared Variables .................. 39 2.2.3 Handshaking ............................... 47 2.2.4 Channel Systems ............................. 53 2.2.5 NanoPromela ............................... 63 2.2.6 Synchronous Parallelism ......................... 75 2.3 The State-Space Explosion Problem ...................... 77 2.4 Summary ..................................... 80 2.5 Bibliographic Notes ................................ 80 2.6 Exercises ..................................... 82 3 Linear-Time Properties 89 3.1 Deadlock ..................................... 89 3.2 Linear-Time Behavior .............................. 94 3.2.1 Paths and State Graph ......................... 95 3.2.2 Traces ................................... 97 3.2.3 Linear-Time Properties ......................... 100 viii ____________________________________________________________CONTENTS 3.2.4 Trace Equivalence and Linear-Time Properties ............104 3.3 Safety Properties and Invariants ........................107 3.3.1 Invariants .................................107 3.3.2 Safety Properties ............................. Ill 3.3.3 Trace Equivalence and Safety Properties ................116 3.4 Livcness Properties ................................120 3.4.1 Liveness Properties ............................121 3.4.2 Safety vs. Liveness Properties ......................122 3.5 Fairness ......................................126 3.5.1 Fairness Constraints ...........................129 3.5.2 Fairness Strategies ............................137 3.5.3 Fairness and Safety ............................139 3.6 Summary .....................................141 3.7 Bibliographic Notes ................................143 3.8 Exercises .....................................144 4 Regular Properties 151 4.1 Automata on Finite Words ...........................151 4.2 Model-Checking Regular Safety Properties ...................159 4.2.1 Regular Safety Properties ........................159 4.2.2 Verifying Regular Safety Properties ...................163 4.3 Automata on Infinite Words ...........................170 4.3.1 ω- Regular Languages and Properties ..................170 4.3.2 Nondeterministic Buchi Automata ...................173 4.3.3 Deterministic Buchi Automata .....................188 4.3.4 Generalized Buchi Automata ......................192 4.4 Model-Checking ¡¿-Regular Properties .....................198 4.4.1 Persistence Properties and Product ...................199 4.4.2 Nested Depth-First Search ........................203 4.5 Summary .....................................217 4.6 Bibliographic Notes ................................218 4.7 Exercises .....................................219 5 Linear Temporal Logic 229 5.1 Linear Temporal Logic ..............................229 5.1.1 Syntax ...................................231 5.1.2 Semantics .................................235 5.1.3 Specifying Properties ...........................239 5.1.4 Equivalence of LTL Formulae ......................247 5.1.5 WTeak Until. Release, and Positive Normal Form ...........252 5.1.6 Fairness in LTL ..............................257 5.2 Automata-Based LTL Model Checking .....................270 CONTENTS _____________^^_^_^^_^________^_^^^^^______ ix 6. 2.1 Complexity of the LTL Model-Checking Problem ...........287 5.2.2 LTL Satisfiability and Validity Checking ................296 5.3 Summary .....................................298 5.4 Bibliographic Notes ................................299 5.5 Exercises .....................................300 6 Computation Tree Logic 313 6.1 Introduction ....................................313 6.2 Computation Tree Logic .............................317 6.2.1 Syntax ...................................317 6.2.2 Semantics .................................320 6.2.3 Equivalence of CTL Formulae ......................329 6.2.4 Normal Forms for CTL .........................332 6.3 Expressiveness of CTL vs. LTL .........................334 6.4 CTL Model Checking ..............................341 6.4.1 Basic Algorithm .............................341 6.4.2 The Until and Existential Always Operator ..............347 6.4.3 Time and Space Complexity .......................355 6.5 Fairness in CTL .................................358 6.6 Counterexamples and Witnesses ........................373 6.6.1 Counterexamples in CTL ........................376 6.6.2 Counterexamples and Witnesses in CTL with Fairness ........380 6.7 Symbolic CTL Model Checking .........................381 6.7.1 Switching Functions ...........................382 6.7.2 Encoding Transition Systems by Switching Functions .........386 6.7.3 Ordered Binary Decision Diagrams ...................392 6.7.4 Implementation of ROBDD-Based Algorithms ............407 6.8 CTL* .......................................422 6.8.1 Logic, Expressiveness, and Equivalence .................422 6.8.2 CTL* Model Checking ..........................427 6.9 Summary .....................................430 6.10 Bibliographic Notes ................................431 6.11 Exercises .....................................433 7 Equivalences and Abstraction 449 7.1 Bisimulation ....................................451 7.1.1 Bisimulation Quotient ..........................456 7.1.2 Action-Based Bisimulation .......................465 7.2 Bisimulation and CTL* Equivalence ......................468 7.3 Bisimulation-Quotientmg Algorithms ......................476 7.3.1 Determining the Initial Partition ....................478 7.3.2 Refining Partitions ............................480 CONTENTS 7.3.3 A First Partition Refinement Algorithm ................ 486 7.3.4 An Efficiency Improvement ....................... 487 7.3.5 Equivalence Checking of Transition Systems .............. 493 7.4 Simulation Relations ............................... 496 7.4.1 Simulation Equivalence ......................... 505 7.4.2 Bisirnulation. Simulation, and Trace Equivalence ........... 510 7.5 Simulation and VCTL* Equivalence ....................... 515 7.6 Simulation-Quotienting Algorithms ....................... 521 7.7 Stutter Linear-Time Relations .......................... 529 7.7.1 Stutter Trace Equivalence ........................ 530 7.7.2 Stutter Trace and LTLXO Equivalence ................. 534 7.8 Stutter Bisimulation ............................... 536 7.8.1 Divergence-Sensitive Stutter Bisirnulation ............... 543 7.8.2 Norm ed Bisimulation ........................... 552 7.8.3 Stutter Bisimulation and CTLO Equivalence ............. 560 7.8.4 Stutter Bisimulation Quotienting .................... 567 7.9 Summary ..................................... 579 7.10 Bibliographic Notes ................................ 580 7.11 Exercises ..................................... 582 Partial Order Reduction 595 8.1 Independence of Actions .............................598 8.2 The Linear-Time Ample Set Approach .....................605 8.2.1 Ample Set Constraints ..........................606 8.2.2 Dynamic Partial Order Reduction ...................619 8.2.3 Computing Ample Sets .........................627 8.2.4 Static Partial Order Reduction .....................635 8.3 The Branching-Time Ample Set Approach ...................650 8.4 Summary .....................................661 8.5 Bibliographic Notes ................................661 8.6 Exercises .....................................663 Timed Automata 673 9.1 Timed Automata .................................677 9.1.1 Semantics .................................684 9.1.2 Time Divergence, Timelock. and Zenoncss ...............690 9.2 Timed Computation Tree Logic .........................698 9.3 TCTL Model Checking ..............................705 9.3.1 Eliminating Timing Parameters .....................706 9.3.2 Region Transition Systems .......................709 9.3.3 The TCTL Model-Checking Algorithm .................732 9.4 Summary .....................................738 CONTENTS 9.5 Bibliographic Notes ................................739 9.6 Exercises .....................................740 10 Probabilistic Systems 745 10.1 Markov Chains ..................................747 10.1.1 Reachability Probabilities ........................759 10.1.2 Qualitative Properties ..........................770 10.2 Probabilistic Computation Tree Logic .....................780 10.2.1 PCTL Model Checking .........................785 10.2.2 The Qualitative Fragment of PCTL ..................787 10.3 Linear-Time Properties .............................796 10.4 PCTL and Probabilistic Bisimulation .....................806 10.4.1 PCTL* ..................................806 10.4.2 Probabilistic Bisimulation ........................808 10.5 Markov Chains with Costs ............................816 10.5.1 Cost-Bounded Reachability .......................818 10.5.2 Long-Run Properties ...........................827 10.6 Markov Decision Processes ............................832 10.6.1 Reachability Probabilities ........................851 10.6.2 PCTL Model Checking .........................866 10.6.3 Limiting Properties ...........................869 10.6.4 Linear-Time Properties and PCTL* ..................880 10.6.5 Fairness ..................................883 10.7 Summary .....................................894 10.8 Bibliographic Notes ................................896 10.9 Exercises .....................................899 A Appendix: Preliminaries 909 Л.1 Frequently Used Symbols and Notations ....................909 A. 2 Formal Languages ................................912 A.3 Prepositional Logic ................................915 A. 4 Graphs .......................................920 A. 5 Computational Complexity ...........................925 Bibliography 931 Index 965
any_adam_object	1
author	Baier, Christel Katoen, Joost-Pieter 1964-
author_GND	(DE-588)12400301X (DE-588)12099996X
author_facet	Baier, Christel Katoen, Joost-Pieter 1964-
author_role	aut aut
author_sort	Baier, Christel
author_variant	c b cb j p k jpk
building	Verbundindex
bvnumber	BV023241745
callnumber-first	Q - Science
callnumber-label	QA76
callnumber-raw	QA76.76.V47
callnumber-search	QA76.76.V47
callnumber-sort	QA 276.76 V47
callnumber-subject	QA - Mathematics
classification_rvk	ST 233
classification_tum	DAT 325f
ctrlnum	(OCoLC)171152628 (DE-599)BVBBV023241745
dewey-full	004.2/4
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.2/4
dewey-search	004.2/4
dewey-sort	14.2 14
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01708nam a2200421zc 4500</leader><controlfield tag="001">BV023241745</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170529 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">080407s2008 xxud\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2007037603</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262026499</subfield><subfield code="9">978-0-262-02649-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)171152628</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023241745</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-523</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.76.V47</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.2/4</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 233</subfield><subfield code="0">(DE-625)143620:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 325f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baier, Christel</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12400301X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Principles of model checking</subfield><subfield code="c">Christel Baier ; Joost-Pieter Katoen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, MA [u.a.]</subfield><subfield code="b">MIT Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 975 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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Model Checking</subfield><subfield code="0">(DE-588)4434799-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Model Checking</subfield><subfield code="0">(DE-588)4434799-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Katoen, Joost-Pieter</subfield><subfield code="d">1964-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12099996X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Augsburg</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=016427288&sequence=000002&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-016427288</subfield></datafield></record></collection>
id	DE-604.BV023241745
illustrated	Illustrated
indexdate	2024-12-20T13:11:27Z
institution	BVB
isbn	9780262026499
language	English
lccn	2007037603
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016427288
oclc_num	171152628
open_access_boolean
owner	DE-29T DE-92 DE-384 DE-473 DE-BY-UBG DE-20 DE-91G DE-BY-TUM DE-634 DE-83 DE-898 DE-BY-UBR DE-739 DE-11 DE-91 DE-BY-TUM DE-188 DE-706 DE-523
owner_facet	DE-29T DE-92 DE-384 DE-473 DE-BY-UBG DE-20 DE-91G DE-BY-TUM DE-634 DE-83 DE-898 DE-BY-UBR DE-739 DE-11 DE-91 DE-BY-TUM DE-188 DE-706 DE-523
physical	XVII, 975 S. graph. Darst.
publishDate	2008
publishDateSearch	2008
publishDateSort	2008
publisher	MIT Press
record_format	marc
spellingShingle	Baier, Christel Katoen, Joost-Pieter 1964- Principles of model checking Model Checking (DE-588)4434799-6 gnd Programmverifikation (DE-588)4135576-3 gnd
subject_GND	(DE-588)4434799-6 (DE-588)4135576-3
title	Principles of model checking
title_auth	Principles of model checking
title_exact_search	Principles of model checking
title_full	Principles of model checking Christel Baier ; Joost-Pieter Katoen
title_fullStr	Principles of model checking Christel Baier ; Joost-Pieter Katoen
title_full_unstemmed	Principles of model checking Christel Baier ; Joost-Pieter Katoen
title_short	Principles of model checking
title_sort	principles of model checking
topic	Model Checking (DE-588)4434799-6 gnd Programmverifikation (DE-588)4135576-3 gnd
topic_facet	Model Checking Programmverifikation
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016427288&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT baierchristel principlesofmodelchecking AT katoenjoostpieter principlesofmodelchecking

Availability

Order (Login required)

Table of Contents
Order paper/chapter scan

Branch Library Main Campus, Textbook Collection

Holdings details from Teilbibliothek Stammgelände, Lehrbuchsammlung
Call Number:	0003 DAT 325f 2010 L 925 Floor plan
Copy 1	Available for loan On Shelf
Copy 2	Available for loan On Shelf
Copy 3	Available for loan On Shelf
Copy 4	Available for loan On Shelf
Copy 5	Available for loan On Shelf
Copy 6	Available for loan On Shelf
Copy 7	Available for loan On Shelf
Copy 8	Available for loan On Shelf
Copy 9	Available for loan On Shelf
Copy 10	Available for loan On Shelf
Copy 11	Available for loan On Shelf
Copy 12	Available for loan On Shelf
Copy 13	Available for loan On Shelf
Copy 14	Available for loan On Shelf
Copy 15	Available for loan On Shelf
Copy 16	Available for loan On Shelf
Copy 17	Available for loan On Shelf
Copy 18	Available for loan On Shelf
Copy 19	Available for loan On Shelf
Copy 20	Available for loan On Shelf
Copy 21	Available for loan On Shelf
Copy 22	Available for loan On Shelf
Copy 23	Available for loan On Shelf
Copy 24	Available for loan On Shelf
Copy 25	Available for loan On Shelf
Copy 26	Available for loan On Shelf
Copy 27	Available for loan On Shelf
Copy 28	Available for loan On Shelf
Copy 29	Available for loan On Shelf
Copy 30	Available for loan On Shelf
Copy 31	Available for loan On Shelf
Copy 32	Available for loan On Shelf
Copy 33	Available for loan On Shelf
Copy 34	Available for loan On Shelf
Copy 35	Available for loan On Shelf
Copy 36	Available for loan On Shelf
Copy 37	Available for loan On Shelf
Copy 38	Available for loan On Shelf
Copy 39	Available for loan On Shelf
Copy 40	Available for loan Ausgeliehen – Due: 06.05.2025

Branch Library Main Campus

Holdings details from Teilbibliothek Stammgelände
Call Number:	0004 DAT 325f 2010 B 2964 Floor plan
Copy 1	Not available for loan On Shelf

Branch Library Mathematics & Informatics

Holdings details from Teilbibliothek Mathematik & Informatik
Call Number:	0102 DAT 325f 2009 B 480 Floor plan 0104 DAT 325f 2009 B 480 Floor plan
Copy 1	Available for loan On Shelf
Copy 2	Available for loan On Shelf
Copy 1	Not available for loan On Shelf

Branch Library Chemistry, Textbook Collection

Holdings details from Teilbibliothek Chemie, Lehrbuchsammlung
Call Number:	0303 DAT 325f 2009 L 208 Floor plan
Copy 1	Available for loan On Shelf
Copy 2	Available for loan On Shelf
Copy 3	Available for loan On Shelf
Copy 4	Available for loan On Shelf
Copy 5	Available for loan On Shelf
Copy 6	Available for loan On Shelf
Copy 7	Available for loan On Shelf
Copy 8	Available for loan On Shelf
Copy 9	Available for loan On Shelf
Copy 10	Available for loan On Shelf
Copy 11	Available for loan On Shelf
Copy 12	Available for loan On Shelf
Copy 13	Available for loan On Shelf
Copy 14	Available for loan On Shelf
Copy 15	Available for loan On Shelf
Copy 16	Available for loan On Shelf