Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Process Algebra with TimingAugust 2002
Publisher:
  • Springer-Verlag
  • Berlin, Heidelberg
ISBN:978-3-540-43447-4
Published:01 August 2002
Pages:
300
Skip Bibliometrics Section
Reflects downloads up to 10 Nov 2024Bibliometrics
Skip Abstract Section
Abstract

From the Publisher:

Timing issues are of growing importance for the conceptualization and design of computer-based systems. Timing may simply be essential for the correct behaviour of a system, e.g. of a controller. Even if timing is not essential for the correct behaviour of a system, there may be good reasons to introduce it in such a way that suitable timing becomes relevant for the correct behaviour of a complex system. This book is unique in presenting four algebraic theories about processes, each dealing with timing from a different point of view, in a coherent and systematic way. The timing of actions is either relative or absolute and the underlying time scale is either discrete or continuous. All presented theories are extensions of the algebra of communicating processes. The book is essential reading for researchers and advanced students interested in timing issues in the context of the design and analysis of concurrent and communicating processes.

Cited By

  1. Bergstra J and Middelburg C (2019). Process Algebra with Strategic Interleaving, Theory of Computing Systems, 63:3, (488-505), Online publication date: 1-Apr-2019.
  2. Gómez A, Rodríguez R, Cambronero M and Valero V (2019). Profiling the publish/subscribe paradigm for automated analysis using colored Petri nets, Software and Systems Modeling (SoSyM), 18:5, (2973-3003), Online publication date: 1-Oct-2019.
  3. Aman B and Ciobanu G (2017). Verification of critical systems described in real-time TiMo, International Journal on Software Tools for Technology Transfer (STTT), 19:4, (395-408), Online publication date: 1-Aug-2017.
  4. ACM
    Díaz G, Cambronero M, Maciá H and Valero V Model-checking verification of publish-subscribe architectures in web service contexts Proceedings of the 30th Annual ACM Symposium on Applied Computing, (1688-1695)
  5. ACM
    Furia C, Mandrioli D, Morzenti A and Rossi M (2010). Modeling time in computing, ACM Computing Surveys, 42:2, (1-59), Online publication date: 1-Feb-2010.
  6. ACM
    van Amstel M, van den Brand M and Engelen L An exercise in iterative domain-specific language design Proceedings of the Joint ERCIM Workshop on Software Evolution (EVOL) and International Workshop on Principles of Software Evolution (IWPSE), (48-57)
  7. Gribovskaya N and Virbitskaite I A categorical view of timed weak bisimulation Proceedings of the 7th annual conference on Theory and Applications of Models of Computation, (443-454)
  8. Llana L and Núuñez M (2019). Testing Semantics for RTPA, Fundamenta Informaticae, 90:3, (305-335), Online publication date: 1-Mar-2009.
  9. Llana L and Núuñez M (2019). Testing Semantics for RTPA, Fundamenta Informaticae, 90:3, (305-335), Online publication date: 1-Aug-2009.
  10. Stappers F, Reniers M and Groote J Suitability of mCRL2 for concurrent-system design Proceedings of the 8th international conference on Formal methods for components and objects, (166-185)
  11. Gribovskaya N and Virbitskaite I (2019). Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems, Fundamenta Informaticae, 93:1-3, (127-142), Online publication date: 1-Jan-2009.
  12. Gribovskaya N and Virbitskaite I (2019). Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems, Fundamenta Informaticae, 93:1-3, (127-142), Online publication date: 1-Jan-2009.
  13. Su L, Bowman H, Barnard P and Wyble B (2009). Process algebraic modelling of attentional capture and human electrophysiology in interactive systems, Formal Aspects of Computing, 21:6, Online publication date: 1-Dec-2009.
  14. Fokkink W, Pang J and Wijs A (2019). Is Timed Branching Bisimilarity a Congruence Indeed?, Fundamenta Informaticae, 87:3-4, (287-311), Online publication date: 30-Nov-2008.
  15. Fokkink W, Pang J and Wijs A (2008). Is Timed Branching Bisimilarity a Congruence Indeed?, Fundamenta Informaticae, 87:3-4, (287-311), Online publication date: 1-Aug-2008.
  16. Markovski J and Vink E Extending Timed Process Algebra with Discrete Stochastic Time Proceedings of the 12th international conference on Algebraic Methodology and Software Technology, (268-283)
  17. AlTurki M and Meseguer J (2008). Reduction Semantics and Formal Analysis of Orc Programs, Electronic Notes in Theoretical Computer Science (ENTCS), 200:3, (25-41), Online publication date: 1-May-2008.
  18. Lopez N, Núñez M and Pelayo F A comparative study of STOPA and RTPA Transactions on computational science II, (224-245)
  19. ACM
    AlTurki M and Meseguer J Real-time rewriting semantics of orc Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, (131-142)
  20. Merayo M, Núñez M and Rodrguez I Formal testing of systems presenting soft and hard deadlines Proceedings of the 2007 international conference on Fundamentals of software engineering, (160-174)
  21. Reniers M and Van Weerdenburg M Action abstraction in timed process algebra Proceedings of the 2007 international conference on Fundamentals of software engineering, (287-301)
  22. Man K and Schellekens M Mathematical modelling of digital hardware systems in timed Chi Proceedings of the 26th IASTED International Conference on Modelling, Identification, and Control, (363-368)
  23. Man K (2007). Formal specification and analysis of hardware systems in timed Chi, Nordic Journal of Computing, 14:1, (65-86), Online publication date: 1-Jan-2007.
  24. Aceto L, Ingólfsdóttir A and Mousavi M Impossibility results for the equational theory of timed CCS Proceedings of the 2nd international conference on Algebra and coalgebra in computer science, (80-95)
  25. Aceto L and Ingolfsdottir A The saga of the axiomatization of parallel composition Proceedings of the 18th international conference on Concurrency Theory, (2-16)
  26. Mendler M and Lüttgen G Is observational congruence axiomatisable in equational horn logic? Proceedings of the 18th international conference on Concurrency Theory, (197-211)
  27. Groote J, Reniers M and Usenko Y Time abstraction in timed µCRL à la regions Proceedings of the 20th international conference on Parallel and distributed processing, (180-180)
  28. Lüttgen G and Vogler W (2006). Bisimulation on speed, Theoretical Computer Science, 360:1, (209-227), Online publication date: 21-Aug-2006.
  29. Groote J, Mousavi M and Reniers M (2006). A Hierarchy of SOS Rule Formats, Electronic Notes in Theoretical Computer Science (ENTCS), 156:1, (3-25), Online publication date: 1-May-2006.
  30. Markovski J and de Vink E Embedding real time in stochastic process algebras Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation, (47-62)
  31. ACM
    Wijs A, van de Pol J and Bortnik E Solving scheduling problems by untimed model checking Proceedings of the 10th international workshop on Formal methods for industrial critical systems, (54-61)
  32. Anantharaman S, Chen J and Hains G A Synchronous Process Calculus for Service Costs Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, (435-444)
  33. Baeten J, Mousavi M and Reniers M Timing the untimed Processes, Terms and Cycles, (251-279)
  34. Fokkink W, Pang J and Wijs A Is timed branching bisimilarity an equivalence indeed? Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems, (258-272)
  35. Bergstra J and Middleburg C (2005). Process algebra for hybrid systems, Theoretical Computer Science, 335:2-3, (215-280), Online publication date: 23-May-2005.
  36. Baeten J (2005). A brief history of process algebra, Theoretical Computer Science, 335:2-3, (131-146), Online publication date: 23-May-2005.
  37. Bueno A, Valero V and Cuartero F (2005). A translation of TPALp into a class of timed-probabilistic Petri nets, Theoretical Computer Science, 338:1-3, (350-392), Online publication date: 10-Jun-2005.
  38. Bergstra J and Middelburg C Model theory for process algebra Processes, Terms and Cycles, (445-495)
  39. López N, Núñez M and Rodríguez I Testing of symbolic-probabilistic systems Proceedings of the 4th international conference on Formal Approaches to Software Testing, (49-63)
