Concurrency in Dependable Computing:
Concurrency in Dependable Computing focuses on concurrency related issues in the area of dependable computing. Failures of system components, be hardware units or software modules, can be viewed as undesirable events occurring concurrently with a set of normal system events. Achieving dependability...
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer US
2002
|
| Ausgabe: | 1st ed. 2002 |
| Schlagworte: | |
| Online-Zugang: | UBY01 Volltext |
| Zusammenfassung: | Concurrency in Dependable Computing focuses on concurrency related issues in the area of dependable computing. Failures of system components, be hardware units or software modules, can be viewed as undesirable events occurring concurrently with a set of normal system events. Achieving dependability therefore is closely related to, and also benefits from, concurrency theory and formalisms. This beneficial relationship appears to manifest into three strands of work. Application level structuring of concurrent activities. Concepts such as atomic actions, conversations, exception handling, view synchrony, etc., are useful in structuring concurrent activities so as to facilitate attempts at coping with the effects of component failures. Replication induced concurrency management. Replication is a widely used technique for achieving reliability. Replica management essentially involves ensuring that replicas perceive concurrent events identically. Application of concurrency formalisms for dependability assurance. Fault-tolerant algorithms are harder to verify than their fault-free counterparts due to the fact that the impact of component faults at each state need to be considered in addition to valid state transitions. CSP, Petri nets, CCS are useful tools to specify and verify fault-tolerant designs and protocols. Concurrency in Dependable Computing explores many significant issues in all three strands. To this end, it is composed as a collection of papers written by authors well-known in their respective areas of research. To ensure quality, the papers are reviewed by a panel of at least three experts in the relevant area |
| Beschreibung: | 1 Online-Ressource (XVIII, 310 p) |
| ISBN: | 9781475735734 |
| DOI: | 10.1007/978-1-4757-3573-4 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064661 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475735734 |9 978-1-4757-3573-4 | ||
| 024 | 7 | |a 10.1007/978-1-4757-3573-4 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-4757-3573-4 | ||
| 035 | |a (OCoLC)1227476723 | ||
| 035 | |a (DE-599)BVBBV047064661 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 005.73 |2 23 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 150 |0 (DE-625)143594: |2 rvk | ||
| 084 | |a ST 233 |0 (DE-625)143620: |2 rvk | ||
| 245 | 1 | 0 | |a Concurrency in Dependable Computing |c edited by Paul Ezhilchelvan, Alexander Romanovsky |
| 250 | |a 1st ed. 2002 | ||
| 264 | 1 | |a New York, NY |b Springer US |c 2002 | |
| 300 | |a 1 Online-Ressource (XVIII, 310 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a Concurrency in Dependable Computing focuses on concurrency related issues in the area of dependable computing. Failures of system components, be hardware units or software modules, can be viewed as undesirable events occurring concurrently with a set of normal system events. Achieving dependability therefore is closely related to, and also benefits from, concurrency theory and formalisms. This beneficial relationship appears to manifest into three strands of work. Application level structuring of concurrent activities. Concepts such as atomic actions, conversations, exception handling, view synchrony, etc., are useful in structuring concurrent activities so as to facilitate attempts at coping with the effects of component failures. Replication induced concurrency management. Replication is a widely used technique for achieving reliability. Replica management essentially involves ensuring that replicas perceive concurrent events identically. Application of concurrency formalisms for dependability assurance. Fault-tolerant algorithms are harder to verify than their fault-free counterparts due to the fact that the impact of component faults at each state need to be considered in addition to valid state transitions. CSP, Petri nets, CCS are useful tools to specify and verify fault-tolerant designs and protocols. Concurrency in Dependable Computing explores many significant issues in all three strands. To this end, it is composed as a collection of papers written by authors well-known in their respective areas of research. To ensure quality, the papers are reviewed by a panel of at least three experts in the relevant area | ||
| 650 | 4 | |a Data Structures and Information Theory | |
| 650 | 4 | |a Artificial Intelligence | |
| 650 | 4 | |a Natural Language Processing (NLP) | |
| 650 | 4 | |a Processor Architectures | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Natural language processing (Computer science) | |
| 650 | 4 | |a Microprocessors | |
| 650 | 0 | 7 | |a Technisches System |0 (DE-588)4126276-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zuverlässigkeit |0 (DE-588)4059245-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Technisches System |0 (DE-588)4126276-1 |D s |
| 689 | 0 | 1 | |a Zuverlässigkeit |0 (DE-588)4059245-5 |D s |
| 689 | 0 | 2 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Ezhilchelvan, Paul |4 edt | |
| 700 | 1 | |a Romanovsky, Alexander |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781441952783 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781402070433 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781475735741 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-3573-4 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471773 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4757-3573-4 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182062990622720 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Ezhilchelvan, Paul Romanovsky, Alexander |
| author2_role | edt edt |
| author2_variant | p e pe a r ar |
| author_facet | Ezhilchelvan, Paul Romanovsky, Alexander |
| building | Verbundindex |
| bvnumber | BV047064661 |
| classification_rvk | ST 130 ST 150 ST 233 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-1-4757-3573-4 (OCoLC)1227476723 (DE-599)BVBBV047064661 |
| dewey-full | 005.73 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.73 |
| dewey-search | 005.73 |
| dewey-sort | 15.73 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-1-4757-3573-4 |
| edition | 1st ed. 2002 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03993nmm a2200625zc 4500</leader><controlfield tag="001">BV047064661</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475735734</subfield><subfield code="9">978-1-4757-3573-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-3573-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4757-3573-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227476723</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064661</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="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.73</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 150</subfield><subfield code="0">(DE-625)143594:</subfield><subfield code="2">rvk</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="245" ind1="1" ind2="0"><subfield code="a">Concurrency in Dependable Computing</subfield><subfield code="c">edited by Paul Ezhilchelvan, Alexander Romanovsky</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2002</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVIII, 310 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Concurrency in Dependable Computing focuses on concurrency related issues in the area of dependable computing. Failures of system components, be hardware units or software modules, can be viewed as undesirable events occurring concurrently with a set of normal system events. Achieving dependability therefore is closely related to, and also benefits from, concurrency theory and formalisms. This beneficial relationship appears to manifest into three strands of work. Application level structuring of concurrent activities. Concepts such as atomic actions, conversations, exception handling, view synchrony, etc., are useful in structuring concurrent activities so as to facilitate attempts at coping with the effects of component failures. Replication induced concurrency management. Replication is a widely used technique for achieving reliability. Replica management essentially involves ensuring that replicas perceive concurrent events identically. Application of concurrency formalisms for dependability assurance. Fault-tolerant algorithms are harder to verify than their fault-free counterparts due to the fact that the impact of component faults at each state need to be considered in addition to valid state transitions. CSP, Petri nets, CCS are useful tools to specify and verify fault-tolerant designs and protocols. Concurrency in Dependable Computing explores many significant issues in all three strands. To this end, it is composed as a collection of papers written by authors well-known in their respective areas of research. To ensure quality, the papers are reviewed by a panel of at least three experts in the relevant area</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures and Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural Language Processing (NLP)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Processor Architectures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural language processing (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Microprocessors</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Technisches System</subfield><subfield code="0">(DE-588)4126276-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zuverlässigkeit</subfield><subfield code="0">(DE-588)4059245-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Technisches System</subfield><subfield code="0">(DE-588)4126276-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Zuverlässigkeit</subfield><subfield code="0">(DE-588)4059245-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</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">Ezhilchelvan, Paul</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Romanovsky, Alexander</subfield><subfield code="4">edt</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">9781441952783</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">9781402070433</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">9781475735741</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-3573-4</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471773</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4757-3573-4</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064661 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:23Z |
| indexdate | 2024-07-10T09:01:35Z |
| institution | BVB |
| isbn | 9781475735734 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471773 |
| oclc_num | 1227476723 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XVIII, 310 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer US |
| record_format | marc |
| spelling | Concurrency in Dependable Computing edited by Paul Ezhilchelvan, Alexander Romanovsky 1st ed. 2002 New York, NY Springer US 2002 1 Online-Ressource (XVIII, 310 p) txt rdacontent c rdamedia cr rdacarrier Concurrency in Dependable Computing focuses on concurrency related issues in the area of dependable computing. Failures of system components, be hardware units or software modules, can be viewed as undesirable events occurring concurrently with a set of normal system events. Achieving dependability therefore is closely related to, and also benefits from, concurrency theory and formalisms. This beneficial relationship appears to manifest into three strands of work. Application level structuring of concurrent activities. Concepts such as atomic actions, conversations, exception handling, view synchrony, etc., are useful in structuring concurrent activities so as to facilitate attempts at coping with the effects of component failures. Replication induced concurrency management. Replication is a widely used technique for achieving reliability. Replica management essentially involves ensuring that replicas perceive concurrent events identically. Application of concurrency formalisms for dependability assurance. Fault-tolerant algorithms are harder to verify than their fault-free counterparts due to the fact that the impact of component faults at each state need to be considered in addition to valid state transitions. CSP, Petri nets, CCS are useful tools to specify and verify fault-tolerant designs and protocols. Concurrency in Dependable Computing explores many significant issues in all three strands. To this end, it is composed as a collection of papers written by authors well-known in their respective areas of research. To ensure quality, the papers are reviewed by a panel of at least three experts in the relevant area Data Structures and Information Theory Artificial Intelligence Natural Language Processing (NLP) Processor Architectures Data structures (Computer science) Artificial intelligence Natural language processing (Computer science) Microprocessors Technisches System (DE-588)4126276-1 gnd rswk-swf Zuverlässigkeit (DE-588)4059245-5 gnd rswk-swf Nebenläufigkeit (DE-588)4115352-2 gnd rswk-swf Technisches System (DE-588)4126276-1 s Zuverlässigkeit (DE-588)4059245-5 s Nebenläufigkeit (DE-588)4115352-2 s DE-604 Ezhilchelvan, Paul edt Romanovsky, Alexander edt Erscheint auch als Druck-Ausgabe 9781441952783 Erscheint auch als Druck-Ausgabe 9781402070433 Erscheint auch als Druck-Ausgabe 9781475735741 https://doi.org/10.1007/978-1-4757-3573-4 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Concurrency in Dependable Computing Data Structures and Information Theory Artificial Intelligence Natural Language Processing (NLP) Processor Architectures Data structures (Computer science) Artificial intelligence Natural language processing (Computer science) Microprocessors Technisches System (DE-588)4126276-1 gnd Zuverlässigkeit (DE-588)4059245-5 gnd Nebenläufigkeit (DE-588)4115352-2 gnd |
| subject_GND | (DE-588)4126276-1 (DE-588)4059245-5 (DE-588)4115352-2 |
| title | Concurrency in Dependable Computing |
| title_auth | Concurrency in Dependable Computing |
| title_exact_search | Concurrency in Dependable Computing |
| title_exact_search_txtP | Concurrency in Dependable Computing |
| title_full | Concurrency in Dependable Computing edited by Paul Ezhilchelvan, Alexander Romanovsky |
| title_fullStr | Concurrency in Dependable Computing edited by Paul Ezhilchelvan, Alexander Romanovsky |
| title_full_unstemmed | Concurrency in Dependable Computing edited by Paul Ezhilchelvan, Alexander Romanovsky |
| title_short | Concurrency in Dependable Computing |
| title_sort | concurrency in dependable computing |
| topic | Data Structures and Information Theory Artificial Intelligence Natural Language Processing (NLP) Processor Architectures Data structures (Computer science) Artificial intelligence Natural language processing (Computer science) Microprocessors Technisches System (DE-588)4126276-1 gnd Zuverlässigkeit (DE-588)4059245-5 gnd Nebenläufigkeit (DE-588)4115352-2 gnd |
| topic_facet | Data Structures and Information Theory Artificial Intelligence Natural Language Processing (NLP) Processor Architectures Data structures (Computer science) Artificial intelligence Natural language processing (Computer science) Microprocessors Technisches System Zuverlässigkeit Nebenläufigkeit |
| url | https://doi.org/10.1007/978-1-4757-3573-4 |
| work_keys_str_mv | AT ezhilchelvanpaul concurrencyindependablecomputing AT romanovskyalexander concurrencyindependablecomputing |