Sciweavers

31 search results - page 6 / 7
» iandc 2010
Sort
View
IANDC
2010
116views more  IANDC 2010»
13 years 3 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
151views more  IANDC 2010»
13 years 3 months ago
Complete sets of cooperations
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
Clemens Kupke, Jan J. M. M. Rutten
IANDC
2010
115views more  IANDC 2010»
13 years 2 months ago
18th International Conference on Concurrency Theory
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
Luís Caires, Vasco Thudichum Vasconcelos
IANDC
2010
95views more  IANDC 2010»
13 years 2 months ago
Structured anaphora to quantifier domains
The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with...
Adrian Brasoveanu
IANDC
2010
141views more  IANDC 2010»
13 years 3 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner