Process algebraic approach to the parametric analysis of object scheduling in real-time systems

Abstract

Describes an approach to the specification and analysis of scheduling problems of real-time systems. The method is based on ACSR-VP (Algebra of Communicating Shared Resources with Value Passing), which is an extension of ACSR, a real-time process algebra, with value-passing capabilities and parameterized processes. A scheduling problem is described in ACSR-VP terms with unknown parameters. H.-H. Kwak et al. (1998) performed the analysis based on the notion of bisimulation, and the outcome of the analysis was a set of predicate equations with free variables. In this paper, we introduce a new approach based on reachability analysis which produces a set of predicate equations with free variables from a specification modeled in ACSR-VP terms. Our approach produce smaller number of predicate equations than the approach based on symbolic weak bisimulation proposed by Kwak et al. The solution to predicate equations identifies under what values of the unknown parameters the system becomes schedulable. Finally, we present as an example a priority assignment problem with multiprocessors in an end-to-end system.