Open Access Open Access  Restricted Access Subscription Access

Concurrency in Intuitionistic Linear-Time μ-Calculus: A Case study of Manufacturing System


Affiliations
1 Department of Computer Science, GC University, Lahore – 54000, Pakistan
 

Background: The design of concurrent systems has become more and more articulated during the last three decades, thus forcing radical modifications on the overall methodological approach. In concurrent systems multiple tasks are being performed in parallel, giving rise to nondeterminism in these situations. The goal of this work is to introduce a common formalized framework to improve the shortcomings of existing models of concurrency, most of which use an oversimplified model of time. Methods: In this paper we will model a manufacturing system having concurrent machines by Colored Petri Nets (CPN) technique. For verification of such systems, intuitionistic linear-time μ-calculus (IμTL) will be applied, which is based on Heyting algebra. IμTL is the extension of linear-time μ-calculus. Reasoning about composition in general, but especially concurrent composition, remains one of the greatest challenge. Findings: The IμTL rules will be used for verifying soundness and composition of safety properties, which are more general than previously discussed rules by using Linear-Time Temporal Logic (LTL). These results will also show the verification of concurrent systems using IμTL. Application: This research will provide new direction for modeling and verification of concurrent system.

Keywords

Compositional Reasoning, Concurrent System, CPN, IμTL
User

Abstract Views: 141

PDF Views: 0




  • Concurrency in Intuitionistic Linear-Time μ-Calculus: A Case study of Manufacturing System

Abstract Views: 141  |  PDF Views: 0

Authors

Ilyas Fakhir
Department of Computer Science, GC University, Lahore – 54000, Pakistan
Syed Asad Raza Kazmi
Department of Computer Science, GC University, Lahore – 54000, Pakistan
Awais Qasim
Department of Computer Science, GC University, Lahore – 54000, Pakistan
Imran Rafique
Department of Computer Science, GC University, Lahore – 54000, Pakistan

Abstract


Background: The design of concurrent systems has become more and more articulated during the last three decades, thus forcing radical modifications on the overall methodological approach. In concurrent systems multiple tasks are being performed in parallel, giving rise to nondeterminism in these situations. The goal of this work is to introduce a common formalized framework to improve the shortcomings of existing models of concurrency, most of which use an oversimplified model of time. Methods: In this paper we will model a manufacturing system having concurrent machines by Colored Petri Nets (CPN) technique. For verification of such systems, intuitionistic linear-time μ-calculus (IμTL) will be applied, which is based on Heyting algebra. IμTL is the extension of linear-time μ-calculus. Reasoning about composition in general, but especially concurrent composition, remains one of the greatest challenge. Findings: The IμTL rules will be used for verifying soundness and composition of safety properties, which are more general than previously discussed rules by using Linear-Time Temporal Logic (LTL). These results will also show the verification of concurrent systems using IμTL. Application: This research will provide new direction for modeling and verification of concurrent system.

Keywords


Compositional Reasoning, Concurrent System, CPN, IμTL



DOI: https://doi.org/10.17485/ijst%2F2016%2Fv9i6%2F130768