Skip to main content
Springer Nature Link
Log in

Adaptive Petri net based on irregular cellular learning automata with an application to vertex coloring problem

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

An adaptive Petri net, called APN-LA, that has been recently introduced, uses a set of learning automata for controlling possible conflicts among the transitions in a Petri net (PN). Each learning automaton (LA) in APN-LA acts independently from the others, but there could be situations, where the operation of a LA affects the operation of another LA by possibly enabling or disabling some of the transitions within the control of that LA. In such situations, it is more appropriate to let the learning automata within the APN-LA, cooperate with each other, instead of operating independently. In this paper, an adaptive Petri net system based on Irregular Cellular Learning Automata (ICLA), in which a number of learning automata cooperate with each other, is proposed. The proposed adaptive system, called APN-ICLA, consists of two layers: PN-layer and an ICLA-layer. The PN-layer is a Petri net, in which conflicting transitions are partitioned into several clusters. There should be a controller in each cluster to control the possible conflicts among the transitions in that cluster. The ICLA-layer in APN-ICLA provides the required controllers for the PN-layer. The ICLA-layer is indeed an ICLA, in which each cell corresponds to a cluster in the PN-layer. The LA resides in a particular cell in the ICLA-layer and acts as the controller of the corresponding cluster in the PN-layer. To evaluate the efficiency of the proposed system, several algorithms, based on the APN-ICLA for vertex coloring problem, are designed. Simulation results justify the effectiveness of the proposed APN-ICLA.

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

Access this article

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Reisig W (2013) Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer Science & Business

  2. Vahidipour SM, Meybodi MR, Esnaashari M (2015) Learning Automata Based Adaptive Petri net and Its Application to Priority Assignment in Queuing Systems with Unknown Parameters. IEEE Trans Syst Man Cybern 45(10):1373–1384

    Article  Google Scholar 

  3. Peterson JL (1981) Petri Net Theory and the Modeling of Systems. Prentice-Hall

  4. Burkhard HD (1981) Ordered firing in Petri nets, EIK Journal of information processing and cybernetics, vol 17

  5. Bause F (1996) On the analysis of Petri net with static priorities. Acta Informatica 33:669–685

    Article  MathSciNet  MATH  Google Scholar 

  6. Bause F (1997) Analysis of Petri nets with a dynamic priority method. Appl Theory Petri Nets:215–234

  7. Holloway LE, Krogh BH (1994) Controlled Petri nets: A tutorial survey. In: The 11 th International Conference on Analysis and Optimization of Systems Discrete Event Systems, Springer Berlin Heidelberg, pp. 158–168

  8. Esnaashari M, Meybodi MR (2015) Irregular Cellular Learning Automata. IEEE Trans Cybernetics 45 (8):1622–1632

    Article  Google Scholar 

  9. Narendra KS, Thathachar MAL (1989) Learning Automata: An Introduction. Prentice Hall

  10. Thathachar MAL, Satstry PS (1997) A Hierarchical System of Learning Automata That Can Learn The Globally Optimal Path. Inf Sci 42(2):743–166

    MathSciNet  Google Scholar 

  11. Beigy H, Meybodi MR (2006) Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problem. Int J Uncertainty Fuzziness Knowledge Based Syst 14(5):591–617

    Article  MathSciNet  MATH  Google Scholar 

  12. Mollakhalili Meybodi MR, Meybodi MR (2014) Extended Distributed Learning Automata: An Automata-based Framework for Solving Stochastic Graph Optimization Problems. Appl Intell 41(3):923–940

    Article  Google Scholar 

  13. Meybodi MR, Beigy H, Taherkhani M (2003) Cellular Learning Automata and its Applications. Sharif J Sci Technol 19(25):54–77

    Google Scholar 

  14. Beigy H, Meybodi MR (2004) A Mathematical Framework for Cellular Learning Automata. J Adv Complex Syst 7(3):295–320

    Article  MathSciNet  MATH  Google Scholar 

  15. Hack M (1975) Petri net languages, C.S.G Memo 124, Project MAC, M.I.T.

  16. Krogh BH, Magott J, Holloway LE (1991) On the complexity of forbidden state problems for controlled marked graphs. In: The 30 th IEEE Conference on Decision and Control

  17. Li Y, Wonham WM (1994) Control of vector discrete-event systems. II. Controller synthesis. IEEE Trans Autom Control 39(3):512–531

    Article  MathSciNet  MATH  Google Scholar 

  18. Murata T (1989) Petri nets: properties, analysis and applications. Proc. IEEE 77:541–580

    Article  Google Scholar 

  19. Torkestani JA, Meybodi MR (2009) Graph Coloring Problem Based on Learning Automata. In: Proceedings of International Conference on Information Management and Engineering (ICIME 2009), Kuala Lumpur, Malaysia, pp. 718–722

  20. Torkestani JA (2013) A new Approch to the vertex coloring Problem. Cybern Syst 44(5):444–466

    Article  MATH  Google Scholar 

  21. Ftp://dimacs.rutgers.edu/pub/challenge/graph/

  22. Zhang J, Wang C, Zhou MC (2014) Last-Position Elimination-Based Learning Automata. IEEE Trans Cybernetics 44(12):2484–2492

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran

    S. Mehdi Vahidipour & Mohammad Reza Meybodi

  2. Information Technology Department, ITRC, Tehran, Iran

    Mehdi Esnaashari

Authors
  1. S. Mehdi Vahidipour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Reza Meybodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mehdi Esnaashari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to S. Mehdi Vahidipour or Mohammad Reza Meybodi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vahidipour, S.M., Meybodi, M.R. & Esnaashari, M. Adaptive Petri net based on irregular cellular learning automata with an application to vertex coloring problem. Appl Intell 46, 272–284 (2017). https://doi.org/10.1007/s10489-016-0831-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-016-0831-x

Keywords

Search

Navigation