# Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem

@article{Vahidipour2017CellularAP, title={Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem}, author={Seyed Mehdi Vahidipour and Mohammad Reza Meybodi and Mehdi Esnaashari}, journal={Discrete Event Dynamic Systems}, year={2017}, volume={27}, pages={609-640} }

In a Petri net, a decision point is raised when two or more transitions are simultaneously enabled in a given marking. The decision to be made at such a point is the selection of an enabled transition for firing. Decision making in Petri nets is accomplished by a so called controlling mechanism. Whenever a Petri net is used to represent an algorithm, the application of a different controlling mechanism results in a different instance of that algorithm. Recently, an adaptive controlling…

## 10 Citations

### GAPN-LA: A framework for solving graph problems using Petri nets and learning automata

- Computer ScienceEng. Appl. Artif. Intell.
- 2019

### Open asynchronous dynamic cellular learning automata and its application to allocation hub location problem

- Computer ScienceKnowl. Based Syst.
- 2018

### Priority assignment in queuing systems with unknown characteristics using learning automata and adaptive stochastic petri nets

- Computer ScienceJ. Comput. Sci.
- 2018

### A Michigan memetic algorithm for solving the vertex coloring problem

- Computer ScienceJ. Comput. Sci.
- 2018

### Cellular Automata, Learning Automata, and Cellular Learning Automata for Optimization

- Computer Science, BiologyIntelligent Systems Reference Library
- 2021

This chapter investigates new learning automata (LA) and cellular learning Automata (CLA) models for solving optimization problems and provides a summary of hybrid LA models for optimization problems from 2015 to 2021.

### Cellular Learning Automata: A Bibliometric Analysis

- Computer Science, Biology
- 2020

This chapter investigates all research results and addresses the potential trends of the critical studies related to cellular learning automaton models as one of the recent reinforcement learning approaches and identifies the top contributing authors, institutes, countries, journals, and key research topics based on the techniques of bibliometric network analysis.

### Cellular Learning Automata for Competitive Loss Sharing

- Computer Science
- 2020

It is demonstrated that using ICLA, finding compatible LSAs do not need detailed information about distributions of the losses and even utility functions of the other service providers, and the proposed approach can improve the utility of service providers and users.

### A new cellular learning automata-based algorithm for community detection in complex social networks

- Computer ScienceJ. Comput. Sci.
- 2018

### Likelihood-Based Adaptive Learning in Stochastic State-Based Models

- Computer ScienceIEEE Signal Processing Letters
- 2019

An innovative likelihood-based adaptive learning approach capable of learning the structural parameters, i.e., the arc weights of SSMs from data and exploiting the reliability of detected inputs is presented in this letter.

## References

SHOWING 1-10 OF 59 REFERENCES

### Learning Automata-Based Adaptive Petri Net and Its Application to Priority Assignment in Queuing Systems With Unknown Parameters

- Computer ScienceIEEE Transactions on Systems, Man, and Cybernetics: Systems
- 2015

In this paper, an adaptive Petri net (PN), capable of adaptation to environmental changes, is introduced by the fusion of learning automata and PN which is a fusion between LA and stochastic PN (SPN).

### A cellular learning automata-based algorithm for solving the vertex coloring problem

- Computer ScienceExpert Syst. Appl.
- 2011

### Extended distributed learning automata

- Computer ScienceApplied Intelligence
- 2014

An iterative randomized heuristic algorithm using sampling is proposed for finding an optimal subgraph in a stochastic edge-weighted graph using an eDLA and it is shown that the proposed method converges to an optimal solution.

### A New Vertex Coloring Algorithm Based on Variable Aaction-Set Learning Automata

- Computer ScienceComput. Informatics
- 2010

This paper proposes a learning automata-based iterative algorithm for approximating a near optimal solution to the vertex coloring problem and compares it with several existing vertex coloring algorithms in terms of the time and the number of colors required for coloring the graphs.

### CLA-DE: a hybrid model based on cellular learning automata for numerical optimization

- Computer ScienceApplied Intelligence
- 2011

A hybrid model based on cellular learning automata and differential evolution algorithm for global numerical optimization that can achieve near optimal solutions in all cases and is highly competitive with the ones from the compared algorithms.

### A hierarchical system of learning automata that can learn die globally optimal path

- Computer ScienceInf. Sci.
- 1987

### On the analysis of Petri nets with static priorities

- BusinessActa Informatica
- 2009

It is shown that positive properties of a net such as liveness and the existence of home states do also hold for the net with static priorities, if a simple condition is imposed on the priority relation.

### On the analysis of Petri nets with static priorities

- BusinessActa Informatica
- 1996

Abstract.Priority specifications offer a convenient description technique to resolve conflicts in favour of particular actions. Apart from being employed for the specification of the functional…

### Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problems

- Computer ScienceInt. J. Uncertain. Fuzziness Knowl. Based Syst.
- 2006

It is shown that the shortest path is found with a probability as close as to unity by proper choice of the parameters of the proposed algorithms.

### Cellular Learning Automata-based Graph Coloring Problem

- Computer Science
- 2009

An irregular cellular learning automata (ICLA) based approximation algorithm is proposed for solving the minimum (vertex) coloring problem and it is shown that by a proper choice of the parameters of the algorithm, the probability of approximating the optimal solution is as close to unity as possible.