Communicating sequential processes
Communicating sequential processes
Improving the linearly based characterization of P/T nets
APN 90 Proceedings on Advances in Petri nets 1990
Communication and Concurrency
Quantitative Methods in Parallel Systems
Quantitative Methods in Parallel Systems
Approximate Throughput Computation of Stochastic Marked Graphs
IEEE Transactions on Software Engineering
Extended Markovian Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
A comparison of performance evaluation process algebra and generalized stochastic Petri nets
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Stochastic Petri net semantics for stochastic process algebras
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Process algebras are getting mature for performance evaluation?!
ACM SIGMETRICS Performance Evaluation Review
Process algebra for performance evaluation
Theoretical Computer Science
Formal methods for performance evaluation
Lectures on formal methods and performance analysis
Using Max-Plus Algebra for the Evaluation of Stochastic Process Algebra Prefixes
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
TIPPtool: Compositional Specification and Analysis of Markovian Performance Models
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
| Hi-index | 0.00 |
We present an approach for the efficient approximation of the throughput of decision free processes, a class of stochastic process algebra models. Stochastic process algebras are modeling formalisms which are based on communicating sequential processes, in contrast to stochastic Petri nets which focus on causality and concurrency. The algorithm we are using is based on model decomposition at the specification level of stochastic process algebras and has been adopted from marked graphs, a well known subclass of Petri nets. It works in a divide and conquer fashion and it is able to reduce the size of the state space by more than one order of magnitude while the deviation of the exact result is relatively low.