Informatics Publishing Limited

Awais Qasim ¹, Syed Asad Raza Kazmi ¹, Ilyas Fakhir ¹

Affiliations
1 Department of Computer Science, Government College University, Lahore - 5400, PK

Abstract

Background: Software agents are expected to work autonomously and deal with unfamiliar situations astutely. Achieving cent percent test case coverage for these agents has always been a problem due to limited resources. Also a high degree of dependability is expected from autonomous software agents. Formal verification of these systems can be done by specifying the possible actions of the agents to increase the confidence in the correctness of such systems. Methods: We have used social approach of agent communication where actions of the agents are described as social obligation between the participants. Formal specification of e-agents was done using μ-calculus as it is more expressive than Linear Temporal Logic (LTL). An algorithm has been given for syntactic conversion of μ-calculus formulas to TAPA model checker environment. Results: Using converstion algorithm syntactically modified μ-calculus formulas will be executed on TAPA model checker to verify the system being modelled for the specified properties. Application: The study will help to provide future directions for formal modelling of e-agents for their correct functioning.

Keywords

Agent Communication, Model Checking, μ-Calculus, μ TAPA Model Checker

Full Text

   

Ilyas Fakhir ¹, Syed Asad Raza Kazmi ¹, Awais Qasim ¹, Imran Rafique ¹

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

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

Full Text

   

Imran Rafique ¹, Hina Gul ², Salman Rafique ³, Syed Asad Raza Kazmi ¹, Awais Qasim ¹, Ilyas Fakhir ¹

Affiliations
1 Department of Computer Science, GC University, Lahore – 54000, PK
2 Department of Computer Science, Kinnaird College for Women, Lahore– 54000, PK
3 Department of Computer of Science and Engineering, University of Engineering and Technology, Lahore − 54890, PK

Abstract

Objectives: Recent technical advances have fueled the popularity of mobile grid computing. Mobile devices such as cellular phones and PDAs are becoming more common due to the diminution in their size and increase of computational power. In addition, wireless networks are also beginning to fill the environment. With these advances, mobile devices are becoming available to act as service providers in Grid. But the mobile environment presents a number of challenges. Analysis: The range of mobile execution platforms now available which introduces the problem of heterogeneity. Heavy weight checkpoints also provide hindrance to achieve this integration. At present, Grid Computing standards, neither state any load sharing architecture and model that integrates mobile devices in Grid computing nor does it provide any policy that hides heterogeneity and overcome memory limitations of mobile devices thus it is still an open research problem. Findings: Mobile Grid computing solutions must be developed that are lightweight, independent of specific platform and a load sharing model for mobile grid computing that distributes computational tasks on heterogeneous mobile devices. Our simulation results show the effectiveness of data optimization techniques for mobile devices, interoperability and proxy performance in heterogeneous mobile environment. Novelty: We propose a novel layered architecture that adjusts the data size of checkpoints at the minimum possible level and a load sharing Mobile Proxy algorithm.

Keywords

Broker, Checkpointing, Control Flow Graph, Data Liveliness, Heterogeneity, Interoperability, Proxy, Web Service

Full Text