Abstract
The complexity of the software-intensive systems requires working with notions as explicit locations in a distributed system, interaction among the mobile processes restricted by interaction timeouts, time scheduling, and restricted resource access. In order to work these notions, we use a timed and distributed variant of the π-calculus having explicit locations, types for restricting the resource access, and time constraints for interaction in distributed systems. Using observation predicates, several behavioural notions are defined and related: (global) barbed bisimulations, (global) typed barbed bisimulation, timed (global) barbed bisimulations, timed (global) typed barbed bisimulation and full timed global typed barbed bisimulation. These bisimulations form a lattice according to their distinguishing power.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aman, B., Ciobanu, G.: Mobile Ambients with Timers and Types. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 50–63. Springer, Heidelberg (2007)
Ciobanu, G.: Interaction in Time and Space. Electronic Notes in Theoretical Computer Science 203, 5–18 (2008)
Ciobanu, G., Prisacariu, C.: Timers for Distributed Systems. Electronic Notes in Theoretical Computer Science 164, 81–99 (2006)
Ciobanu, G., Prisacariu, C.: Barbed Bisimulations for Timed Distributed π-Calculus. In: 2nd Int’l Conference on Intelligent Computer Communication and Processing, Cluj-Napoca, pages 6 (2006)
Felleisen, M., Wright, A.K.: A Syntactic Approach to Type Soundness. Information and Computation 115, 38–94 (1994)
Hennessy, M., Regan, T.: A Process Algebra For Timed Systems. Information and Computation 117, 221–239 (1995)
Hennessy, M., Riely, J.: Resource Access Control in Systems of Mobile Agents. Information and Computation 173, 82–120 (2002)
Milner, R.: Communicating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge (1999)
Milner, R., Sangiorgi, D.: Barbed Bisimulation. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)
Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD Thesis, University of Edinburgh (1992)
van Glabbeek, R.J.: The Linear Time - Branching Time Spectrum. Handbook of Process Algebra, pp. 3–99 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ciobanu, G. (2008). Behaviour Equivalences in Timed Distributed π-Calculus. In: Wirsing, M., Banâtre, JP., Hölzl, M., Rauschmayer, A. (eds) Software-Intensive Systems and New Computing Paradigms. Lecture Notes in Computer Science, vol 5380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89437-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-89437-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89436-0
Online ISBN: 978-3-540-89437-7
eBook Packages: Computer ScienceComputer Science (R0)