Abstract
Concurrent and distributed systems are characterized not only by their functional behavior, but also by their quantitative features. A prominent role is played by timing aspects, which express the temporal execution of system activities. There are several different options for introducing time and time passing in system descriptions: durationless actions or durational actions, relative time or absolute time, global clock or local clocks. In this chapter, we present two timed process calculi arising from certain combinations of the options mentioned above, which share a deterministic representation of time and time passing suitable for real-time systems. Then, we show the impact of eager, lazy, and maximal progress interpretations of action execution on the expressiveness of timed descriptions and their bisimulation semantics. This is accomplished through a number of semantics-preserving mappings, which demonstrate how some of the different choices are not irreconcilable by providing a better understanding of benefits and drawbacks of the various time-related options.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
L. Aceto and D. Murphy, Timing and Causality in Process Algebra, Acta Informatica 33:317–350, 1996.
J.C.M. Baeten and J.A. Bergstra, Real Time Process Algebra, Formal Aspects of Computing 3:142–188, 1991.
T. Bolognesi and F. Lucidi, LOTOS-Like Process Algebras with Urgent or Timed Interactions, in Proc. of the 4th Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE 1991), IFIP Trans. C-2:249–264, Sidney (Australia), 1991.
F. Corradini, On Performance Congruences for Process Algebras, Information and Computation 145:191–230, 1998.
F. Corradini, Absolute Versus Relative Time in Process Algebras, Information and Computation 156:122–172, 2000.
F. Corradini and D. Di Cola, The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes, Mathematical Structures in Computer Science 13:619–656, 2003.
F. Corradini and M. Pistore, Specification and Verification of Timed Lazy Systems, in Proc. of the 21st Int. Symp. on Mathematical Foundations of Computer Science (MFCS 1996), Springer, LNCS 1113:279–290, Cracow (Poland), 1996.
F. Corradini and M. Pistore, ‘Closed Interval Process Algebra Versus Interval Process Algebra, Acta Informatica 37:467–509, 2001.
F. Corradini, W. Vogler, and L. Jenner, Comparing the Worst-Case Efficiency of Asynchronous Systems with PAFAS, Acta Informatica 38:735–792, 2002.
R. Gorrieri, M. Roccetti, and E. Stancampiano, A Theory of Processes with Durational Actions, Theoretical Computer Science 140:73–94, 1995.
M. Hennessy and T. Regan, A Process Algebra for Timed Systems, Information and Computation 117:221–239, 1995.
F. Moller and C. Tofts, A Temporal Calculus of Communicating Systems, in Proc. of the 1st Int. Conf. on Concurrency Theory (CONCUR 1990), Springer, LNCS 458:401–415, Amsterdam (The Netherlands), 1990.
F. Moller and C. Tofts, Relating Processes with Respect to Speed, in Proc. of the 2nd Int. Conf. on Concurrency Theory (CONCUR 1991), Springer, LNCS 527:424–438, Amsterdam (The Netherlands), 1991.
X. Nicollin and J. Sifakis, An Overview and Synthesis on Timed Process Algebras, in Proc. of the REX Workshop on Real Time: Theory in Practice, Springer, LNCS 600:526–548, Mook (The Netherlands), 1991.
X. Nicollin and J. Sifakis, The Algebra of Timed Processes ATP: Theory and Application, Information and Computation 114:131–178, 1994.
J. Quemada, D. de Frutos, and A. Azcorra, TIC: A Timed Calculus, Formal Aspects of Computing 5:224–252, 1993.
G.M. Reed and A.W. Roscoe, A Timed Model for Communicating Sequential Processes, Theoretical Computer Science 58:249–261, 1988.
W. Yi, CCS + Time = An Interleaving Model for Real Time Systems, in Proc. of the 18th Int. Coll. on Automata, Languages and Programming (ICALP 1991), Springer, LNCS 510:217–228, Madrid (Spain), 1991.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag London
About this chapter
Cite this chapter
Aldini, A., Corradini, F., Bernardo, M. (2010). Deterministically Timed Process Algebra. In: A Process Algebraic Approach to Software Architecture Design. Springer, London. https://doi.org/10.1007/978-1-84800-223-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-84800-223-4_2
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84800-222-7
Online ISBN: 978-1-84800-223-4
eBook Packages: Computer ScienceComputer Science (R0)