Sciweavers

52 search results - page 3 / 11
» The Generalised Substitution Language Extended to Probabilis...
Sort
View
IFIP
2005
Springer
14 years 2 months ago
Opacity Generalised to Transition Systems
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of...
Jeremy Bryans, Maciej Koutny, Laurent Mazaré...
POPL
2006
ACM
14 years 9 months ago
A polymorphic modal type system for lisp-like multi-staged languages
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno
ICALP
2011
Springer
13 years 1 days ago
On the Semantics of Markov Automata
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
Yuxin Deng, Matthew Hennessy
ICLP
2005
Springer
14 years 2 months ago
Hybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
Emad Saad, Enrico Pontelli
ICRA
2000
IEEE
101views Robotics» more  ICRA 2000»
14 years 1 months ago
Towards Programming Tools for Robots that Integrate Probabilistic Computation and Learning
This paper describes a programming language extension of C++, called CES, specifically targeted towards mobile robot control. CES’s design is motivated by a recent series of su...
Sebastian Thrun