Process Algebra with Timed-Priority Executing Policy

Equipped with powerful machines and complex softwares, web servers providing services are widely used all  over the Internet. But, how to specify their behaviors are interesting and meaningful. However, process algebras nowadays cannot specify the behaviors of web servers with time limitations and different groups of clients who are belong to different groups/priorities. The behaviors of web servers can be expressed by actions equipped with parameters of time t and priority w . We present a process algebra with timed-priority executing policy which can specify the behaviors of web servers.

[1]  Rance Cleaveland,et al.  Priority and abstraction in process algebra , 2007, Inf. Comput..

[2]  Holger Hermanns,et al.  Process Algebra and Markov Chains , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[3]  H. Hermanns,et al.  Syntax , Semantics , Equivalences , and Axioms for MTIPP y , 1994 .

[4]  Frits W. Vaandrager,et al.  A Testing Scenario for Probabilistic Automata , 2003, ICALP.

[5]  Glynn Winskel,et al.  Distributing probability over non-determinism , 2006, Mathematical Structures in Computer Science.

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

[7]  Norbert Götz,et al.  Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras , 1993, Performance/SIGMETRICS Tutorials.

[8]  Eddy Caron,et al.  Deadline scheduling with priority for client-server systems on the grid , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[9]  Scott A. Smolka,et al.  Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes , 1990, CONCUR.

[10]  Rance Cleaveland,et al.  Praobabilistic Resource Failure in Real-Time Process Algebra , 1998, CONCUR.

[11]  Henrik Ejersbo Jensen,et al.  Reachability Analysis of Probabilistic Systems by Successive Refinements , 2001, PAPM-PROBMIV.

[12]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[13]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[14]  Joël Ouaknine,et al.  Axioms for Probability and Nondeterminism , 2004, EXPRESS.

[15]  Luca Aceto,et al.  On the Axiomatizability of Priority , 2006, ICALP.

[16]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[17]  Frits W. Vaandrager,et al.  Bundle Event Structures and CCSP , 2003, CONCUR.

[18]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[19]  Joost-Pieter Katoen,et al.  Process algebra for performance evaluation , 2002, Theor. Comput. Sci..

[20]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[21]  Jane Hillston,et al.  Process algebras for quantitative analysis , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[22]  Mario Bravetti,et al.  Compositional Asymmetric Cooperations for Process Algebras with Probabilities, Priorities, and Time , 2000, MTCS.

[23]  Rance Cleaveland,et al.  Priority and abstraction in process algebra , 1994, Inf. Comput..

[24]  Harald Fecher,et al.  Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems , 2007, SOS@LICS/ICALP.

[25]  Joost-Pieter Katoen,et al.  Quantitative and Qualitative Extensions of Event Structures , 1996 .

[26]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..