A predicate logic of probability, close to logics of probability of Halpern and al., is introduced. Our main result concerns the following model-checking problem: deciding whether a given formulaâ€¦ (More)

We describe a prototype of a simulator for reactive timed abstract state machines (ASM) that checks whether the generated runs verify a requirements specification represented as a formula of a Firstâ€¦ (More)

Given a set of semi-algebraic obstacles in the plane and two points in the same connected component of the complement, the problem is to construct the shortest path between these points in a givenâ€¦ (More)

The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to au-tomatize model checking in high level, easily understandableâ€¦ (More)

We describe a decidable class of formulas in a first order timed logic that covers a good amount of properties of real-time distributed systems. Earlier we described a decidable class based on someâ€¦ (More)

Given a set of semi-algebraic obstacles in the plane and two points in the same connected component of the complement, the problem is to construct a polygonal path between these points which has theâ€¦ (More)