Holdings: Verification of reactive systems

Verification of reactive systems: formal methods and algorithms

Saved in:

Bibliographic Details
Main Author:	Schneider, Klaus (Author)
Format:	Book
Language:	English
Published:	Berlin [u.a.] Springer 2004
Series:	Texts in theoretical computer science
Subjects:	Reaktives System - Verifikation - Formale Spezifikationstechnik - Model Checking - Endlicher Automat - Temporale Logik Computer algorithms Computer systems > Verification Formal methods (Computer science) Verifikation Temporale Logik Endlicher Automat Model Checking Reaktives System Formale Spezifikationstechnik
Online Access:	Inhaltsverzeichnis
Physical Description:	XIV, 600 S. graph. Darst.
ISBN:	3540002960

Staff View

MARC


LEADER	00000nam a2200000 c 4500
001	BV016523555
003	DE-604
005	20200626
007	t
008	030211s2004 gw d\|\|\| \|\|\|\| 00\|\|\| eng d
016	7		\|a 966197895 \|2 DE-101
020			\|a 3540002960 \|9 3-540-00296-0
035			\|a (OCoLC)248898129
035			\|a (DE-599)BVBBV016523555
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a gw \|c DE
049			\|a DE-824 \|a DE-384 \|a DE-29T \|a DE-473 \|a DE-20 \|a DE-M347 \|a DE-19 \|a DE-706 \|a DE-634 \|a DE-83 \|a DE-11 \|a DE-898
050		0	\|a QA76.76.V47
082	0		\|a 004.21
084			\|a ST 136 \|0 (DE-625)143591: \|2 rvk
084			\|a ST 230 \|0 (DE-625)143617: \|2 rvk
084			\|a ST 234 \|0 (DE-625)143621: \|2 rvk
084			\|a 68Q60 \|2 msc
100	1		\|a Schneider, Klaus \|e Verfasser \|4 aut
245	1	0	\|a Verification of reactive systems \|b formal methods and algorithms \|c Klaus Schneider
264		1	\|a Berlin [u.a.] \|b Springer \|c 2004
300			\|a XIV, 600 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a Texts in theoretical computer science
650		4	\|a Reaktives System - Verifikation - Formale Spezifikationstechnik - Model Checking - Endlicher Automat - Temporale Logik
650		4	\|a Computer algorithms
650		4	\|a Computer systems \|x Verification
650		4	\|a Formal methods (Computer science)
650	0	7	\|a Verifikation \|0 (DE-588)4135577-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Temporale Logik \|0 (DE-588)4137542-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Endlicher Automat \|0 (DE-588)4224518-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Model Checking \|0 (DE-588)4434799-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Reaktives System \|0 (DE-588)4637514-4 \|2 gnd \|9 rswk-swf
650	0	7	\|a Formale Spezifikationstechnik \|0 (DE-588)4299725-2 \|2 gnd \|9 rswk-swf
689	0	0	\|a Reaktives System \|0 (DE-588)4637514-4 \|D s
689	0	1	\|a Verifikation \|0 (DE-588)4135577-5 \|D s
689	0	2	\|a Formale Spezifikationstechnik \|0 (DE-588)4299725-2 \|D s
689	0	3	\|a Model Checking \|0 (DE-588)4434799-6 \|D s
689	0	4	\|a Endlicher Automat \|0 (DE-588)4224518-7 \|D s
689	0	5	\|a Temporale Logik \|0 (DE-588)4137542-7 \|D s
689	0		\|5 DE-604
856	4	2	\|m SWB Datenaustausch \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010211531&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-010211531

Record in the Search Index

