Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Theoretical Aspects of Computing

ICTAC 2022: Theoretical Aspects of Computing – ICTAC 2022 pp 42–59Cite as

A PO Characterisation of Reconfiguration

  • Conference paper
  • First Online:

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

Abstract

We consider partial order semantics of concurrent systems in which local reconfigurations may have global side effects. That is, local changes happening to an entity may block or unblock events relating to others, namely, events in which the entity does not participate. We show that partial order computations need to capture additional restrictions about event ordering, i.e., restrictions that arise from such reconfigurations. This introduces ambiguity where different partial orders represent exactly the same events with the same participants happening in different orders, thus defeating the purpose of using partial order semantics. To remove this ambiguity, we suggest an extension of partial orders called glued partial orders. We show that glued partial orders capture all possible forced reordering arising from said reconfigurations. Furthermore, we show that computations belonging to different glued partial orders are only different due to non-determinism. We consider channeled transition systems and Petri-nets with inhibiting arcs as examples.

This work is funded by ERC consolidator grant D-SynMA (No. 772459) and Swedish research council grants: SynTM (No. 2020-03401) and grant (No. 2020-04963).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    CTS can be considered as a generalisation of Zielonka automata, supporting rich interactions alongside change of communication interfaces.

  2. 2.

    Note that reconfiguration is an internal event, and is totally hidden from the perspective of an external observer [20] who may only observe message-/token-passing. Indeed, messages or tokens can only indicate the occurrence of exchange but cannot help with noticing that a reconfiguration has happened and what are the consequences of reconfiguration.

  3. 3.

    A general translation of CTS to PTI-nets is quite involved and loses the distinction between channels and processes.

