Communicating sequential processes
Communicating sequential processes
Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Performance of Computer Communication Systems: A Model-Based Approach
Performance of Computer Communication Systems: A Model-Based Approach
Communication and Concurrency
A Theory of Testing for Markovian Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Rate-Based Transition Systems for Stochastic Process Calculi
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A Process Algebraic Approach to Software Architecture Design
A Process Algebraic Approach to Software Architecture Design
On a Uniform Framework for the Definition of Stochastic Process Languages
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
A uniform definition of stochastic process calculi
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chains with process terms. The transition relation assigns to each process, for each action, the set of possible futures paired with a measure indicating the rates at which they are reached. RTS have been shown to be a uniform model for providing an operational semantics to many stochastic process algebras. In this paper, we define Uniform Labeled TRAnsition Systems (ULTraS) as a generalization of RTS that can be exploited to uniformly describe also nondeterministic and probabilistic variants of process algebras. We then present a general notion of behavioral relation for ULTraS that can be instantiated to capture bisimulation and trace equivalences for fully nondeterministic, fully probabilistic, and fully stochastic processes.