Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Process algebra
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
Communication and Concurrency
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
A Theory of Testing for Markovian Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
An algebraic approach to the specification of stochastic systems
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Formal Aspects of Computing
Extending Timed Process Algebra with Discrete Stochastic Time
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
SPAMR: extending PAMR with stochastic time
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
| Hi-index | 0.00 |
In this paper we introduce a novel notion of bisimulation to properly capture the behavior of stochastic systems with general distributions. The key idea consists in the identification of different sequences of random variables if the additions of the random variables of each sequence are identically distributed. That is, we will not only identify sequences of internal actions with one of them (as it is usually done in weak bisimulations) but we will also reduce (in some conditions) sequences of stochastic transitions to only one transition. Therefore, we will identify processes that are considered non-equivalent in previous notions of bisimulation for this kind of languages.