Sciweavers

3229 search results - page 183 / 646
» The Theory of Timed Automata
Sort
View
ESOP
2007
Springer
16 years 1 months ago
Probabilistic Anonymity Via Coalgebraic Simulations
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...
Ichiro Hasuo, Yoshinobu Kawabe
168
Voted
FSTTCS
2004
Springer
16 years 14 days ago
Verifying Probabilistic Procedural Programs
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
Javier Esparza, Kousha Etessami
SBIA
2004
Springer
16 years 13 days ago
An Experiment on Handshape Sign Recognition Using Adaptive Technology: Preliminary Results
This paper presents an overview of current work on the recognition of sign language and a prototype of a simple editor for a small subset of the Brazilian Sign Language, LIBRAS. Ha...
Hemerson Pistori, João José Neto
195
Voted
HYBRID
2003
Springer
16 years 9 days ago
On Systematic Simulation of Open Continuous Systems
Abstract. In this paper we investigate a new technique to determine whether an open continuous system behaves correctly for all admissible input signals. This technique is based on...
James Kapinski, Bruce H. Krogh, Oded Maler, Olaf S...
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
15 years 11 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...