Verfügbarkeit: Decidability and complexity of model checking problems for infinite state systems

Decidability and complexity of model checking problems for infinite state systems:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Mayr, Richard (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	1997
Schlagworte:	Unentscheidbarkeit Abzählbarer Zustandsraum Komplexität Petri-Netz Entscheidbarkeit Temporale Logik Korrektheit Hochschulschrift
Beschreibung:	München, Techn. Univ., Diss., 1998
Beschreibung:	190 S.

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV012004379
003	DE-604
005	19981112
007	t
008	980615s1997 m\|\|\| 00\|\|\| engod
035			\|a (OCoLC)214945285
035			\|a (DE-599)BVBBV012004379
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-91 \|a DE-91G \|a DE-29T \|a DE-12 \|a DE-11
084			\|a DAT 517d \|2 stub
084			\|a DAT 542d \|2 stub
100	1		\|a Mayr, Richard \|e Verfasser \|4 aut
245	1	0	\|a Decidability and complexity of model checking problems for infinite state systems \|c Richard Mayr
246	1	3	\|a Decidability and complexity of model checking problems for infinite-state systems
264		1	\|c 1997
300			\|a 190 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
500			\|a München, Techn. Univ., Diss., 1998
650	0	7	\|a Unentscheidbarkeit \|0 (DE-588)4294363-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Abzählbarer Zustandsraum \|0 (DE-588)4401259-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexität \|0 (DE-588)4135369-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Petri-Netz \|0 (DE-588)4045388-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Entscheidbarkeit \|0 (DE-588)4152398-2 \|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 Korrektheit \|0 (DE-588)4240223-2 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a Entscheidbarkeit \|0 (DE-588)4152398-2 \|D s
689	0	1	\|a Komplexität \|0 (DE-588)4135369-9 \|D s
689	0	2	\|a Abzählbarer Zustandsraum \|0 (DE-588)4401259-7 \|D s
689	0	3	\|a Korrektheit \|0 (DE-588)4240223-2 \|D s
689	0		\|5 DE-604
689	1	0	\|a Temporale Logik \|0 (DE-588)4137542-7 \|D s
689	1		\|8 1\p \|5 DE-604
689	2	0	\|a Unentscheidbarkeit \|0 (DE-588)4294363-2 \|D s
689	2		\|8 2\p \|5 DE-604
689	3	0	\|a Petri-Netz \|0 (DE-588)4045388-1 \|D s
689	3		\|8 3\p \|5 DE-604
999			\|a oai:aleph.bib-bvb.de:BVB01-008123376
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 3\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk

Datensatz im Suchindex

_version_	1804126599486898176
any_adam_object
author	Mayr, Richard
author_facet	Mayr, Richard
author_role	aut
author_sort	Mayr, Richard
author_variant	r m rm
building	Verbundindex
bvnumber	BV012004379
classification_tum	DAT 517d DAT 542d
ctrlnum	(OCoLC)214945285 (DE-599)BVBBV012004379
discipline	Informatik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02177nam a2200553 c 4500</leader><controlfield tag="001">BV012004379</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19981112 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980615s1997 m\|\|\| 00\|\|\| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)214945285</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012004379</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="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mayr, Richard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Decidability and complexity of model checking problems for infinite state systems</subfield><subfield code="c">Richard Mayr</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Decidability and complexity of model checking problems for infinite-state systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">190 S.</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">München, Techn. Univ., Diss., 1998</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Unentscheidbarkeit</subfield><subfield code="0">(DE-588)4294363-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abzählbarer Zustandsraum</subfield><subfield code="0">(DE-588)4401259-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</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">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</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">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Abzählbarer Zustandsraum</subfield><subfield code="0">(DE-588)4401259-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Temporale Logik</subfield><subfield code="0">(DE-588)4137542-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Unentscheidbarkeit</subfield><subfield code="0">(DE-588)4294363-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008123376</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV012004379
illustrated	Not Illustrated
indexdate	2024-07-09T18:20:01Z
institution	BVB
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-008123376
oclc_num	214945285
open_access_boolean
owner	DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-29T DE-12 DE-11
owner_facet	DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-29T DE-12 DE-11
physical	190 S.
publishDate	1997
publishDateSearch	1997
publishDateSort	1997
record_format	marc
spelling	Mayr, Richard Verfasser aut Decidability and complexity of model checking problems for infinite state systems Richard Mayr Decidability and complexity of model checking problems for infinite-state systems 1997 190 S. txt rdacontent n rdamedia nc rdacarrier München, Techn. Univ., Diss., 1998 Unentscheidbarkeit (DE-588)4294363-2 gnd rswk-swf Abzählbarer Zustandsraum (DE-588)4401259-7 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Petri-Netz (DE-588)4045388-1 gnd rswk-swf Entscheidbarkeit (DE-588)4152398-2 gnd rswk-swf Temporale Logik (DE-588)4137542-7 gnd rswk-swf Korrektheit (DE-588)4240223-2 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Entscheidbarkeit (DE-588)4152398-2 s Komplexität (DE-588)4135369-9 s Abzählbarer Zustandsraum (DE-588)4401259-7 s Korrektheit (DE-588)4240223-2 s DE-604 Temporale Logik (DE-588)4137542-7 s 1\p DE-604 Unentscheidbarkeit (DE-588)4294363-2 s 2\p DE-604 Petri-Netz (DE-588)4045388-1 s 3\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Mayr, Richard Decidability and complexity of model checking problems for infinite state systems Unentscheidbarkeit (DE-588)4294363-2 gnd Abzählbarer Zustandsraum (DE-588)4401259-7 gnd Komplexität (DE-588)4135369-9 gnd Petri-Netz (DE-588)4045388-1 gnd Entscheidbarkeit (DE-588)4152398-2 gnd Temporale Logik (DE-588)4137542-7 gnd Korrektheit (DE-588)4240223-2 gnd
subject_GND	(DE-588)4294363-2 (DE-588)4401259-7 (DE-588)4135369-9 (DE-588)4045388-1 (DE-588)4152398-2 (DE-588)4137542-7 (DE-588)4240223-2 (DE-588)4113937-9
title	Decidability and complexity of model checking problems for infinite state systems
title_alt	Decidability and complexity of model checking problems for infinite-state systems
title_auth	Decidability and complexity of model checking problems for infinite state systems
title_exact_search	Decidability and complexity of model checking problems for infinite state systems
title_full	Decidability and complexity of model checking problems for infinite state systems Richard Mayr
title_fullStr	Decidability and complexity of model checking problems for infinite state systems Richard Mayr
title_full_unstemmed	Decidability and complexity of model checking problems for infinite state systems Richard Mayr
title_short	Decidability and complexity of model checking problems for infinite state systems
title_sort	decidability and complexity of model checking problems for infinite state systems
topic	Unentscheidbarkeit (DE-588)4294363-2 gnd Abzählbarer Zustandsraum (DE-588)4401259-7 gnd Komplexität (DE-588)4135369-9 gnd Petri-Netz (DE-588)4045388-1 gnd Entscheidbarkeit (DE-588)4152398-2 gnd Temporale Logik (DE-588)4137542-7 gnd Korrektheit (DE-588)4240223-2 gnd
topic_facet	Unentscheidbarkeit Abzählbarer Zustandsraum Komplexität Petri-Netz Entscheidbarkeit Temporale Logik Korrektheit Hochschulschrift
work_keys_str_mv	AT mayrrichard decidabilityandcomplexityofmodelcheckingproblemsforinfinitestatesystems

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge