Results 1 - 10 of 7,470

Dense-Timed Pushdown Automata

by Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
"... Abstract—We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks, and ..."
Abstract - Cited by 12 (4 self) - Add to MetaCart
Abstract—We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks

Dense Time and Temporal Constraints with ≠

by Manolis Koubarakis - IN PROC. 3RD INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING (KR-92 , 1992
"... In some temporal reasoning systems, inequations can give rise to disjunctions of inequations when variable elimination is performed. Motivated by this observation, we extend previous research on temporal constraints by considering disjunctions of inequations (under the assumption that time is dense. ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
In some temporal reasoning systems, inequations can give rise to disjunctions of inequations when variable elimination is performed. Motivated by this observation, we extend previous research on temporal constraints by considering disjunctions of inequations (under the assumption that time is dense

Obligations and Dense Time for Specifying Deadlines

by F. Dignum, R. Kuiper , 1998
"... In this paper we consider the notion of deadlines in the context of dense time. We show that obligations and actions are essential elements for the specification of deadlines. These notions can be relatively easy combined when a discrete temporal framework is used. However, we show that, once a dens ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
In this paper we consider the notion of deadlines in the context of dense time. We show that obligations and actions are essential elements for the specification of deadlines. These notions can be relatively easy combined when a discrete temporal framework is used. However, we show that, once a

Fast Asynchronous Systems in Dense Time

by Lars Jenner, Walter Vogler - TCS , 1995
"... A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case efficiency of asynchronous systems using dense time. For all three variants considered, it is shown that one can equivalently use discrete time; in the discrete versions, one variant coincides with an ap ..."
Abstract - Cited by 15 (11 self) - Add to MetaCart
A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case efficiency of asynchronous systems using dense time. For all three variants considered, it is shown that one can equivalently use discrete time; in the discrete versions, one variant coincides

Digitisation and full abstraction for dense-time model checking

by Joël Ouaknine - In Proceedings of TACAS 02 , 2002
"... Abstract. We study the digitisation of dense-time behaviours of timed processes, and show how this leads to exact verification methods for a large class of dense-time specifications. These specifications are all closed under inverse digitisation, a robustness property first introduced by Henzinger, ..."
Abstract - Cited by 18 (9 self) - Add to MetaCart
Abstract. We study the digitisation of dense-time behaviours of timed processes, and show how this leads to exact verification methods for a large class of dense-time specifications. These specifications are all closed under inverse digitisation, a robustness property first introduced by Henzinger

On the expressiveness of MTL variants over dense time

by Carlo A. Furia, Matteo Rossi - In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS’07), Lecture Notes in Computer Science , 2007
"... The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or not, and matching (when it requires its two arguments to eventually hold together) or not. This paper compares the relat ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
the relative expressiveness of the resulting MTL variants over dense time. We prove that the expressiveness is not affected by the variations when considering non-Zeno interpretations and arbitrary nesting of temporal operators. On the contrary, the expressiveness changes for flat

CONDENSATION -- conditional density propagation for visual tracking

by Michael Isard, Andrew Blake , 1998
"... The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses “factored sampling”, previously applied to th ..."
Abstract - Cited by 1503 (12 self) - Add to MetaCart
The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses “factored sampling”, previously applied

Model-Checking in Dense Real-time

by Rajeev Alur, Costas Courcoubetis, David Dill - INFORMATION AND COMPUTATION , 1993
"... Model-checking is a method of verifying concurrent systems in which a state-transition graph model of the system behavior is compared with a temporal logic formula. This paper extends model-checking for the branching-time logic CTL to the analysis of real-time systems, whose correctness depends on t ..."
Abstract - Cited by 327 (7 self) - Add to MetaCart
-formula with respect to a timed graph. We argue that choosing a dense domain instead of a discrete domain to mo...

TCTL Inevitability Analysis of Dense-Time Systems

by Farn Wang, Geng-dian Hwang, Fang Yu - LNCS 2759 , 2003
"... Inevitability properties in branching temporal logics are of the syntax ∀♦φ, where φ is an arbitrary (timed) CTL formula. In the sense that ”good things will happen”, they are parallel to the ”liveness” properties in linear temporal logics. Such inevitability properties in dense-time logics can be a ..."
Abstract - Cited by 12 (7 self) - Add to MetaCart
Inevitability properties in branching temporal logics are of the syntax ∀♦φ, where φ is an arbitrary (timed) CTL formula. In the sense that ”good things will happen”, they are parallel to the ”liveness” properties in linear temporal logics. Such inevitability properties in dense-time logics can

Contour Tracking By Stochastic Propagation of Conditional Density

by Michael Isard, Andrew Blake , 1996
"... . In Proc. European Conf. Computer Vision, 1996, pp. 343--356, Cambridge, UK The problem of tracking curves in dense visual clutter is a challenging one. Trackers based on Kalman filters are of limited use; because they are based on Gaussian densities which are unimodal, they cannot represent s ..."
Abstract - Cited by 661 (23 self) - Add to MetaCart
. In Proc. European Conf. Computer Vision, 1996, pp. 343--356, Cambridge, UK The problem of tracking curves in dense visual clutter is a challenging one. Trackers based on Kalman filters are of limited use; because they are based on Gaussian densities which are unimodal, they cannot represent
Results 1 - 10 of 7,470