Sciweavers

98 search results - page 13 / 20
» Weak Bisimulation for Probabilistic Systems
Sort
View
APAL
2004
105views more  APAL 2004»
14 years 9 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
WETICE
2006
IEEE
15 years 3 months ago
Co-Presence Communities: Using Pervasive Computing to Support Weak Social Networks
Although the strongest social relationships feature most prominently in our lives, we also maintain a multitude of much weaker connections: the distant colleagues that we share a ...
Jamie Lawrence, Terry R. Payne, David De Roure
HYBRID
2007
Springer
15 years 3 months ago
Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
Alessandro Abate, Saurabh Amin, Maria Prandini, Jo...
LICS
2009
IEEE
15 years 4 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
IJFCS
2006
106views more  IJFCS 2006»
14 years 9 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...