Sciweavers

IANDC
2010
116views more  IANDC 2010»
13 years 10 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
IANDC
2010
91views more  IANDC 2010»
13 years 10 months ago
Functional interpretations of linear and intuitionistic logic
This article shows how different functional interpretations can be combined into what we term hybrid functional interpretations. These hybrid interpretations work on the setting o...
Paulo Oliva
IANDC
2010
128views more  IANDC 2010»
13 years 10 months ago
A coinductive calculus of binary trees
We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on ...
Alexandra Silva, Jan J. M. M. Rutten
IANDC
2010
67views more  IANDC 2010»
13 years 10 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
IANDC
2010
58views more  IANDC 2010»
13 years 10 months ago
Efficient algorithms for the block edit problems
Hsing-Yen Ann, Chang-Biau Yang, Yung-Hsing Peng, B...
IANDC
2010
84views more  IANDC 2010»
13 years 10 months ago
Underapproximation for model-checking based on universal circuits
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit de...
Arie Matsliah, Ofer Strichman
IANDC
2010
45views more  IANDC 2010»
13 years 10 months ago
Models of active learning in group-structured state spaces
Gábor Bartók, Csaba Szepesvár...
IANDC
2010
84views more  IANDC 2010»
13 years 10 months ago
Modules over monads and initial semantics
Inspired by the classical theory of modules over a monoid, we introduce the natural notion of module over a monad. The associated notion of morphism of left modules (”linear” n...
André Hirschowitz, Marco Maggesi
IANDC
2010
83views more  IANDC 2010»
13 years 10 months ago
Static analysis of topology-dependent broadcast networks
Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast netwo...
Sebastian Nanz, Flemming Nielson, Hanne Riis Niels...
IANDC
2010
57views more  IANDC 2010»
13 years 10 months ago
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Sibylle B. Fröschle, Petr Jancar, Slawomir La...