Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A LOTOS extension for the performance analysis of distributed systems
IEEE/ACM Transactions on Networking (TON)
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Process algebra for performance evaluation
Theoretical Computer Science
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
PAMR: A Process Algebra for the Management of Resources in Concurrent Systems
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Encoding PAMR into (Timed) EFSMs
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Formal Aspects of Computing
Specification and testing of autonomous agents in e-commerce systems: Research Articles
Software Testing, Verification & Reliability
Formal specification of multi-agent e-barter systems
Science of Computer Programming
A theory of stochastic systems part I: Stochastic automata
Information and Computation
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
Formal specification of multi-agent systems by using EUSMs
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
On statistical model checking of stochastic systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Weak stochastic bisimulation for non-markovian processes
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
In this paper we introduce time information in PAMR (Process Algebra for the Management of Resources). PAMR is a process algebra that simplifies the task of specifying processes whose behavior strongly depend on the resources that they have. One of the drawbacks of PAMR is that there is not an appropriate notion of time. In this paper we will consider that the duration of actions is controlled by a random variable. These random variables will take values, according to some probability distribution functions, that may depend, in particular, on the available resources. We present two examples showing the main features of our stochastic version of PAMR.