Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
45
The Linear Time-Branching Time Spectrum I - The Semantics of Concrete, Sequential Processes
- Handbook of Process Algebra, chapter 1
"... this paper various semantics in the linear time -- branching time spectrum are presented in a uniform, model-independent way. Restricted to the class of finitely branching, concrete, sequential processes, only fifteen of them turn out to be different, and most semantics found in the literature that ..."
Abstract
-
Cited by 126 (6 self)
- Add to MetaCart
this paper various semantics in the linear time -- branching time spectrum are presented in a uniform, model-independent way. Restricted to the class of finitely branching, concrete, sequential processes, only fifteen of them turn out to be different, and most semantics found in the literature
Symbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs
, 2000
"... Symbolic model checking for purely probabilistic processes using MTBDDs [12] was introduced in [4] and further developed in [20, 3]. In this paper we consider models for concurrent probabilistic systems similar to those of [28, 7, 5] and the concurrent Markov chains of [35, 13], which extend the ..."
Abstract
-
Cited by 38 (16 self)
- Add to MetaCart
the purely probabilistic processes through the addition of nondeterministic choice. As a specification formalism we use the probabilistic branching-time temporal logic PBTL of [5, 7], which allows us to express properties such as "under any scheduling of nondeterministic choices, the probability
Trace Semantics Is Fully Abstract
, 2009
"... The discussion in the computer-science literature of the relative merits of linear- versus branching-time frameworks goes back to the early 1980s. One of the beliefs dominating this discussion has been that the linear-time framework is not expressive enough semantically, making linear-time logics la ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
The discussion in the computer-science literature of the relative merits of linear- versus branching-time frameworks goes back to the early 1980s. One of the beliefs dominating this discussion has been that the linear-time framework is not expressive enough semantically, making linear-time logics
MoDeST: A compositional modeling formalism for hard and softly timed systems
, 2005
"... This paper presents Modest (MOdeling and DEscription language for Stochastic Timed systems), a formalism that is aimed to support (i) the modular description of reactive system’s behaviour while covering both (ii) functional and (iii) non-functional system aspects such as timing and quality-of-servi ..."
Abstract
-
Cited by 22 (9 self)
- Add to MetaCart
can be viewed as an overarching notation for a wide spectrum of models, ranging from labeled transition systems, to timed automata (and probabilistic variants thereof) as well as prominent stochastic processes such as (generalized semi-)Markov chains and decision processes. The paper describes
Saskatoon By
"... In presenting this thesis in partial fulfilment of the requirements for a Postgraduate degree ..."
Abstract
- Add to MetaCart
In presenting this thesis in partial fulfilment of the requirements for a Postgraduate degree
QOS WITH RELIABILITY AND SCALABILITY IN ADAPTIVE SERVICE-BASED SYSTEMS
"... Service-based systems that are dynamically composed at runtime to provide complex, adaptive functionality are currently one of the main development paradigms in software engineering. However, the Quality of Service (QoS) delivered by these systems remains an important concern, and needs to be manage ..."
Abstract
- Add to MetaCart
that achieve their QoS requirements through dynamically adapting to changes in the system state, environment, and workload. QoSMOS service-based systems translate high-level QoS requirements specified by their administrators into probabilistic temporal logic formulae, which are then formally and automatically
Design of Covariance Functions using Inter-Domain Inducing Variables
"... We introduced the Gaussian Process Convolution Model (GPCM) in [1], a time-series model for stationary signals based on the convolution between a continuous-time white-noise process and a continuous-time linear filter drawn from Gaussian process. The GPCM is, conditionally, itself a Gaussian process ..."
Abstract
- Add to MetaCart
process with a nonpara-metric kernel defined in a probabilistic fashion. Learning is achieved using a variational free-energy approach based on inter-domain inducing variables that summarise the (posterior) continuous-time linear filter and the driving white-noise process. However, the inter
1Channel Capacity under Sub-Nyquist Nonuniform Sampling
"... Abstract—This paper investigates the effect of sub-Nyquist sampling upon the capacity of an analog channel. The channel is assumed to be a linear time-invariant Gaussian channel, where perfect channel knowledge is available at both the transmitter and the receiver. We consider a general class of rig ..."
Abstract
- Add to MetaCart
Abstract—This paper investigates the effect of sub-Nyquist sampling upon the capacity of an analog channel. The channel is assumed to be a linear time-invariant Gaussian channel, where perfect channel knowledge is available at both the transmitter and the receiver. We consider a general class
3esis Supervisor Accepted by
, 2005
"... in partial ful2llment of the requirements for the degree of ..."
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
Results 1 - 10
of
45
