systems, formal specification. In this paper we develop a probabilistic real-time calculus for performance evaluation. The calculus applies a simple gener-ative model of probabilities. Next to probabilistic action tran-sitions, probabilistic time transitions are supported. An opera-tional characterization is given in terms of a labelled transition system. The operational rules for the real-time part of the cal-culus are constructed in such a way, that the transition system can be interpreted as a discrete-time Markov chain. They fur-ther yield a constructive approach towards the efficient execu-tion of processes and generation of transition graphs. On top of the operational rules, bisimulation equivalence is defined and proven to be a congr...
Process algebras are formalisms for abstract modeling of systems for the purpose of qualitative veri...
We present a testing theory for Markovian processes in order to formalize a notion of efficiency whi...
AbstractThe modeling and analysis experience with process algebras has shown the necessity of extend...
Abstract. Formal notations like B or action systems support a notion of refinement. Refinement relat...
We introduce the probabilistic action system formalism which combines refinement with performance. P...
Abstract: This paper surveys some new tools and methods for formally verifying time performance prop...
We consider a discrete time process algebra capable of (i) modeling processes with different probabi...
Formal notations like B or action systems support a notion of refinement. Refinement relates an abst...
When testing a system, it is often necessary to execute a suspicious trace in a realistic environmen...
Abstract—We propose the model of discrete-time probabilistic reward graphs (DTPRGs) for performance ...
We propose the model of discrete-time probabilistic reward graphs (DTPRGs) for performance analysis ...
International audienceSince the early work of Lehoczky on real-time queuing theory, probabilistic ap...
Abstract. We present a testing theory for Markovian processes in order to formalize a notion of effi...
Markov chains (and their extensions with rewards) have been widely used to determine performance, de...
AbstractWe present a process algebra expressing probabilistic external/internal choices, multi-way s...
Process algebras are formalisms for abstract modeling of systems for the purpose of qualitative veri...
We present a testing theory for Markovian processes in order to formalize a notion of efficiency whi...
AbstractThe modeling and analysis experience with process algebras has shown the necessity of extend...
Abstract. Formal notations like B or action systems support a notion of refinement. Refinement relat...
We introduce the probabilistic action system formalism which combines refinement with performance. P...
Abstract: This paper surveys some new tools and methods for formally verifying time performance prop...
We consider a discrete time process algebra capable of (i) modeling processes with different probabi...
Formal notations like B or action systems support a notion of refinement. Refinement relates an abst...
When testing a system, it is often necessary to execute a suspicious trace in a realistic environmen...
Abstract—We propose the model of discrete-time probabilistic reward graphs (DTPRGs) for performance ...
We propose the model of discrete-time probabilistic reward graphs (DTPRGs) for performance analysis ...
International audienceSince the early work of Lehoczky on real-time queuing theory, probabilistic ap...
Abstract. We present a testing theory for Markovian processes in order to formalize a notion of effi...
Markov chains (and their extensions with rewards) have been widely used to determine performance, de...
AbstractWe present a process algebra expressing probabilistic external/internal choices, multi-way s...
Process algebras are formalisms for abstract modeling of systems for the purpose of qualitative veri...
We present a testing theory for Markovian processes in order to formalize a notion of efficiency whi...
AbstractThe modeling and analysis experience with process algebras has shown the necessity of extend...