Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Replications in Reversible Concurrent Calculi

  • Conference paper
  • First Online:
Reversible Computation (RC 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13960))

Included in the following conference series:

Abstract

Process calculi such as CCSor the \(\pi \)-calculus provide specification languages for the study and correctness of communication protocols. They also served in detailing subtle differences between formalisms to represent infinite behaviors, notably in expressiveness [7, 16]. To our knowledge, such results were never investigated from a reversible perspective. One question we would like to answer is how recursion, replication and iteration compare in the reversible setting. Of course, comparing them requires to define them first, and this short note highlights some of the difficulties in defining replication for reversible concurrent calculi.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This version of SP is a slight generalization, as motivated in our related work [2].

  2. 2.

    This discussion was greatly improved thanks to a reviewer’s comment.

References

  1. Aubert, C.: Concurrencies in reversible concurrent calculi. In: Mezzina, C.A., Podlaski, K. (eds.) RC 2022. LNCS, vol. 13354, pp. 146–163. Springer (2022). https://doi.org/10.1007/978-3-031-09005-9_10

  2. Aubert, C.: The correctness of concurrencies in (Reversible) concurrent calculi (Jan 2023). https://hal.science/hal-03950347, under revision for JLAMP

  3. Aubert, C., Browning, P.: Implementation of reversible distributed calculus. In: Kutrib, M., Meyer, U. (eds.) RC 2023. LNCS, Springer (2023). https://hal.science/hal-04035458v1, to appear

  4. Aubert, C., Browning, P.: IRDC-CCSK (5 2023). https://github.com/CinRC/IRDC-CCSK

  5. Aubert, C., Cristescu, I.: Structural equivalences for reversible calculi of communicating systems (2020). https://hal.science/hal-02571597, research report

  6. Aubert, C., Medić, D.: Enabling replications and contexts in reversible concurrent calculus (May 2021). https://hal.science/hal-03183053, research report

  7. Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. MSCS 19(6), 1191–1222 (2009). https://doi.org/10.1017/S096012950999017X

    Article  MathSciNet  MATH  Google Scholar 

  8. Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28644-8_19

    Chapter  Google Scholar 

  9. Degano, P., Gadducci, F., Priami, C.: Causality and replication in concurrent processes. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol. 2890, pp. 307–318. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-39866-0_30

    Chapter  Google Scholar 

  10. Degano, P., Priami, C.: Proved trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 629–640. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55719-9_110

    Chapter  Google Scholar 

  11. Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theor. Comput. Sci. 216(1–2), 237–270 (1999). https://doi.org/10.1016/S0304-3975(99)80003-6

    Article  MathSciNet  MATH  Google Scholar 

  12. Ghyselen, A.: Sized types methods and their applications to complexity analysis in Pi-calculus. Ph.D. thesis, University of Lyon (2021). https://tel.archives-ouvertes.fr/tel-03405961

  13. Lanese, I., Phillips, I.: Forward-reverse observational equivalences in CCSK. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 126–143. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79837-6_8

    Chapter  Google Scholar 

  14. Lanese, I., Phillips, I., Ulidowski, I.: An axiomatic approach to reversible computation. In: FoSSaCS 2020. LNCS, vol. 12077, pp. 442–461. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-45231-5_23

    Chapter  MATH  Google Scholar 

  15. Milner, R.: Functions as processes. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 167–180. Springer, Heidelberg (1990). https://doi.org/10.1007/BFb0032030

    Chapter  Google Scholar 

  16. Palamidessi, C., Valencia, F.D.: Recursion vs replication in process calculi: expressiveness. Bull. EATCS 87, 105–125 (2005). http://eatcs.org/images/bulletin/beatcs87.pdf

  17. Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1–2), 70–96 (2007). https://doi.org/10.1016/j.jlap.2006.11.002

    Article  MathSciNet  MATH  Google Scholar 

  18. Sangiorgi, D., Walker, D.: The Pi-calculus. CUP (2001)

    Google Scholar 

Download references

Acknowledgments

I am very grateful to the reviewers, Alexis Ghyselen, Ivan Lanese and Gianluigi Zavattaro for their observations and suggestions. This material is based upon work supported by the National Science Foundation under Grant No. 2242786 (SHF:Small:Concurrency In Reversible Computations).

Author information

Authors and Affiliations

  1. School of Computer and Cyber Sciences, Augusta University, Augusta, USA

    Clément Aubert

Authors
  1. Clément Aubert
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Clément Aubert .

Editor information

Editors and Affiliations

  1. Universität Giessen, Giessen, Germany

    Martin Kutrib

  2. Technische Hochschule Mittelhessen, Giessen, Germany

    Uwe Meyer

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aubert, C. (2023). Replications in Reversible Concurrent Calculi. In: Kutrib, M., Meyer, U. (eds) Reversible Computation. RC 2023. Lecture Notes in Computer Science, vol 13960. Springer, Cham. https://doi.org/10.1007/978-3-031-38100-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-38100-3_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-38099-0

  • Online ISBN: 978-3-031-38100-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation