Many security protocols rely on the assumptions on the physical properties in which its protocol sessions will be carried out. For instance, Distance Bounding Protocols take into account the round trip time of messages and the transmission velocity to infer an upper bound of the distance between two agents. We classify such security protocols as Cyber-Physical. Time plays a key role in design a...

RFID applications usually rely on RFID deployments to manage high-level events such as tracking the location that products visit for supply-chain management, localizing intruders for alerting services, and so on. However, transforming low-level streams into high-level events poses a number of challenges. In this paper, we deal with the well known issues of data redundancy and data-information m...

Properties of probabilistic as well as \probabilistic plus nondeterministic" pushdown automata and auxiliary pushdown automata are studied. These models are analogous to their counterparts with nondeterministic and alternating states. Complete characterizations in terms of well-known complexity classes are given for the classes of languages recognized by polynomial time-bounded, logarithmic spa...

Classical arti cial intelligence planning techniques can operate in large domains but traditionally assume a deterministic universe. Operations research planning techniques can operate in probabilistic domains but break when the domains approach realistic sizes. maxplan is a new probabilistic planning technique that aims at combining the best of these two worlds. maxplan converts a planning ins...

For the semantics of probabilistic features in programming mainly two approaches are used for building models. One is the Giry monad of Borel probability measures over metric spaces, and the other is Jones’ probabilistic powerdomain monad [6] over dcpos (directed complete partial orders). This paper places itself in the second domain theoretical tradition. The probabilistic powerdomain monad is...

This paper provides a case-study in the field of metric semantics for probabilistic programming. Both an operational and a denotational semantics are presented for an abstract process language Lpr , which features action refinement and probabilistic choice. The two models are constructed in the setting of complete ultrametric spaces, here based on probability measures of compact support over se...

A temporal logic for reasoning about probabilistic systems is considered exogenous probabilistic computation tree logic (EpCTL). Both a syntactic and a semantic approach to verify systems with EpCTL are introduced. For the first approach a (weakly) complete Hilbert calculus is given. The completeness result capitalizes in the decidability of the existential theory of the real numbers and in a P...

We present two (closely-related) propositional probabilistic temporal logics based on temporal logics of branching time as introduced The first logic, PTLf, is interpreted over finite models, while the second logic, PTLb, which is an extension of the first one, is interpreted over infinite models with transition probabilities bounded away from O. The logic PTLf allows us to reason about finite-...

The primary objective of the paper is to revisit the statistical foundations of panel data modeling with a view to render their probabilistic assumptions testable vis-a-vis the data. This involves (a) recasting the error assumptions in terms of the probabilistic structure of the observable processes underlying the data, (b) specifying panel data models in terms of a complete and internally cons...

Probabilistic databases store, query, and manage large amounts of uncertain information. This thesis advances the state-of-the-art in probabilistic databases in three different ways: 1. We present a closed and complete data model for temporal probabilistic databases and analyze its complexity. Queries are posed via temporal deduction rules which induce lineage formulas capturing both time and u...