394
Voted
IANDC
9 years 10 months ago
2016
We consider the problem of computing the satisfaction probability of a formula for stochastic models with parametric uncertainty. We show that this satisfaction probability is a s...
378
click to vote
IANDC
9 years 10 months ago
2016
We investigate the behaviour of population models, specified in stochastic Concurrent Constraint Programming (sCCP). In particular, we focus on models from which we can define a...
441
click to vote
IANDC
9 years 10 months ago
2016
Language equivalence and inclusion can be checked coinductively by establishing a (bi)simulation on suitable deterministic automata. In this paper we present an enhancement of thi...
516
click to vote
IANDC
9 years 10 months ago
2016
We present a MAT learning algorithm that infers the universal automaton for a regular target language using a polynomial number of queries with respect to that automaton. The univ...
367
Voted
IANDC
9 years 10 months ago
2016
Consider a scenario in which parties use a public-key encryption scheme and a signature scheme with a single public key/private key pair—so the private key sk is used for both s...
|