Abstract
In this paper we present a process algebra for the management of resources in concurrent systems. Our aim is to define a formal framework that can help in the task of specifying systems that depend, for their execution, on a set of resources that they use. Usually systems consist in a set of processes. In order to improve their performance, these processes will be able to exchange resources among them. In our language, processes will consist in a behavior (formalized as a LOTOS process) and in information about the resources that they own. Systems will be defined as the parallel composition of a set of processes. We will study some examples applying the features of PAMR. These examples will try to show the usefulness of our language for specifying and analyzing concurrent systems where resources play an important role.
Research supported in part by the CICYT project TIC 2000-0701-C02-0 1.
Chapter PDF
Similar content being viewed by others
References
K. J. Arrow. Social Choice and Individual Values. Wiley, 2nd edition, 1963.
M. Bernardo and R. Gorrieri. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202:1–54, 1998.
T. Bolognesi. A graphical composition theorem for networks of LOTOS processes. In 10th International Conference on Distributed Computing Systems, pages 88–95. IEEE-CS Press, 1990.
M. Bravetti and R. Gorrieri. The theory of interactive generalized semi-markov processes. To appear in Theoretical Computer Science, 2001.
P. Brémond-Grégoire and I. Lee. A process algebra of communicating shared resources with dense time and priorities. Theoretical Computer Science, 189(1–2): 179–219, 1997.
J. Davies and S. Schneider. A brief history of timed CSP. Theoretical Computer Science, 138:243–271, 1995.
H. Garavel and M. Sighireanu. A graphical parallel composition operator for process algebras. In Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX), pages 185–202. Kluwer Academic Publishers, 1999.
H. Hermanns, U. Herzog, and J.-P. Katoen. Process algebra for performance evaluation. To appear in Theoretical Computer Science, 2001.
ISO/IEC. ODP Trading Function. Draft International Standard 13235, ISO-Information Processing Systems, 1995.
N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In 6th ACM Symp. on Principles of Distributed Computing, pages 137–151, 1987.
A. Mas-Colell, M.D. Whinston, and J.R. Green. Microeconomic Theory. Oxford University Press, 1995.
M. Núñez. Including microeconomic theory into FDTs: A first approach. Available at: http://dalila.sip.ucm.es/~manolo/papers/exchange.ps.gz, 2000.
M. Núñez and I. Rodríguez. pamr: A process algebra for the management of resources in concurrent system. Available at: http://dalila.sip.ucm.es/~manolo/papers/pamr.ps.gz, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 IFIP International Federation for Information Processing
About this paper
Cite this paper
Núñez, M., Rodríguez, I. (2001). PAMR: A Process Algebra for the Management of Resources in Concurrent Systems. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds) Formal Techniques for Networked and Distributed Systems. FORTE 2001. IFIP International Federation for Information Processing, vol 69. Springer, Boston, MA. https://doi.org/10.1007/0-306-47003-9_11
Download citation
DOI: https://doi.org/10.1007/0-306-47003-9_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7470-1
Online ISBN: 978-0-306-47003-5
eBook Packages: Springer Book Archive