Email this article Process Algebra with Timed-Priority Executing Policy
Abstract
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.Keywords
References
Luca Aceto, Taolue Chen, Wan Fokkink and Anna Ingolfsdottir, On the Axiomatizability of Priority, Lecture Notes in Computer Science, Volume 4052, pp. 480-491, 2006.
http://dx.doi.org/10.1007/11787006_41
J.C.M. Beaten and W.P. Weijiland, Process Algebra, Cambridge University Press, 1990.
J. A. Bergstra and J.W. Klop, Algebra of Communitating Processes with Abstraction, TCS 37,1, pp. 77-121, 1985.
M. Bravetti and M. Bernardo. Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time. In Proc. of the 1st International Workshop on Models for Time Critical Systems, volume 39 (3) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2000. E. Brinksma, H. Hermanns. Process Algebra and Markov Chains J.-P. Katoen (Eds.) FMPA2000, LNCS 2090, pp. 183C231, 2001. Springer- Verlag Berlin Heidelberg 2001.
Eddy Caron, Pushpinder Kaur Chouhan, Frederic Desprez, Deadline Scheduling with Priority for Client-Server Systems on the Grid, Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing, Pages: 410 - 414, 2004
http://dx.doi.org/10.1109/GRID.2004.18
L. Christoff. Specification and Verification Methods for Probabilistic Process. PhD thesis, Department of Computer Science, Uppsala University, March 1993.
Rance Cleaveland, Gerald L¨uttgen, V. Natarajan, Priority and abstraction in process algebra, Information and Computation, Volume 205, Issue 9, Pages 1426-1458, 2007.
http://dx.doi.org/10.1016/j.ic.2007.05.001
P.R. DArgenio, B. Jeannet, H.E. Jensen, and K.G. Larsen, Reachability analysis of probabilistic systems by successive refinements, PAPMPROBMIV 2001, Aachen, Germany (L. de Alfaro and S. Gilmore, eds.), LNCS, vol. 2165, Springer-Verlag, 2001, pp. 29C56.
Harald Fecher, Heiko Schmidt, Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems, Electronic Notes in Theoretical Computer Science (ENTCS), Volume 192, Issue 1, Pages 45- 60, 2007 .
http://dx.doi.org/10.1016/j.entcs.2007.08.016
A. Giacalone, C.-C. Jou and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In M. Broy and C.B. Jones, eds, Proc. of the Working Conf. on Programming Concepts and Methods, pages 443–458. North-Holland, 1990.
Rob van Glabbeek, Frits Vaandrager. Bundle Event Structures and CCSP Lecture Notes in Computer Science Volume 2761, 57-71, 2003.
N. G¨otz, U. Herzog, and M. Rettelbach. TIPP - A Stochastic Process Algebra. In J. Hillston and F. Moller, editors, Proc. of the Workshop on Process Algebra and Performance Modelling. Department of Computer Science, University of Edinburgh, May 1993.
Holger Hermanns, Ulrich Herzog and Joost-Pieter Katoen, Process algebra for performance evaluation, Theoretical Computer Science, 274, pp 43-87, 2002.
http://dx.doi.org/10.1016/S0304-3975(00)00305-4
H. Hermanns and M. Rettelbach. Syntax, Semantics, Equivalences, and Axioms for MTIPP. In U. Herzog and M. Rettelbach, editors, Proc. of the 2nd Workshop on Process Algebras and Performance Modelling, Erlangen-Regensberg, July 1994. IMMD, Universitat Erlangen-Nurnberg.
Jane Hillston, A Compositional Approach to Performance Modelling, 1996, Cambridge University Press.
http://dx.doi.org/10.1017/CBO9780511569951
Jane Hillston, Process algebras for Quantitative Analysis, 2005, Proceedings of the 20th Annual Symposium on Logic in Computer Science (LICS’05). C.A.R. Hoare. Communicating Sequential Process, Prentice-Hall, 1985. C-C. Jou and S.A. Smolka. Equivalences, Congruences and Complete Axiomatizations of Probabilistic Processes. In J.C.M. Baeten and J.W. Klop, editors, CONCUR’90, volume 458 of LNCS, pages 367-383. Springer-Verlag, August 1990.
K. Larsen and A. Skou. Bisimulation through Probabilistic Testing. Information and Computation, 94(1):1-28, September 1991.
http://dx.doi.org/10.1016/0890-5401(91)90030-6
J-P. Katoen. Quantitative and qualitative extensions of event structures, PhD thesis, University of Twente, 1996.
Robin Milner, Communication and Concurrency, Prentice Hall, 1989.
M. Mislove, J. Ouaknine and J. Worrell. Axioms for Probability and Nondeterminism. In Proc. EXPRESS’03, ENTCS 91(3), 2003.
Anna Philippou, Rance Cleaveland, Insup Lee, Scott Smolka, Oleg Sokolsky, Probabilistic Resource Failure in Real-Time Process Algebra, Lecture Notes in Computer Science, Springer Berlin, Volume 1466, pp. 465-472, 1998
M.I.A. Stoelinga and F.W. Vaandrager. A testing scenario for probabilistic automata. In J.C.M. Baeten, J.K. Lenstra, J. Parrow, and G.J. Woeginger, editors, Proceedings 30 ICALP, volume 2719 of Lecture Notes in Computer Science, pages 407-418. Springer-Verlag, 2003.
C. Tofts. Describing Social Insect Behaviour Using Process Algebra. Transactions of the Society for Computer Simulation, 9(4):227-283, December 1992.
Daniele Varacca, Glynn Winskel. Distributing probability over nondeterminism Mathematical Structures in Computer Science archive Volume 16, Issue 1 (February 2006) Pages: 87 - 113, 2006 ISSN:0960-1295, Cambridge University Press.
Full Text: PDF