_version_	1804129839240708096
adam_text	CONTENTS 1 INTRODUCTION :::::::::::::::::::::::::::::::::::::::::::::::: 1 1.1 FORMAL METHODS IN SYSTEM DESIGN . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 GENERAL REMARKS AND TAXONOMY . . . . . . . . . . . . . . . . . . . . 1 1.1.2 CLASSIFICATION OF FORMAL METHODS . . . . . . . . . . . . . . . . . . . . 4 1.1.3 CLASSIFICATION OF SYSTEMS . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.2 GENEALOGY OF FORMAL VERIFICATION . . . . . . . . . . . . . . . . . . . . . . . . . . 16 1.2.1 EARLY BEGINNINGS OF MATHEMATICAL LOGIC . . . . . . . . . . . . . . 16 1.2.2 AUTOMATED THEOREM PROVING . . . . . . . . . . . . . . . . . . . . . . . 20 1.2.3 BEGINNINGS OF PROGRAM VERIFICATION . . . . . . . . . . . . . . . . . . 23 1.2.4 DYNAMIC LOGICS AND FIXPOINT CALCULI . . . . . . . . . . . . . . . . 24 1.2.5 TEMPORAL LOGICS. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 1.2.6 DECIDABLE THEORIES AND ! -AUTOMATA . . . . . . . . . . . . . . . . . 33 1.2.7 SUMMARY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 1.3 OUTLINE OF THE BOOK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 2 A UNIFIED SPECIFICATION LANGUAGE ::::::::::::::::::::::::::::: 45 2.1 KRIPKE STRUCTURES AS FORMAL MODELS OF REACTIVE SYSTEMS . . . . . 45 2.1.1 SIMULATION AND BISIMULATION OF KRIPKE STRUCTURES . . . . . 53 2.1.2 QUOTIENT STRUCTURES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 2.1.3 PRODUCTS OF KRIPKE STRUCTURES . . . . . . . . . . . . . . . . . . . . . . . 66 2.2 SYNTAX OF THE SPECIFICATION LOGIC L SPEC . . . . . . . . . . . . . . . . . . . . . . 68 2.3 SEMANTICS OF THE SPECIFICATION LOGIC L SPEC . . . . . . . . . . . . . . . . . . . 77 2.4 NORMAL FORMS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 3 FIXPOINT CALCULI ::::::::::::::::::::::::::::::::::::::::::::: 89 3.1 PARTIAL ORDERS, LATTICES AND FIXPOINTS . . . . . . . . . . . . . . . . . . . . . . 90 3.2 THE BASIC * -CALCULUS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 3.3 MONOTONICITY OF STATE TRANSFORMERS . . . . . . . . . . . . . . . . . . . . . . . . 103 3.4 MODEL CHECKING OF THE BASIC * -CALCULUS . . . . . . . . . . . . . . . . . . . . 108 3.4.1 A NAIVE MODEL CHECKING PROCEDURE . . . . . . . . . . . . . . . . . 108 3.4.2 OPTIMIZATION BY THE ALTERNATION DEPTH . . . . . . . . . . . . . . 111 XII CONTENTS 3.5 VECTORIZED * -CALCULUS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118 3.5.1 STATE TRANSFORMERS OF VECTORIZED FIXPOINT EXPRESSIONS . 119 3.5.2 DECOMPOSING EQUATION SYSTEMS . . . . . . . . . . . . . . . . . . . . . 124 3.5.3 MODEL CHECKING VECTORIZED FIXPOINT EXPRESSIONS . . . . . 129 3.5.4 COMPARING BASIC AND VECTORIZED * -CALCULUS MODEL CHECKING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138 3.5.5 DEPENDENCY-TRIGGERED EVALUATIONS . . . . . . . . . . . . . . . . . . 142 3.5.6 THE CLEAVELAND-STEFFEN ALGORITHM . . . . . . . . . . . . . . . . . . . 148 3.6 REDUCING THE ALTERNATION DEPTH W.R.T. STRUCTURES . . . . . . . . . . . . 159 3.7 COMPUTING FAIR STATES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 164 3.8 FINAL REMARKS ON COMPLETENESS AND EXPRESSIVENESS . . . . . . . . . 169 3.8.1 BISIMILARITY AND THE FUTURE FRAGMENT . . . . . . . . . . . . . . . . 169 3.8.2 RELATIONSHIP TO ! -TREE AUTOMATA AND GAMES . . . . . . . . . 173 3.8.3 DYNAMIC LOGIC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175 4 FINITE AUTOMATA :::::::::::::::::::::::::::::::::::::::::::: 183 4.1 REGULAR LANGUAGES, REGULAR EXPRESSIONS AND AUTOMATA . . . . . 186 4.2 THE LOGIC OF AUTOMATON FORMULAS . . . . . . . . . . . . . . . . . . . . . . . . . 189 4.3 BOOLEAN CLOSURE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194 4.4 CONVERTING AUTOMATON CLASSES . . . . . . . . . . . . . . . . . . . . . . . . . . . . 202 4.5 DETERMINIZATION AND COMPLEMENTATION . . . . . . . . . . . . . . . . . . . . 209 4.5.1 THE RABIN-SCOTT SUBSET CONSTRUCTION . . . . . . . . . . . . . . . . . 210 4.5.2 DETERMINIZATION OF NDET F . . . . . . . . . . . . . . . . . . . . . . . . . . . 213 4.5.3 DETERMINIZATION OF NDET G . . . . . . . . . . . . . . . . . . . . . . . . . . . 215 4.5.4 DETERMINIZATION OF NDET FG . . . . . . . . . . . . . . . . . . . . . . . . . . 219 4.5.5 REDUCING NDET GF TO DET RABIN . . . . . . . . . . . . . . . . . . . . . . . . . 223 4.6 THE HIERARCHY OF ! -AUTOMATA AND THE BOREL HIERARCHY . . . . . . 236 4.7 AUTOMATA AND MONOIDS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 252 4.7.1 FINITE SEMIGROUPS AND MONOIDS . . . . . . . . . . . . . . . . . . . . . 252 4.7.2 AUTOMATA AND THEIR MONOIDS . . . . . . . . . . . . . . . . . . . . . . . 257 4.8 DECISION PROCEDURES FOR ! -AUTOMATA . . . . . . . . . . . . . . . . . . . . . . . 264 4.8.1 FLATTENING ! -AUTOMATA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265 4.8.2 TRANSLATING L ! MODEL CHECKING TO L * MODEL CHECKING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 267 4.8.3 TRANSLATING AUTOMATA TO VECTORIZED * -CALCULUS . . . . . . 270 5 TEMPORAL LOGICS :::::::::::::::::::::::::::::::::::::::::::: 279 5.1 INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279 5.2 BRANCHING TIME LOGICS * SUBLANGUAGES OF CTL * . . . . . . . . . . . . . 284 5.2.1 CTL , LTL AND CTL * . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285 5.2.2 ADDING SYNTACTIC SUGAR TO CTL . . . . . . . . . . . . . . . . . . . . . 292 5.3 TRANSLATING TEMPORAL LOGICS TO THE * -CALCULUS . . . . . . . . . . . . . . 299 5.3.1 CTL AND FAIRCTL AS FRAGMENTS OF THE * -CALCULUS . . . . . 300 5.3.2 CTL 2 AS A FRAGMENT OF THE * -CALCULUS . . . . . . . . . . . . . . . 302 5.3.3 ELIMINATING QUANTIFIED BOOLEAN EXPRESSIONS . . . . . . . . . 304 CONTENTS XIII 5.3.4 ADDING PATH QUANTIFIERS . . . . . . . . . . . . . . . . . . . . . . . . . . . 310 5.3.5 TRANSLATING LEFTCTL * TO VECTORIZED * -CALCULUS . . . . . . . . 313 5.4 TRANSLATING TEMPORAL LOGICS TO ! -AUTOMATA . . . . . . . . . . . . . . . . 329 5.4.1 THE BASIC TRANSLATION FROM LTL P TO NDET STREETT . . . . . . . . 331 5.4.2 EXPLOITATION OF MONOTONICITY . . . . . . . . . . . . . . . . . . . . . . . 343 5.4.3 BOREL CLASSES OF TEMPORAL LOGIC . . . . . . . . . . . . . . . . . . . . . 348 5.4.4 REDUCING TEMPORAL BOREL CLASSES TO BOREL AUTOMATA . . 355 5.4.5 REDUCTIONS TO CTL / LEFTCTL * MODEL CHECKING . . . . . . . 365 5.5 COMPLETENESS AND EXPRESSIVENESS OF TEMPORAL LOGIC . . . . . . . . 375 5.5.1 NONCOUNTING AUTOMATA AND TEMPORAL LOGIC . . . . . . . . . 376 5.5.2 COMPLETENESS OF THE BOREL CLASSES . . . . . . . . . . . . . . . . . . . 383 5.5.3 COMPLETENESS OF THE FUTURE FRAGMENTS . . . . . . . . . . . . . . 387 5.6 COMPLEXITIES OF THE MODEL CHECKING PROBLEMS . . . . . . . . . . . . . . 393 5.7 REDUCTIONS BY SIMULATION AND BISIMULATION RELATIONS. . . . . . . . 400 6 PREDICATE LOGIC :::::::::::::::::::::::::::::::::::::::::::::: 405 6.1 INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 405 6.2 PREDICATE LOGICS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 408 6.2.1 SYNTAX AND SEMANTICS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 408 6.2.2 BASICS OF PREDICATE LOGIC . . . . . . . . . . . . . . . . . . . . . . . . . . . 410 6.2.3 FRAGMENTS WITH DECIDABLE SATISFIABILITY PROBLEM . . . . . . 415 6.2.4 EMBEDDING MODAL LOGICS IN PREDICATE LOGIC . . . . . . . . . 421 6.2.5 PREDICATE LOGIC ON LINEARLY ORDERED DOMAINS (ON * ) . 424 6.3 MONADIC SECOND ORDER LOGIC OF LINEAR ORDER MSO . . . . . . . . 428 6.3.1 EQUIVALENCE OF S1S AND MSO . . . . . . . . . . . . . . . . . . . . . . 428 6.3.2 TRANSLATING MSO TO ! -AUTOMATA . . . . . . . . . . . . . . . . . . . 434 6.3.3 BUECHI S DECISION PROCEDURE: NORMAL FORMS FOR S1S . . . 439 6.4 MONADIC FIRST ORDER LOGIC OF LINEAR ORDER MFO . . . . . . . . . . 442 6.5 NON-MONADIC CHARACTERIZATIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . 452 7 CONCLUSIONS :::::::::::::::::::::::::::::::::::::::::::::::: 455 A BINARY DECISION DIAGRAMS ::::::::::::::::::::::::::::::::::: 459 A.1 BASIC DEFINITIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 459 A.2 BASIC ALGORITHMS ON BDDS. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 466 A.3 MINIMIZATION OF BDDS USING CARE SETS . . . . . . . . . . . . . . . . . . . . . 471 A.4 COMPUTING SUCCESSORS AND PREDECESSORS . . . . . . . . . . . . . . . . . . . 477 A.5 VARIABLE REORDERING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483 A.6 FINAL REMARKS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 486 B LOCAL MODEL CHECKING AND SATISFIABILITY CHECKING FOR THE * -CALCULUS ::::::::::::::::::::::::::::::::::::::::::::::::: 487 B.1 A PARTIAL LOCAL MODEL CHECKING PROCEDURE . . . . . . . . . . . . . . . . . 488 B.2 A COMPLETE LOCAL MODEL CHECKING PROCEDURE . . . . . . . . . . . . . . 493 B.3 SATISFIABILITY OF * -CALCULUS FORMULAS . . . . . . . . . . . . . . . . . . . . . . . 500 XIV CONTENTS C REDUCTION OF STRUCTURES :::::::::::::::::::::::::::::::::::::: 527 C.1 GALOIS CONNECTIONS AND SIMULATIONS . . . . . . . . . . . . . . . . . . . . . . . . 527 C.1.1 BASIC PROPERTIES OF GALOIS CONNECTIONS . . . . . . . . . . . . . . . 528 C.1.2 GALOIS SIMULATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 531 C.2 ABSTRACT STRUCTURES AND PRESERVATION RESULTS . . . . . . . . . . . . . . . 534 C.3 OPTIMAL AND FAITHFUL ABSTRACTIONS . . . . . . . . . . . . . . . . . . . . . . . . . 537 C.4 DATA ABSTRACTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 542 C.4.1 ABSTRACT INTERPRETATION OF STRUCTURES . . . . . . . . . . . . . . . . . 544 C.4.2 ABSTRACT SPECIFICATIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 549 C.5 SYMMETRY AND MODEL CHECKING . . . . . . . . . . . . . . . . . . . . . . . . . . . 551 C.5.1 SYMMETRIES OF STRUCTURES. . . . . . . . . . . . . . . . . . . . . . . . . . . . 552 C.5.2 SYMMETRIES IN THE SPECIFICATION . . . . . . . . . . . . . . . . . . . . . . 557 REFERENCES :::::::::::::::::::::::::::::::::::::::::::::::::::::: 561 INDEX :::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 591
any_adam_object	1
author	Schneider, Klaus
author_facet	Schneider, Klaus
author_role	aut
author_sort	Schneider, Klaus
author_variant	k s ks
building	Verbundindex
bvnumber	BV016523555
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 136 ST 230 ST 234
ctrlnum	(OCoLC)248898129 (DE-599)BVBBV016523555
dewey-full	004.21
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.21
dewey-search	004.21
dewey-sort	14.21
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>02428nam a2200577 c 4500</leader><controlfield tag="001">BV016523555</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200626 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">030211s2004 gw d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">966197895</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540002960</subfield><subfield code="9">3-540-00296-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248898129</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV016523555</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-824</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-898</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.21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 234</subfield><subfield code="0">(DE-625)143621:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q60</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schneider, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Verification of reactive systems</subfield><subfield code="b">formal methods and algorithms</subfield><subfield code="c">Klaus Schneider</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 600 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="0" ind2=" "><subfield code="a">Texts in theoretical computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reaktives System - Verifikation - Formale Spezifikationstechnik - Model Checking - Endlicher Automat - Temporale Logik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer systems</subfield><subfield code="x">Verification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal methods (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verifikation</subfield><subfield code="0">(DE-588)4135577-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Temporale Logik</subfield><subfield code="0">(DE-588)4137542-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Reaktives System</subfield><subfield code="0">(DE-588)4637514-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Spezifikationstechnik</subfield><subfield code="0">(DE-588)4299725-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Reaktives System</subfield><subfield code="0">(DE-588)4637514-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Verifikation</subfield><subfield code="0">(DE-588)4135577-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Formale Spezifikationstechnik</subfield><subfield code="0">(DE-588)4299725-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><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="4"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Temporale Logik</subfield><subfield code="0">(DE-588)4137542-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">SWB 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=010211531&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-010211531</subfield></datafield></record></collection>
id	DE-604.BV016523555
illustrated	Illustrated
indexdate	2024-07-09T19:11:31Z
institution	BVB
isbn	3540002960
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-010211531
oclc_num	248898129
open_access_boolean
owner	DE-824 DE-384 DE-29T DE-473 DE-BY-UBG DE-20 DE-M347 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-898 DE-BY-UBR
owner_facet	DE-824 DE-384 DE-29T DE-473 DE-BY-UBG DE-20 DE-M347 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-898 DE-BY-UBR
physical	XIV, 600 S. graph. Darst.
publishDate	2004
publishDateSearch	2004
publishDateSort	2004
publisher	Springer
record_format	marc
series2	Texts in theoretical computer science
spelling	Schneider, Klaus Verfasser aut Verification of reactive systems formal methods and algorithms Klaus Schneider Berlin [u.a.] Springer 2004 XIV, 600 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Texts in theoretical computer science Reaktives System - Verifikation - Formale Spezifikationstechnik - Model Checking - Endlicher Automat - Temporale Logik Computer algorithms Computer systems Verification Formal methods (Computer science) Verifikation (DE-588)4135577-5 gnd rswk-swf Temporale Logik (DE-588)4137542-7 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Model Checking (DE-588)4434799-6 gnd rswk-swf Reaktives System (DE-588)4637514-4 gnd rswk-swf Formale Spezifikationstechnik (DE-588)4299725-2 gnd rswk-swf Reaktives System (DE-588)4637514-4 s Verifikation (DE-588)4135577-5 s Formale Spezifikationstechnik (DE-588)4299725-2 s Model Checking (DE-588)4434799-6 s Endlicher Automat (DE-588)4224518-7 s Temporale Logik (DE-588)4137542-7 s DE-604 SWB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010211531&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Schneider, Klaus Verification of reactive systems formal methods and algorithms Reaktives System - Verifikation - Formale Spezifikationstechnik - Model Checking - Endlicher Automat - Temporale Logik Computer algorithms Computer systems Verification Formal methods (Computer science) Verifikation (DE-588)4135577-5 gnd Temporale Logik (DE-588)4137542-7 gnd Endlicher Automat (DE-588)4224518-7 gnd Model Checking (DE-588)4434799-6 gnd Reaktives System (DE-588)4637514-4 gnd Formale Spezifikationstechnik (DE-588)4299725-2 gnd
subject_GND	(DE-588)4135577-5 (DE-588)4137542-7 (DE-588)4224518-7 (DE-588)4434799-6 (DE-588)4637514-4 (DE-588)4299725-2
title	Verification of reactive systems formal methods and algorithms
title_auth	Verification of reactive systems formal methods and algorithms
title_exact_search	Verification of reactive systems formal methods and algorithms
title_full	Verification of reactive systems formal methods and algorithms Klaus Schneider
title_fullStr	Verification of reactive systems formal methods and algorithms Klaus Schneider
title_full_unstemmed	Verification of reactive systems formal methods and algorithms Klaus Schneider
title_short	Verification of reactive systems
title_sort	verification of reactive systems formal methods and algorithms
title_sub	formal methods and algorithms
topic	Reaktives System - Verifikation - Formale Spezifikationstechnik - Model Checking - Endlicher Automat - Temporale Logik Computer algorithms Computer systems Verification Formal methods (Computer science) Verifikation (DE-588)4135577-5 gnd Temporale Logik (DE-588)4137542-7 gnd Endlicher Automat (DE-588)4224518-7 gnd Model Checking (DE-588)4434799-6 gnd Reaktives System (DE-588)4637514-4 gnd Formale Spezifikationstechnik (DE-588)4299725-2 gnd
topic_facet	Reaktives System - Verifikation - Formale Spezifikationstechnik - Model Checking - Endlicher Automat - Temporale Logik Computer algorithms Computer systems Verification Formal methods (Computer science) Verifikation Temporale Logik Endlicher Automat Model Checking Reaktives System Formale Spezifikationstechnik
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010211531&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT schneiderklaus verificationofreactivesystemsformalmethodsandalgorithms

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Indexes

MARC

Record in the Search Index

There is no print copy available.

Similar Items