A Locally Sequential Globally Asynchronous Net from Maximality-Based Labelled Transition System

  • Adel BenamiraEmail author
  • Djamel-Eddine Saidouni
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 1)


Given a maximality-based labelled transition system, in this paper we show that such system can be decomposed and considered as distributed components, where each component is a sequential behaviour. In a distributed context, the synchronisation between components is interpreted as an asynchronous interaction. Hence, sequential maximality-based labelled transition systems are represented as locally sequential globally asynchronous nets.


Maximality semantics Bisimulation relation Distributed systems Petri nets LSGA nets 


  1. 1.
    Aceto, L., Hennessy, M.: Adding action refinement to a finite process algebra. In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8–12, 1991, Proceedings, pp. 506–519 (1991)Google Scholar
  2. 2.
    Benamira, A., Saïdouni, D.: Maximality-based labeled transition systems normal form. In: Modeling Approaches and Algorithms for Advanced Computer Applications, Studies in Computational Intelligence, vol. 488, pp. 337–346. Springer (2013)Google Scholar
  3. 3.
    Bouneb, M., Saïdouni, D., Ilié, J.: A reduced maximality labeled transition system generation for recursive petri nets. Formal Asp. Comput. 27(5–6), 951–973 (2015). Google Scholar
  4. 4.
    Courtiat, J.P., Saïdouni, D.E.: Relating maximality-based semantics to action refinement in process algebras. In: FORTE, pp. 293–308 (1994)Google Scholar
  5. 5.
    Glabbeek, R.J.V.: The refinement theorem for ST-bisimulation semantics. In: Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel, April 1990, pp. 27–52. North-Holland (1990)Google Scholar
  6. 6.
    Glabbeek, R.J.V., Goltz, U., Schicke, J.: On synchronous and asynchronous interaction in distributed systems. In: Mathematical Foundations of Computer Science, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, Proceedings. LNCS, vol. 5162, pp. 16–35. Springer (2008)Google Scholar
  7. 7.
    Glabbeek, R.J.V., Goltz, U., Schicke-Uffmann, J.: On characterising distributability. Log. Methods Comput. Sci. 9(3) (2013).
  8. 8.
    Hennessy, M.: Concurrent testing of processes (extended abstract). In: CONCUR ’92, Third International Conference on Concurrency Theory, Stony Brook, NY, USA, August 24-27, 1992, Proceedings, pp. 94–107 (1992).
  9. 9.
    Saïdouni, D.E., Belala, N., Bouneb, M.: Aggregation of transitions in marking graph generation based on maximality semantics for Petri nets. In: VECoS’2008, University of Leeds, UK. eWiC Series, The British Computer Society (BCS) (July, 2–3rd 2008). ISSN: 1477-9358Google Scholar
  10. 10.
    Saïdouni, D.E., Belala, N., Bouneb, M.: Maximality-based structural operational semantics for Petri nets. In: Proceedings of INTELLIGENT SYSTEMS AND AUTOMATION:(CISA’09), Tunisia. vol. 1107, pp. 269–274. American Institute of Physics (2009). ISBN: 978-0-7354-0642-1Google Scholar
  11. 11.
    van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: PARLE, Parallel Architectures and Languages Europe, Volume II: Parallel Languages, Eindhoven, The Netherlands, June 15–19, 1987, Proceedings, pp. 224–242 (1987)Google Scholar
  12. 12.
    Vogler, W.: Bisimulation and action refinement. In: STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14–16, 1991, Proceedings, pp. 309–321 (1991).

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.MISC LaboratoryAbdelhamid Mehri UniversityConstantineAlgeria
  2. 2.Computer Science DepartmentUniversity of 08 May 45GuelmaAlgeria

Personalised recommendations