Sciweavers

100 search results - page 14 / 20
» Symbolic Bisimulations for Probabilistic Systems
Sort
View
LICS
2003
IEEE
15 years 11 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
ICSE
2012
IEEE-ACM
13 years 8 months ago
Engineering and verifying requirements for programmable self-assembling nanomachines
—We propose an extension of van Lamsweerde’s goal-oriented requirements engineering to the domain of programmable DNA nanotechnology. This is a domain in which individual devic...
Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Tit...
AGI
2011
14 years 9 months ago
Imprecise Probability as a Linking Mechanism between Deep Learning, Symbolic Cognition and Local Feature Detection in Vision Pro
A novel approach to computer vision is outlined, involving the use of imprecise probabilities to connect a deep learning based hierarchical vision system with both local feature de...
Ben Goertzel
ENTCS
2002
139views more  ENTCS 2002»
15 years 5 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
QEST
2008
IEEE
16 years 10 days ago
Symbolic Magnifying Lens Abstraction in Markov Decision Processes
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
Pritam Roy, David Parker, Gethin Norman, Luca de A...