{"product_id":"concurrent-and-real-time-systems-isbn-9780471623731","title":"Concurrent and Real-time Systems","description":"The CSP approach has been widely used in the specification, analysis and verification of concurrent and real-time systems, and for understanding the particular issues that can arise when concurrency is present. It provides a language which enables specifications and designs to be clearly expressed and understood, together with a supporting theory which allows them to be analyzed and shown to be correct.\u003cbr\u003e \u003cbr\u003e This book supports advanced level courses on concurrency covering timed and untimed CSP. The first half introduces the language of CSP, the primary semantic models (traces, failures, divergences and infinite traces), and their use in the modelling, analysis and verification of concurrent systems. The second half of the book introduces time into the language, brings in the timed semantic model (timed failures) and finally presents the theory of timewise refinement which links the two halves together.\u003cbr\u003e \u003cbr\u003e Accompanying website: http:\/\/www.cs.rhbnc.ac.uk\/books\/concurrency\u003cbr\u003e \u003cbr\u003e Containing the following:\u003cbr\u003e \u003cbr\u003e -Exercises and solutions\u003cbr\u003e \u003cbr\u003e -Instructors resources\u003cbr\u003e \u003cbr\u003e - Example CSP programs to run on FDR and ProBe\u003cbr\u003e \u003cbr\u003e -Links to useful sites\u003cbr\u003e \u003cbr\u003e Partial Contents: Part I: The Language of CSP; Sequential Processes; Concurrency; Abstraction and Control Flow; Part II: Analyzing Processes; Traces; Specification and Verification with Traces; Stable Failures; Specification and Verification with Failures; Failures, Divergences, and Infinite Traces; Part III: Introducing Time; The Timed Language; Timed transition systems; Part IV: Timed Analysis; Semantics of Timed CSP; Timed Specification and Verification; Timewise Refinement; Appendix A: Event-based Time; A.1 Standard CSP and $tock$; A.2 Translating from Timed CSP; A.3 Notes; Appendix B: Model-checking with FDR; B.1 Interacting with FDR; B.2 How FDR Checks Refinement; B.3 Machine readable CSP; Index of Processes.Bisher gibt es relativ wenig Bücher, die sich auf einführendem Niveau mit CSP (Communicating Sequential Processes), einer Theorie parallel laufender Systeme (\"concurrent systems\"), beschäftigen. Dieses Werk füllt eine Lücke; es ist das einzige gegenwärtig verfügbare Lehrbuch, an dem sich Dozenten orientieren können, die die Theorie solcher Systeme in vollem Umfang behandeln möchten. Eine ausgezeichnete Auswahl von Beispielen und Übungen motiviert die Studenten, sich näher mit diesem schwierigen Fachgebiet zu beschäftigen. (10\/99)\u003cbr\u003e \u003cp\u003ePreface ix\u003c\/p\u003e \u003cp\u003eAcknowledgements xv\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 1 The language of CSP\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1 Sequential processes 3\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Events and processes 3\u003c\/p\u003e \u003cp\u003e1.2 Performing events 8\u003c\/p\u003e \u003cp\u003e1.3 Recursion 13\u003c\/p\u003e \u003cp\u003e1.4 Choice 20\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2 Concurrency\u003c\/b\u003e\u003cb\u003e 31\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Alphabetized parallel 31\u003c\/p\u003e \u003cp\u003e2.2 Interleaving 44\u003c\/p\u003e \u003cp\u003e2.3 Interface parallel 50\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3 Abstraction and control flow\u003c\/b\u003e\u003cb\u003e 55\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 Hiding 55\u003c\/p\u003e \u003cp\u003e3.2 Event renaming 62\u003c\/p\u003e \u003cp\u003e3.3 Sequential composition 69\u003c\/p\u003e \u003cp\u003e3.4 Interrupt 72\u003c\/p\u003e \u003cp\u003e3.5 Notes 74\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart II Analysing processes\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4 Traces 87\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 Sequences 87\u003c\/p\u003e \u003cp\u003e4.2 Trace semantics 91\u003c\/p\u003e \u003cp\u003e4.3 Recursion 117\u003c\/p\u003e \u003cp\u003e4.4 Testing 133\u003c\/p\u003e \u003cp\u003e4.5 Congruence 136\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5 Specification and verification with traces 141\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Property-oriented Specification 141\u003c\/p\u003e \u003cp\u003e5.2 Verification 143\u003c\/p\u003e \u003cp\u003e5.3 Recursion induction 155\u003c\/p\u003e \u003cp\u003e5.4 Case study: Distributed sum 160\u003c\/p\u003e \u003cp\u003e5.5 Process-oriented specification 168\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6 Stable failures 173\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 Observing processes 174\u003c\/p\u003e \u003cp\u003e6.2 Process semantics 178\u003c\/p\u003e \u003cp\u003e6.3 Recursion 188\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7 Specification and verification with failures 195\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 Property-oriented specification 195\u003c\/p\u003e \u003cp\u003e7.2 Verification 197\u003c\/p\u003e \u003cp\u003e7.3 Recursion induction 206\u003c\/p\u003e \u003cp\u003e7.4 Process-oriented specification 209\u003c\/p\u003e \u003cp\u003e7.5 Case study: Distributed sum 212\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8 Failures, divergences, and infinite traces 221\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 Observing processes 221\u003c\/p\u003e \u003cp\u003e8.2 Process semantics 229\u003c\/p\u003e \u003cp\u003e8.3 Recursion 242\u003c\/p\u003e \u003cp\u003e8.4 Specification and verification 248\u003c\/p\u003e \u003cp\u003e8.5 Recursion induction 253\u003c\/p\u003e \u003cp\u003e8.6 Case study: Distributed sum 256\u003c\/p\u003e \u003cp\u003e8.7 Must testing and FDI equivalence 257\u003c\/p\u003e \u003cp\u003e8.8 Notes 258\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart III Introducing time\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9 The timed language 267\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1 Timed computational model 268\u003c\/p\u003e \u003cp\u003e9.2 Transitions 269\u003c\/p\u003e \u003cp\u003e9.3 Performing events 270\u003c\/p\u003e \u003cp\u003e9.4 Choice 275\u003c\/p\u003e \u003cp\u003e9.5 Recursion 286\u003c\/p\u003e \u003cp\u003e9.6 Concurrency 290\u003c\/p\u003e \u003cp\u003e9.7 Abstraction 297\u003c\/p\u003e \u003cp\u003e9.8 Flow of control 304\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10 Timed transition systems 313\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1 Evolution 313\u003c\/p\u003e \u003cp\u003e10.2 Executions 315\u003c\/p\u003e \u003cp\u003e10.3 Well-timed processes 327\u003c\/p\u003e \u003cp\u003e10.4 Notes 329\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart IV Timed analysis\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e11 Semantics of timed CSP 335\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e11.1 Timed observations 336\u003c\/p\u003e \u003cp\u003e11.2 Timed failures semantics 347\u003c\/p\u003e \u003cp\u003e11.3 Recursion 358\u003c\/p\u003e \u003cp\u003e11.4 Testing and timed failures equivalence 363\u003c\/p\u003e \u003cp\u003e\u003cb\u003e12 Timed specification and verification 369\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e12.1 Specification 369\u003c\/p\u003e \u003cp\u003e12.2 Verification 375\u003c\/p\u003e \u003cp\u003e12.3 Recursion induction 385\u003c\/p\u003e \u003cp\u003e12.4 Ill-timed processes 388\u003c\/p\u003e \u003cp\u003e12.5 Case study: Fischer’s protocol 390\u003c\/p\u003e \u003cp\u003e\u003cb\u003e13 Timewise refinement 399\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e13.1 Trace timewise refinement 400\u003c\/p\u003e \u003cp\u003e13.2 Failures timewise refinement 410\u003c\/p\u003e \u003cp\u003e13.3 Refinement and parallel composition 413\u003c\/p\u003e \u003cp\u003e13.4 Case study: a railway crossing 431\u003c\/p\u003e \u003cp\u003e13.5 FDI timewise refinement 436\u003c\/p\u003e \u003cp\u003e13.6 Testing and timewise refinement 439\u003c\/p\u003e \u003cp\u003e13.7 Notes 442\u003c\/p\u003e \u003cp\u003e\u003cb\u003eAppendix A: Event-based time 447\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eA.1 Standard CSP and took 448\u003c\/p\u003e \u003cp\u003eA.2 Translating from timed CSP 454\u003c\/p\u003e \u003cp\u003eA.3 Notes 465\u003c\/p\u003e \u003cp\u003e\u003cb\u003eAppendix B: Model-checking with FDR 469\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eB.1 Interacting with FDR 470\u003c\/p\u003e \u003cp\u003eB.2 How FDR checks refinement 473\u003c\/p\u003e \u003cp\u003eB.3 Machine readable CSP 478\u003c\/p\u003e \u003cp\u003eReferences 485\u003c\/p\u003e \u003cp\u003eNotation 493\u003c\/p\u003e \u003cp\u003eIndex 498\u003c\/p\u003e \u003cp\u003eIndex of Processes 507\u003c\/p\u003e  \u003cp\u003eSteve Schneider is the author of Concurrent and Real-time Systems: The CSP Approach, published by Wiley.  The CSP approach has been widely used in the specification, analysis and verification of concurrent and real-time systems, and for understanding the particular issues that can arise when concurrency is present. It provides a language which enables specifications and designs to be clearly expressed and understood, together with a supporting theory which allows them to be analysed and shown to be correct. This book supports advanced level courses on concurrency covering timed and untimed CSP. The first half introduces the language of CSP, the primary semantic models (traces, failures, divergences and infinite traces), and their use in the modelling, analysis and verification of concurrent systems. The second half of the book introduces time into the language, brings in the timed semantic model (timed failures) and finally presents the theory of timewise refinement which links the two halves together. Author's Website containing:\u003cbr\u003e * Exercises and solutions\u003cbr\u003e * Instructor's resources\u003cbr\u003e * Example CSP programs to run on FDR and ProBe\u003cbr\u003e * Links to useful sites\u003c\/p\u003e","brand":"Wiley","offers":[{"title":"Default Title","offer_id":47988972093669,"sku":"NP9780471623731","price":86.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9780471623731.jpg?v=1761782264","url":"https:\/\/k12savings.com\/products\/concurrent-and-real-time-systems-isbn-9780471623731","provider":"K12savings","version":"1.0","type":"link"}