Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs
Communication and concurrency are essential in understanding complex dynamic systems, and there have been many theories to deal with them such as Petri nets, CSP and ACP. Among them, CCS (process calculus is one of the most important and mathematically developed models of communication and concurren...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
2001
|
| Edition: | 1st ed. 2001 |
| Subjects: | |
| Online Access: | UBY01 Volltext |
| Summary: | Communication and concurrency are essential in understanding complex dynamic systems, and there have been many theories to deal with them such as Petri nets, CSP and ACP. Among them, CCS (process calculus is one of the most important and mathematically developed models of communication and concurrency. Various behavior equivalences between agents, such as (strong and weak) bisimilarity, observation congruence, trace equivalence, testing equivalence and failure equivalence, are central notions in process calculus. In the real applications of process calculus, specification and implementation are described as two agents, correctness of programs is treated as a certain behavior equivalence between specification and implementation, and then the proof of correctness of programs is a task to establish some behavior equivalence between them. The goal of this book is to provide some suitable and useful concepts and tools for the understanding and analysis of approximate correctness of programs in concurrent systems. Throughout this book the focus is on the framework of process calculus, and the main idea is to construct some natural and reasonable topological structures which can reveal suitably a mechanism of approximate computation in process calculus and to work out various relationships among processes which are compatible with these topological structures |
| Physical Description: | 1 Online-Ressource (VIII, 220 p) |
| ISBN: | 9781461301233 |
| DOI: | 10.1007/978-1-4613-0123-3 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064186 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461301233 |9 978-1-4613-0123-3 | ||
| 024 | 7 | |a 10.1007/978-1-4613-0123-3 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-4613-0123-3 | ||
| 035 | |a (OCoLC)1227477036 | ||
| 035 | |a (DE-599)BVBBV047064186 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 100 | 1 | |a Ying, Mingsheng |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Topology in Process Calculus |b Approximate Correctness and Infinite Evolution of Concurrent Programs |c by Mingsheng Ying |
| 250 | |a 1st ed. 2001 | ||
| 264 | 1 | |a New York, NY |b Springer New York |c 2001 | |
| 300 | |a 1 Online-Ressource (VIII, 220 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a Communication and concurrency are essential in understanding complex dynamic systems, and there have been many theories to deal with them such as Petri nets, CSP and ACP. Among them, CCS (process calculus is one of the most important and mathematically developed models of communication and concurrency. Various behavior equivalences between agents, such as (strong and weak) bisimilarity, observation congruence, trace equivalence, testing equivalence and failure equivalence, are central notions in process calculus. In the real applications of process calculus, specification and implementation are described as two agents, correctness of programs is treated as a certain behavior equivalence between specification and implementation, and then the proof of correctness of programs is a task to establish some behavior equivalence between them. The goal of this book is to provide some suitable and useful concepts and tools for the understanding and analysis of approximate correctness of programs in concurrent systems. Throughout this book the focus is on the framework of process calculus, and the main idea is to construct some natural and reasonable topological structures which can reveal suitably a mechanism of approximate computation in process calculus and to work out various relationships among processes which are compatible with these topological structures | ||
| 650 | 4 | |a Software Engineering/Programming and Operating Systems | |
| 650 | 4 | |a Software engineering | |
| 650 | 0 | 7 | |a Korrektheit |0 (DE-588)4240223-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Bisimulation |0 (DE-588)4619739-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Paralleles Programm |0 (DE-588)4552796-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prozessalgebra |0 (DE-588)4283920-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Paralleles Programm |0 (DE-588)4552796-9 |D s |
| 689 | 0 | 1 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
| 689 | 0 | 2 | |a Beweis |0 (DE-588)4132532-1 |D s |
| 689 | 0 | 3 | |a Prozessalgebra |0 (DE-588)4283920-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Bisimulation |0 (DE-588)4619739-4 |D s |
| 689 | 1 | 1 | |a Prozessalgebra |0 (DE-588)4283920-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780387950921 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461265221 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461301240 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4613-0123-3 |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-032471298 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4613-0123-3 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804182061871792128 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Ying, Mingsheng |
| author_facet | Ying, Mingsheng |
| author_role | aut |
| author_sort | Ying, Mingsheng |
| author_variant | m y my |
| building | Verbundindex |
| bvnumber | BV047064186 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-1-4613-0123-3 (OCoLC)1227477036 (DE-599)BVBBV047064186 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-1-4613-0123-3 |
| edition | 1st ed. 2001 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03606nmm a2200577zc 4500</leader><controlfield tag="001">BV047064186</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461301233</subfield><subfield code="9">978-1-4613-0123-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4613-0123-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4613-0123-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227477036</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064186</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.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ying, Mingsheng</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Topology in Process Calculus</subfield><subfield code="b">Approximate Correctness and Infinite Evolution of Concurrent Programs</subfield><subfield code="c">by Mingsheng Ying</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2001</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer New York</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 220 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">Communication and concurrency are essential in understanding complex dynamic systems, and there have been many theories to deal with them such as Petri nets, CSP and ACP. Among them, CCS (process calculus is one of the most important and mathematically developed models of communication and concurrency. Various behavior equivalences between agents, such as (strong and weak) bisimilarity, observation congruence, trace equivalence, testing equivalence and failure equivalence, are central notions in process calculus. In the real applications of process calculus, specification and implementation are described as two agents, correctness of programs is treated as a certain behavior equivalence between specification and implementation, and then the proof of correctness of programs is a task to establish some behavior equivalence between them. The goal of this book is to provide some suitable and useful concepts and tools for the understanding and analysis of approximate correctness of programs in concurrent systems. Throughout this book the focus is on the framework of process calculus, and the main idea is to construct some natural and reasonable topological structures which can reveal suitably a mechanism of approximate computation in process calculus and to work out various relationships among processes which are compatible with these topological structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software Engineering/Programming and Operating Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</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="650" ind1="0" ind2="7"><subfield code="a">Bisimulation</subfield><subfield code="0">(DE-588)4619739-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleles Programm</subfield><subfield code="0">(DE-588)4552796-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prozessalgebra</subfield><subfield code="0">(DE-588)4283920-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Paralleles Programm</subfield><subfield code="0">(DE-588)4552796-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Prozessalgebra</subfield><subfield code="0">(DE-588)4283920-8</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">Bisimulation</subfield><subfield code="0">(DE-588)4619739-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Prozessalgebra</subfield><subfield code="0">(DE-588)4283920-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</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">9780387950921</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">9781461265221</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">9781461301240</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4613-0123-3</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-032471298</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4613-0123-3</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.BV047064186 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:22Z |
| indexdate | 2024-07-10T09:01:34Z |
| institution | BVB |
| isbn | 9781461301233 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471298 |
| oclc_num | 1227477036 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (VIII, 220 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer New York |
| record_format | marc |
| spelling | Ying, Mingsheng Verfasser aut Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs by Mingsheng Ying 1st ed. 2001 New York, NY Springer New York 2001 1 Online-Ressource (VIII, 220 p) txt rdacontent c rdamedia cr rdacarrier Communication and concurrency are essential in understanding complex dynamic systems, and there have been many theories to deal with them such as Petri nets, CSP and ACP. Among them, CCS (process calculus is one of the most important and mathematically developed models of communication and concurrency. Various behavior equivalences between agents, such as (strong and weak) bisimilarity, observation congruence, trace equivalence, testing equivalence and failure equivalence, are central notions in process calculus. In the real applications of process calculus, specification and implementation are described as two agents, correctness of programs is treated as a certain behavior equivalence between specification and implementation, and then the proof of correctness of programs is a task to establish some behavior equivalence between them. The goal of this book is to provide some suitable and useful concepts and tools for the understanding and analysis of approximate correctness of programs in concurrent systems. Throughout this book the focus is on the framework of process calculus, and the main idea is to construct some natural and reasonable topological structures which can reveal suitably a mechanism of approximate computation in process calculus and to work out various relationships among processes which are compatible with these topological structures Software Engineering/Programming and Operating Systems Software engineering Korrektheit (DE-588)4240223-2 gnd rswk-swf Bisimulation (DE-588)4619739-4 gnd rswk-swf Beweis (DE-588)4132532-1 gnd rswk-swf Paralleles Programm (DE-588)4552796-9 gnd rswk-swf Prozessalgebra (DE-588)4283920-8 gnd rswk-swf Paralleles Programm (DE-588)4552796-9 s Korrektheit (DE-588)4240223-2 s Beweis (DE-588)4132532-1 s Prozessalgebra (DE-588)4283920-8 s DE-604 Bisimulation (DE-588)4619739-4 s Erscheint auch als Druck-Ausgabe 9780387950921 Erscheint auch als Druck-Ausgabe 9781461265221 Erscheint auch als Druck-Ausgabe 9781461301240 https://doi.org/10.1007/978-1-4613-0123-3 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Ying, Mingsheng Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs Software Engineering/Programming and Operating Systems Software engineering Korrektheit (DE-588)4240223-2 gnd Bisimulation (DE-588)4619739-4 gnd Beweis (DE-588)4132532-1 gnd Paralleles Programm (DE-588)4552796-9 gnd Prozessalgebra (DE-588)4283920-8 gnd |
| subject_GND | (DE-588)4240223-2 (DE-588)4619739-4 (DE-588)4132532-1 (DE-588)4552796-9 (DE-588)4283920-8 |
| title | Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs |
| title_auth | Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs |
| title_exact_search | Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs |
| title_exact_search_txtP | Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs |
| title_full | Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs by Mingsheng Ying |
| title_fullStr | Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs by Mingsheng Ying |
| title_full_unstemmed | Topology in Process Calculus Approximate Correctness and Infinite Evolution of Concurrent Programs by Mingsheng Ying |
| title_short | Topology in Process Calculus |
| title_sort | topology in process calculus approximate correctness and infinite evolution of concurrent programs |
| title_sub | Approximate Correctness and Infinite Evolution of Concurrent Programs |
| topic | Software Engineering/Programming and Operating Systems Software engineering Korrektheit (DE-588)4240223-2 gnd Bisimulation (DE-588)4619739-4 gnd Beweis (DE-588)4132532-1 gnd Paralleles Programm (DE-588)4552796-9 gnd Prozessalgebra (DE-588)4283920-8 gnd |
| topic_facet | Software Engineering/Programming and Operating Systems Software engineering Korrektheit Bisimulation Beweis Paralleles Programm Prozessalgebra |
| url | https://doi.org/10.1007/978-1-4613-0123-3 |
| work_keys_str_mv | AT yingmingsheng topologyinprocesscalculusapproximatecorrectnessandinfiniteevolutionofconcurrentprograms |