References

  1. Abadi, M., Blanchet, B., Fournet, C.: The applied pi calculus: mobile values, new names, and secure communication. J. ACM 65(1), 1:1–1:41 (2018). https://doi.org/10.1145/3127586

  2. Abd Alrahman, Y., De Nicola, R., Loreti, M.: A calculus for collective-adaptive systems and its behavioural theory. Inf. Comput. 268 (2019). https://doi.org/10.1016/j.ic.2019.104457

  3. Abd Alrahman, Y., De Nicola, R., Loreti, M.: Programming interactions in collective adaptive systems by relying on attribute-based communication. Sci. Comput. Program. 192, 102428 (2020)

    Article  Google Scholar 

  4. Abd Alrahman, Y., Perelli, G., Piterman, N.: Reconfigurable interaction for MAS modelling. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020, Auckland, New Zealand, 9–13 May 2020, pp. 7–15. International Foundation for Autonomous Agents and Multiagent Systems (2020)

    Google Scholar 

  5. Abd Alrahman, Y., Piterman, N.: Modelling and verification of reconfigurable multi-agent systems. Auton. Agents Multi Agent Syst. 35(2), 47 (2021)

    Article  Google Scholar 

  6. Agerwala, T.: A complete model for representing the coordination of asynchronous processes. Technical Report, Johns Hopkins Univ., Baltimore, Md. (USA) (1974)

    Google Scholar 

  7. Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Meth. Comput. Sci. 7(1) (2011). https://doi.org/10.2168/LMCS-7(1:11)2011

  8. Borgström, J., et al.: Broadcast psi-calculi with an application to wireless protocols. Softw. Syst. Model. 14(1), 201–216 (2015)

    Article  Google Scholar 

  9. Busi, N.: Analysis issues in petri nets with inhibitor arcs. Theor. Comput. Sci. 275(1–2), 127–177 (2002)

    Google Scholar 

  10. Cardelli, L., Gordon, A.D.: Mobile ambients. Electr. Notes Theor. Comput. Sci. 10, 198–201 (1997). https://doi.org/10.1016/S1571-0661(05)80699-1

    Article  MATH  Google Scholar 

  11. Ene, C., Muntean, T.: Expressiveness of point-to-point versus broadcast communications. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 258–268. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48321-7_21

    Chapter  MATH  Google Scholar 

  12. Flynn, M.J., Agerwala, T.: Comments on capabilities, limitations and correctness of petri nets. In: Lipovski, G.J., Szygenda, S.A. (eds.) Proceedings of the 1st Annual Symposium on Computer Architecture, Gainesville, FL, USA, December 1973, pp. 81–86. ACM (1973). https://doi.org/10.1145/800123.803973

  13. Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Optimal Zielonka-type construction of deterministic asynchronous automata. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 52–63. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14162-1_5

    Chapter  MATH  Google Scholar 

  14. Gilbert, D.R., Palamidessi, C.: Concurrent constraint programming with process mobility. In: Computational Logic - CL 2000, First International Conference, London, UK, 24–28 July, 2000, Proceedings, pp. 463–477 (2000). https://doi.org/10.1007/3-540-44957-4_31

  15. Janicki, R., Kleijn, J., Koutny, M., Mikulski, L.: Relational structures for concurrent behaviours. Theor. Comput. Sci. 862, 174–192 (2021)

    Article  MathSciNet  Google Scholar 

  16. Kleijn, H.C.M., Koutny, M.: Process semantics of general inhibitor nets. Inf. Comput. 190(1), 18–69 (2004)

    Article  MathSciNet  Google Scholar 

  17. Krishna, S., Muscholl, A.: A quadratic construction for Zielonka automata with acyclic communication structure. Theor. Comput. Sci. 503, 109–114 (2013)

    Article  MathSciNet  Google Scholar 

  18. Meseguer, J., Montanari, U., Sassone, V.: On the semantics of petri nets. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 286–301. Springer, Heidelberg (1992). https://doi.org/10.1007/BFb0084798

    Chapter  Google Scholar 

  19. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, ii. Inf. Comput. 100(1), 41–77 (1992)

    Article  MathSciNet  Google Scholar 

  20. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55719-9_114

    Chapter  Google Scholar 

  21. Petri, C.A., Reisig, W.: Petri net. Scholarpedia 3(4), 6477 (2008)

    Article  Google Scholar 

  22. Saraswat, V.A., Rinard, M.C.: Concurrent constraint programming. In: Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, USA, January 1990, pp. 232–245 (1990). https://doi.org/10.1145/96709.96733

  23. Vogler, W.: Partial order semantics and read arcs. Theor. Comput. Sci. 286(1), 33–63 (2002)

    Article  MathSciNet  Google Scholar 

  24. Wischik, L., Gardner, P.: Explicit fusions. Theor. Comput. Sci. 340(3), 606–630 (2005)

    Article  MathSciNet  Google Scholar 

  25. Zielonka, W.: Notes on finite asynchronous automata. RAIRO Theor. Informatics Appl. 21(2), 99–135 (1987)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Gothenburg, Gothenburg, Sweden

    Yehia Abd Alrahman, Mauricio Martel & Nir Piterman

Authors
  1. Yehia Abd Alrahman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mauricio Martel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nir Piterman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yehia Abd Alrahman .

Editor information

Editors and Affiliations

  1. TU München, München, Germany

    Helmut Seidl

  2. Southwest University, Chongqing, China

    Zhiming Liu

  3. NASA Ames Research Center, Moffett Field, CA, USA

    Corina S. Pasareanu

Rights and permissions

Reprints and permissions

Copyright information

© 2022 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

Abd Alrahman, Y., Martel, M., Piterman, N. (2022). A PO Characterisation of Reconfiguration. In: Seidl, H., Liu, Z., Pasareanu, C.S. (eds) Theoretical Aspects of Computing – ICTAC 2022. ICTAC 2022. Lecture Notes in Computer Science, vol 13572. Springer, Cham. https://doi.org/10.1007/978-3-031-17715-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-17715-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-17714-9

  • Online ISBN: 978-3-031-17715-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation