2850 search results - page 425 / 570 » On Timed Models and Full Abstraction |
141
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
157
click to vote
TIP
2008
15 years 6 months ago
2008
Abstract--In this paper, we present an analytic, filtered backprojection (FBP) type inversion method for bistatic synthetic aperture radar (BISAR). We consider a BISAR system where...
161
click to vote
AICOM
2004
15 years 6 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
133
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Twelve years ago, various notions of preferential entailment have been introduced. The main reference is a paper by Kraus, Lehmann and Magidor (KLM), one of the main comp...
148
click to vote
FUIN
2002
15 years 6 months ago
2002
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...