Concurrent and Real-time Systems: The CSP Approach

From the Publisher: 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. 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. Containing the following: -Exercises and solutions -Instructors resources - Example CSP programs to run on FDR and ProBe -Links to useful sites 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.

[1]  Bill Roscoe,et al.  An Operational Semantics for CSP , 1986 .

[2]  Juan Quemada,et al.  Introduction of Quantitative Relative Time into LOTOS , 1987, PSTV.

[3]  Andy Boucher,et al.  A Timed Failures Model for Extended Communicating Processes , 1987, ICALP.

[4]  Joëel Ouaknine A framework for model-checking timed CSP , 1999 .

[5]  Tommaso Bolognesi,et al.  A timed Full LOTOS with time/action tree semantics , 1994 .

[6]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[7]  Jan A. Bergstra,et al.  Discrete Time Process Algebra , 1992, CONCUR.

[8]  Jim Davies,et al.  Broadcast Communication for Real-time Processes , 1992, FTRTFT.

[9]  Matthew Hennessy,et al.  A Process Algebra for Timed Systems , 1995, Inf. Comput..

[10]  Wilson A. Sutherland,et al.  Introduction to Metric and Topological Spaces , 1975 .

[11]  Yi Wang A calculus of real time systems , 1991 .

[12]  Andrew William Roscoe A mathematical theory of communicating processes , 1982 .

[13]  Nancy A. Lynch,et al.  Forward and backward simulations, part II: timing-based systems , 1993 .

[14]  Ron Koymans,et al.  Specifying Message Passing and Time-Critical Systems with Temporal Logic , 1992, Lecture Notes in Computer Science.

[15]  A. W. Roscoe,et al.  Unbounded Nondeterminism in CSP , 1989, Mathematical Foundations of Programming Semantics.

[16]  J. C. M. Baeten,et al.  Process Algebra: Bibliography , 1990 .

[17]  Insup Lee,et al.  A Complete Axiomatization of Real-Time Processes , 1988 .

[18]  Hubert Garavel An Overview of the Eucalyptus Toolbox , 1996 .

[19]  Jim Davies,et al.  Towards a denotational semantics for ET-LOTOS , 1995, CONCUR.

[20]  G. M. Reed A uniform mathematical theory for real-time distributed computingT , 1988 .

[21]  Rance Cleaveland,et al.  A theory of testing for real-time , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[22]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[23]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[24]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[25]  Jim Davies,et al.  Real-time CSP , 1994 .

[26]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[27]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[28]  Faron Mollerz,et al.  The Mobility Workbench | a Tool for the -calculus | , 1994 .

[29]  Rom Langerak A Testing Theory for LOTOS using Deadlock Detection , 1989, PSTV.

[30]  Jonathan S. Ostroff,et al.  Temporal logic for real-time systems , 1989 .

[31]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[32]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[33]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[34]  Liang Chen,et al.  Timed processes : models, axioms and decidability , 1993 .

[35]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..

[36]  Grzegorz Rozenberg,et al.  Real-Time: Theory in Practice , 1991, Lecture Notes in Computer Science.

[37]  David Mark Jackson Logical verification of reactive software systems , 1992 .

[38]  Jan Friso Groote,et al.  Algebraic verification of a distributed summation algorithm , 1996 .

[39]  Alain Kerbrat,et al.  CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.

[40]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[41]  Janusz Zalewski,et al.  Specification and proof in real-time CSP , 1996 .

[42]  Steven A. Schneider,et al.  Correctness and communication in real-time systems (tcsp) , 1989 .

[43]  Stephen Blamey,et al.  The soundness and completeness of axioms for CSP processes , 1991 .

[44]  Albert John Camilleri Mechanizing CSP Trace Theory in Higher Order Logic , 1990, IEEE Trans. Software Eng..

[45]  Steve A. Schneider Timewise Refinement for Communicating Processes , 1993, MFPS.

[46]  Guy Leduc,et al.  An Introduction to ET-LOTOS for the Description of Time-Sensitive Systems , 1997, Comput. Networks ISDN Syst..

[47]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[48]  A. W. Roscoe,et al.  Analysing TMFS: a Study of Nondeterminism in Real-Time Concurrency , 1991, Concurrency: Theory, Language, And Architecture.

[49]  Andrew William Roscoe,et al.  Model-checking CSP , 1994 .

[50]  F. Vaandrager,et al.  A Comparison of Additivity Axioms in Timed Transition Systems. , 1993 .

[51]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

[52]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[53]  I. G. BONNER CLAPPISON Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[54]  A. W. Roscoe,et al.  Metric Spaces as Models for Real-Time Concurrency , 1987, MFPS.

[55]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[56]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[57]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[58]  Michael Goldsmith,et al.  Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock , 1995, TACAS.

[59]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..

[60]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[61]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[62]  Antti Valmari,et al.  The Weakest Deadlock-Preserving Congruence , 1995, Inf. Process. Lett..

[63]  Frits Vaandrager Verification of a Distributed Summation Algorithm , 1995, CONCUR.

[64]  Steve A. Schneider,et al.  Using a PVS Embedding of CSP to Verify Authentication Protocols , 1997, TPHOLs.

[65]  Gavin Lowe,et al.  Probabilities and priorities in timed CSP , 1993 .

[66]  K. V. S. Prasad A Calculus of Broadcasting Systems , 1991, Sci. Comput. Program..

[67]  Steve A. Schneider,et al.  An Operational Semantics for Timed CSP , 1995, Inf. Comput..

[68]  Jim Davies,et al.  Factorizing Proofs in Timed CSP , 1990, Mathematical Foundations of Programming Semantics.

[69]  Wang Yi,et al.  CCS + Time = An Interleaving Model for Real Time Systems , 1991, ICALP.

[70]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[71]  Burkhart Wolff,et al.  A Corrected Failure Divergence Model for CSP in Isabelle/HOL , 1997, FME.

[72]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[73]  David Gray Introduction to the formal design of real-time systems , 1999, Applied computing.

[74]  A. W. Roscoe,et al.  Fixed Points Without Completeness , 1995, Theor. Comput. Sci..

[75]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[76]  Iain Phillips,et al.  Refusal Testing , 1986, Theoretical Computer Science.

[77]  Nancy G. Leveson,et al.  Safety Analysis Using Petri Nets , 1987, IEEE Transactions on Software Engineering.

[78]  Clive Fencott Formal methods for concurrency , 1995 .

[79]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.