Contributors
  • Eindhoven University of Technology
  • University of Amsterdam
  • Eindhoven University of Technology

Reviews

Stephen D. Wolthusen

Algebraic approaches to modeling, specifying, and reasoning over programs, particularly concurrent processes, have been the subject of scientific inquiry for more than two decades. Besides communicating sequential processes introduced by Hoare [1] and the calculus of communicating systems introduced by Milner [2], the third major strand of research on algebraic approaches to concurrency is the algebra of communicating processes (ACP) by Bergstra and Klop. While a number of books on process algebra exist, thus far, the concise presentation of process algebra that includes timing issues has been limited to a handbook article [3] by the authors of this book. This makes the volume a welcome addition to researchers interested in algebraic approaches to processes and academics that are preparing advanced courses on the subject. Several variants of process algebra with timing are covered in the book, which is written in a highly structured approach, permitting quick reviews of a specific area of interest, albeit at the price of some redundancy in the presentation. The book starts with a somewhat informal review of ACP without timing that should be augmented by a more precise presentation, such as that seen in Fokkink [4] or Baeten and Weijland [5], for use in class. This chapter is divided into a presentation of basic process algebra and a discussion of the algebra of communicating processes, building on the process algebra of the preceding section. This organization is maintained for other chapters as well. Also recurring throughout the book is a structure that first informally introduces concepts and pragmatics of the theory to be presented, followed by a more formal discussion. Chapters 2 through 5 introduce a number of timed process algebra frameworks, beginning with discrete relative timing models in chapter 2. While the presentation in the chapter itself is at times somewhat informal, soundness and completeness proofs are given in an appendix. The application areas of the extended process algebra are then covered by examples that can be modeled by ACP with discrete relative timing, while a summary section discusses the relationship of the extension to basic ACP. Chapter 3 then proceeds to extend ACP by introducing a model of discrete absolute timing where actions and time are separated, also introducing the concept of discrete initial abstraction for parametric timing. Continuous timing is the subject of chapters 4 and 5; the presentation follows the general outline described above, with chapter 4 discussing continuous relative timing, and chapter 5 covering continuous absolute timing. As with chapter 2, these chapters all include exercises demonstrating the applicability of the extended models. Chapter 6 discusses the concept of abstraction in process algebra for each of the frameworks introduced in chapters 1 through 5. As before, each of the (somewhat brief) frameworks is covered by a discussion of the applicable basic process, as well as a section on the relevant algebra of communicating processes, and includes a brief example of the use of abstraction. Chapter 7 then concludes the body of the book with several additions to the ACP framework with continuous absolute timing and integration. These operators include a state operator to represent the execution of a process in a state, the maximal progress operator to express the execution of actions that are to take place as soon as possible, and a process creation operator that permits the modeling of starting a concurrent process by another process. Appendix A expands the discussion of soundness and completeness in ACP with discrete relative timing covered in chapter 2. Appendix B covers additional background material, including equational logic and structural operational semantics, although the latter is treated rather briefly and should be augmented by additional material such as Aceto et al. [6]. Considerable numbers of exercises throughout the book, as well as meaningful examples, round it out, making it highly suitable for use in advanced classes. Online Computing Reviews Service

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Recommendations