PAMR: A Process Algebra for the Management of Resources in Concurrent Systems
暂无分享,去创建一个
[1] Jim Davies,et al. A Brief History of Timed CSP , 1995, Theor. Comput. Sci..
[2] Insup Lee,et al. A Process Algebra of Communicating Shared Resources with Dense Time and Priorities , 1997, Theor. Comput. Sci..
[3] Joost-Pieter Katoen,et al. Process algebra for performance evaluation , 2002, Theor. Comput. Sci..
[4] Roberto Gorrieri,et al. A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time , 1998, Theor. Comput. Sci..
[5] Tommaso Bolognesi. A graphical composition theorem for networks of LOTOS processes , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.
[6] Ilya Segal,et al. Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .
[7] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[8] L. A. Goodman,et al. Social Choice and Individual Values , 1951 .
[9] Nancy A. Lynch,et al. Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.
[10] Mario Bravetti,et al. The theory of interactive generalized semi-Markov processes , 2002, Theor. Comput. Sci..
[11] Mihaela Sighireanu,et al. A Graphical Parallel Composition Operator for Process Algebras , 1999, FORTE.