Modeling and Formal Analysis of Real–Time System via CCS

Availability and reliability are of utmost important elements for real time systems. Availability means feasibility and compatibility of a system while reliability maintains a robust performing of a system. Most researches that related to real-time analysis have focused on the correctness but ignored the issue of compatibility, especially for substitutability of the involving tasks. Compatibility of tasks in real time system indicates the fitness of tasks that interact with each other, and substitutability is closely related to the fault tolerance mechanism of a system. In practice, one always applies backup tasks or ignored subtle fault of a task, to maintain a robust and continuation performing of a system. However, the replacement of a task or the ignored fault should not effect the main function. Thus, this would be important for us to analyze the substitutability. In this paper, we designed an Interrupt Driven Task Scheduler, which is formally modeled by a process algebra called CCS in 4 components, and analysis its correctness with the help of model checking. For more important, we described single tasks in CCS and analysis its compatibility in weak and strong levels and proposed algorithm for task compatibility checking. We then used the definition of compatibility to analysis substitutability of tasks with the help of observational equivalence of CCS.

[1]  Luigi Lavazza,et al.  Combining UML and formal notations for modelling real-time systems , 2001, ESEC/FSE-9.

[2]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[3]  I.-L. Yen Multiple invariant system design for fault-tolerant real-time applications , 1996, Proceedings of WORDS'96. The Second Workshop on Object-Oriented Real-Time Dependable Systems.

[4]  Bard Bloom,et al.  Structured operational semantics as a specification language , 1995, POPL '95.

[5]  Rance Cleaveland,et al.  The Concurrency Factory Software Development Environment , 1996, TACAS.

[6]  Matthias Tichy,et al.  Building reliable systems based on self-organizing multi-agent systems , 2006, SELMAS '06.

[7]  Louise E. Moser,et al.  A graphical environment for the design of concurrent real-time systems , 1997, TSEM.

[8]  R. K. Shyamasundar,et al.  Static Analysis of Real-Time Distributed Systems , 1988, IEEE Trans. Software Eng..

[9]  R. Alur,et al.  Modelchecking for real-time systems , 1990 .

[10]  Priya Narasimhan,et al.  Object-oriented programming of complex fault-tolerant real-time systems , 1996, Proceedings of WORDS'96. The Second Workshop on Object-Oriented Real-Time Dependable Systems.

[11]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[12]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[13]  Jaeil Park,et al.  Timed-MPSG: A Formal Model for Real-Time Shop Floor Controller , 2006, 2006 International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06).

[14]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[15]  Jaana Eloranta,et al.  Minimizing the number of transitions with respect to observation equivalence , 1991, BIT.

[16]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[17]  Dominique Cansell,et al.  Modelling and Proof Analysis of Interrupt Driven Scheduling , 2007, B.

[18]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.