A New Heuristic for Deadlock Detection in Safety Analysis of Software Systems

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Pira E.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR Year:2022 | Volume:20 | Issue:1 Page(s): 73-79

Download Full-Text

Persian Verion

View:

243

Download:

Cites:

Information Journal Paper

Title

A New Heuristic for Deadlock Detection in Safety Analysis of Software Systems

Author(s)

Pira E. | Issue Writer Certificate

Keywords

Safety analysis

model checking

deadlock

heuristic

evolutionary algorithms

Abstract

The Safety analysis of software systems, especially safety-critical ones, should be performed exactly because even a minor failure in these systems may result in disaster consequences. Also, such analysis must be done before implementation, i. e. the design step and in the model level. model checking is an exact and mathematical-based way that gets a model of a system and analyzes it through exploring all reachable states of the model. Due to the complexity of some systems and their models, this way may face the state space explosion problem, i. e. it cannot explore all available states. A solution to solve this problem in these systems is that model checking tries to refute them, instead of verifying them, by finding errors such as deadlock (if available). Although, a heuristic has been previously proposed to find a deadlock in the model's state space and it has been applied in several simple heuristic search and evolutionary algorithms, its detection speed has been low. In this paper, we propose a novel heuristic to detect a deadlock in the model's state space, and test and compare its detection speed by applying it in several simple heuristic search algorithms such as iterative deepening A*, beam search, and evolutionary algorithms such as genetic, particle swarm optimization, and Bayesian optimization. Comparison results confirm that the new heuristic can detect a deadlock in less time than the previous heuristic.

Cites

No record.

References

No record.

Cite

APA: Copy

Pira, E.. (2022). A New Heuristic for Deadlock Detection in Safety Analysis of Software Systems. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 20(1 ), 73-79. SID. https://sid.ir/paper/964214/en

Vancouver: Copy

Pira E.. A New Heuristic for Deadlock Detection in Safety Analysis of Software Systems. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2022;20(1 ):73-79. Available from: https://sid.ir/paper/964214/en

IEEE: Copy

E. Pira, “A New Heuristic for Deadlock Detection in Safety Analysis of Software Systems,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 20, no. 1 , pp. 73–79, 2022, [Online]. Available: https://sid.ir/paper/964214/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops