Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Modelling and Implementation of Complex Systems

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 1))

  • 621 Accesses

Abstract

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.

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

Access this chapter

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

    Which compatible to the ST-idea, indeed the validation of a distributed implementation is based on the ST-bisimulation.

  2. 2.

    \(2^{\mathcal {M}}\) denotes the part sets of \(\mathcal {M}\).

  3. 3.

    Which equivalent to the notion of a sequential component of distributed system.

  4. 4.

    From the fact that every LSGA net is a structural conflict net.

  5. 5.

    From the fact that for each \(\mathcal {C}_1,\mathcal {C}_2 \in \mathbb {C}_\mathcal {M}\) and for each event x of \(\mathcal {C}_1\) and event y in \(\mathcal {C}_2\) such that \( x,y \not \in \mathbb {S}_\mathcal {M} \):\( x\Vert y\).

References

  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. 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. 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). http://dx.doi.org/10.1007/s00165-015-0341-3

    Google Scholar 

  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. 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. 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. Glabbeek, R.J.V., Goltz, U., Schicke-Uffmann, J.: On characterising distributability. Log. Methods Comput. Sci. 9(3) (2013). http://dx.doi.org/10.2168/LMCS-9(3:17)2013

  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). http://dx.doi.org/10.1007/BFb0084785

  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-9358

    Google Scholar 

  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-1

    Google Scholar 

  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. 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). http://dx.doi.org/10.1007/BFb0020808

Download references

Author information

Authors and Affiliations

  1. MISC Laboratory, Abdelhamid Mehri University, 25000, Constantine, Algeria

    Adel Benamira & Djamel-Eddine Saidouni

  2. Computer Science Department, University of 08 May 45, 24000, Guelma, Algeria

    Adel Benamira

Authors
  1. Adel Benamira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Djamel-Eddine Saidouni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adel Benamira .

Editor information

Editors and Affiliations

  1. Faculty of New Informationand Commu Tech, University of Constantine2, Constantine, Algeria

    Salim Chikhi

  2. Fac ofTechn, GeCoDe Laboratory, University of Saida, Saida, Algeria

    Abdelmalek Amine

  3. Faculty of New Info& Commun Tech, University of Constantine2, Constantine, Algeria

    Allaoua Chaoui

  4. Faculty of Sci & Tech,Dept of maths & CS, University of El Oued, El-Oued,, Algeria

    Mohamed Khireddine Kholladi

  5. Faculty of New Informationand Com Tech, University of Constantine2, Constantine, Algeria

    Djamel Eddine Saidouni

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Benamira, A., Saidouni, DE. (2016). A Locally Sequential Globally Asynchronous Net from Maximality-Based Labelled Transition System. In: Chikhi, S., Amine, A., Chaoui, A., Kholladi, M., Saidouni, D. (eds) Modelling and Implementation of Complex Systems. Lecture Notes in Networks and Systems, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-319-33410-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33410-3_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33409-7

  • Online ISBN: 978-3-319-33410-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation