Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Formal Methods for Open Object-Based Distributed Systems

International Conference on Formal Techniques for Distributed Systems

FMOODS 2012, FORTE 2012: Formal Techniques for Distributed Systems pp 52–66Cite as

  1. Home
  2. Formal Techniques for Distributed Systems
  3. Conference paper
Behavioural Equivalences over Migrating Processes with Timers

Behavioural Equivalences over Migrating Processes with Timers

  • Bogdan Aman18,
  • Gabriel Ciobanu18 &
  • Maciej Koutny19 
  • Conference paper
  • 637 Accesses

  • 6 Citations

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 7273)

Abstract

The temporal evolution of mobile processes is governed by independently operating local clocks and their migration timeouts. We define a formalism modelling such distributed systems allowing (maximal) parallel execution at each location. Taking into account explicit timing constraints based on migration and interprocess communication, we introduce and study a number of timed behavioural equivalences, aiming to provide theoretical underpinnings of verification methods. We also investigate relationships between such behavioural equivalences.

Keywords

  • mobility
  • timer
  • process algebra
  • bisimulation
  • behaviour
  • equivalence

Download conference paper PDF

References

  1. Aman, B., Ciobanu, G.: Timed Mobile Ambients for Network Protocols. In: Suzuki, K., Higashino, T., Yasumoto, K., El-Fakih, K. (eds.) FORTE 2008. LNCS, vol. 5048, pp. 234–250. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  2. Baeten, J.C.M., Bergstra, J.A.: Discrete time process algebra: Absolute time, relative time and parametric time. Fundam. Inform. 29(1-2), 51–76 (1997)

    MathSciNet  Google Scholar 

  3. Berger, M.: Towards Abstractions for Distributed Systems. Ph.D. thesis, Department of Computing, Imperial College (2002)

    Google Scholar 

  4. Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can’t be traced. In: POPL, pp. 229–239 (1988)

    Google Scholar 

  5. Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)

    CrossRef  Google Scholar 

  6. Chen, L.: Timed Processes: Models, Axioms and Decidability. Ph.D. thesis, School of Informatics, University of Edinburgh (1993)

    Google Scholar 

  7. Ciobanu, G.: Behaviour Equivalences in Timed Distributed π-Calculus. In: Wirsing, M., Banâtre, J.-P., Hölzl, M., Rauschmayer, A. (eds.) Soft-Ware Intensive Systems. LNCS, vol. 5380, pp. 190–208. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  8. Ciobanu, G., Juravle, C.: Flexible software architecture and language for mobile agents. Concurrency and Computation: Practice and Experience 24(6), 559–571 (2012)

    CrossRef  Google Scholar 

  9. Ciobanu, G., Koutny, M.: Modelling and Verification of Timed Interaction and Migration. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 215–229. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  10. Ciobanu, G., Koutny, M.: Timed Migration and Interaction with Access Permissions. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 293–307. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  11. Ciobanu, G., Koutny, M.: Timed mobility in process algebra and petri nets. J. Log. Algebr. Program. 80(7), 377–391 (2011)

    CrossRef  MATH  Google Scholar 

  12. Ciobanu, G., Prisacariu, C.: Timers for distributed systems. Electr. Notes Theor. Comput. Sci. 164(3), 81–99 (2006)

    CrossRef  Google Scholar 

  13. Groote, J.F.: Transition system specifications with negative premises. Theoretical Computer Science 118, 263–299 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Hennessy, M.: A distributed π-calculus. Cambridge University Press (2007)

    Google Scholar 

  15. Hennessy, M., Regan, T.: A process algebra for timed systems. Inf. Comput. 117(2), 221–239 (1995)

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. Milner, R.: Communicating and mobile systems - the π-calculus. Cambridge University Press (1999)

    Google Scholar 

  17. Nicollin, X., Sifakis, J.: The algebra of timed processes, atp: Theory and application. Inf. Comput. 114(1), 131–178 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. Posse, E., Dingel, J.: Theory and Implementation of a Real-Time Extension to the π-Calculus. In: Hatcliff, J., Zucca, E. (eds.) FMOODS/FORTE 2010. LNCS, vol. 6117, pp. 125–139. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  19. Sangiorgi, D.: A theory of bisimulation for the π-calculus. Acta Inf. 33(1), 69–97 (1996)

    CrossRef  MathSciNet  Google Scholar 

  20. Sangiorgi, D., Walker, D.: The π-Calculus - a theory of mobile processes. Cambridge University Press (2001)

    Google Scholar 

  21. Yi, W.: A Calculus of Real-Time Systems. Ph.D. thesis, Department of Computer Science, Chalmers University of Technology (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Romanian Academy, Institute of Computer Science and “A.I.Cuza” University, 700506, Iaşi, Romania

    Bogdan Aman & Gabriel Ciobanu

  2. School of Computing Science, Newcastle University, Newcastle upon Tyne, NE1 7RU, United Kingdom

    Maciej Koutny

Authors
  1. Bogdan Aman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriel Ciobanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hasso Plattner Institute at the University of Potsdam, Prof.-Dr.-Helmert-Straße 2-3, 14482, Potsdam, Germany

    Holger Giese

  2. Department of Computer Science, University of Illinois at Urbana-Champaign, 201 N. Goodwin, 61801, Urbana, IL, USA

    Grigore Rosu

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Aman, B., Ciobanu, G., Koutny, M. (2012). Behavioural Equivalences over Migrating Processes with Timers. In: Giese, H., Rosu, G. (eds) Formal Techniques for Distributed Systems. FMOODS FORTE 2012 2012. Lecture Notes in Computer Science, vol 7273. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30793-5_4

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-30793-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30792-8

  • Online ISBN: 978-3-642-30793-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature