Abstract
A True Concurrency Timed Process Algebra which takes into account the number of resources/processors that processes have at disposal is presented. Both its syntax and its operational semantics are defined. An algorithm which allows us to estimate the required time to evolve between states and which allows us to evaluate the performance of a system is also presented. A simple example is used to illustrate how a system can be specified by means of our language and how the performance evaluation algorithm works. © Springer-Verlag 2004.
Cite
CITATION STYLE
Carmen Ruiz, M., Cazorla, D., Cuartero, F., José Pardo, J., & Macià, H. (2004). A bounded true concurrency process algebra for performance evaluation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3236, 143–155. https://doi.org/10.1007/978-3-540-30233-9_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
