337 search results - page 13 / 68 » On Weak Markov's Principle |
98
Voted
RE
2001
Springer
15 years 5 months ago
2001
Springer
at different levels of abstraction. There are two very different ways of using such languages. One approach is based on the manifestation of a single model, with construction of di...
106
Voted
QEST
2005
IEEE
15 years 6 months ago
2005
IEEE
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...
96
Voted
CONCUR
2003
Springer
15 years 5 months ago
2003
Springer
d Abstract) Christel Baier1 , Holger Hermanns2,3 , Joost-Pieter Katoen2 , and Verena Wolf1 1 Institut f¨ur Informatik I, University of Bonn R¨omerstraße 164, D-53117 Bonn, Germa...
104
click to vote
ICTAC
2004
Springer
15 years 6 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
88
Voted
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...