Results 1 - 10 of 2,020

Verification using simulation

by Antoine Girard - In: Hybrid Systems: Computation and Control (HSCC). Volume 3927 of LNCS., Springer (2006) 272 – 286 , 2006
"... Abstract. Verification and simulation have always been complementary, if not competing, approaches to system design. In this paper, we present a novel method for so-called metric transition systems that bridges the gap between verification and simulation, enabling system verification using a finite ..."
Abstract - Cited by 44 (6 self) - Add to MetaCart
Abstract. Verification and simulation have always been complementary, if not competing, approaches to system design. In this paper, we present a novel method for so-called metric transition systems that bridges the gap between verification and simulation, enabling system verification using a finite

An optimal on-line algorithm for metrical task systems

by Allan Borodin, Nathan Linial, Michael E. Saks - JOURNAL OF THE ACM , 1992
"... In practice, almost all dynamic systems require decisions to be made on-line, without full knowledge of their future impact on the system. A general model for the processing of sequences of tasks is introduced, and a general on-line decision algorithm is developed. It is shown that, for an importan ..."
Abstract - Cited by 209 (8 self) - Add to MetaCart
In practice, almost all dynamic systems require decisions to be made on-line, without full knowledge of their future impact on the system. A general model for the processing of sequences of tasks is introduced, and a general on-line decision algorithm is developed. It is shown that

Approximation metrics for discrete and continuous systems

by Antoine Girard, George J. Pappas - IEEE Transactions on Automatic Control , 2005
"... Established system relationships for discrete systems, such as language inclusion, simulation, and bisimulation, require system observations to be identical. When interacting with the physical world, modeled by continuous or hybrid systems, exact relationships are restrictive and not robust. In thi ..."
Abstract - Cited by 105 (16 self) - Add to MetaCart
. The exact algorithms require the generalization of the fixed point algorithms for computing simulation and bisimulation relations, or dually, the solution of a static game whose cost is the so-called branching distance between the systems. Approximations for the pseudo-metrics can be obtained by considering

Color- and Texture-Based Image Segmentation Using EM and Its Application to Content-Based Image Retrieval

by Serge Belongie, Chad Carson, Hayit Greenspan, Jitendra Malik , 1998
"... Retrieving images from large and varied collections using image content as a key is a challenging and important problem. In this paper we present a new image representation which provides a transformation from the raw pixel data to a small set of image regions which are coherent in color and texture ..."
Abstract - Cited by 175 (11 self) - Add to MetaCart
and texture space. This so-called “blobworld ” representation is based on segmentation using the Expectation-Maximization algorithm on combined color and texture features. The texture features we use for the segmentation arise from a new approach to texture description and scale selection. We describe a

The polyadic π-calculus: a tutorial

by Robin Milner - LOGIC AND ALGEBRA OF SPECIFICATION , 1991
"... The π-calculus is a model of concurrent computation based upon the notion of naming. It is first presented in its simplest and original form, with the help of several illustrative applications. Then it is generalized from monadic to polyadic form. Semantics is done in terms of both a reduction syste ..."
Abstract - Cited by 187 (1 self) - Add to MetaCart
system and a version of labelled transitions called commitment; the known algebraic axiomatization of strong bisimilarity isgiven in the new setting, and so also is a characterization in modal logic. Some theorems about the replication operator are proved. Justification for the polyadic form is provided

A generalized hidden markov model for the recognition of human genes

by David Kulp, David Haussler, Martin G. Reese, Frank H. Eeckman - in DNA. In: Proc. Int. Conf. Intell , 1996
"... We present a statistical model of genes in DNA. A Generalized Hidden Markov Model (GtlMM) provides the framework for describing the grasnmar of a legal parse of a DNA sequence (Stormo & Haussler 1994). Probabilities are assigned to transitions between states in tile GItMM and to the generation o ..."
Abstract - Cited by 182 (15 self) - Add to MetaCart
We present a statistical model of genes in DNA. A Generalized Hidden Markov Model (GtlMM) provides the framework for describing the grasnmar of a legal parse of a DNA sequence (Stormo & Haussler 1994). Probabilities are assigned to transitions between states in tile GItMM and to the generation

Metrics for Labelled Markov Systems

by Josée Desharnais, Radha Jagadeesan, Vineet Gupta, Prakash Panangaden , 2001
"... The notion of process equivalence of probabilistic processes is sensitive to the exact probabilities of transitions. Thus, a slight change in the transition probabilities will result in two equivalent processes being deemed no longer equivalent. This instability is due to the quantitative nature of ..."
Abstract - Cited by 50 (10 self) - Add to MetaCart
The notion of process equivalence of probabilistic processes is sensitive to the exact probabilities of transitions. Thus, a slight change in the transition probabilities will result in two equivalent processes being deemed no longer equivalent. This instability is due to the quantitative nature

Metrics for Action-labelled Quantitative Transition Systems

by Yuxin Deng, Tom Chothia, Catuscia Palamidessi, Jun Pang , 2005
"... This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural extension of bisimulation from non-quantitative systems to quantitative ones. We then prove that any single state-metric ..."
Abstract - Cited by 25 (9 self) - Add to MetaCart
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural extension of bisimulation from non-quantitative systems to quantitative ones. We then prove that any single state-metric

Linear and Branching Metrics for Quantitative Transition Systems

by Luca De Alfaro, Marco Faella, Mariëlle Stoelinga - In Proceedings of the 31st International Colloquium on Automata, Languages and Programming , 2004
"... We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as real values in the interval [0; 1]. Trace inclusion and equivalence give rise to asymmetrical and ..."
Abstract - Cited by 27 (2 self) - Add to MetaCart
that, while trace inclusion (resp. equivalence) coincides with simulation (resp. bisimulation) for deterministic boolean transition systems, linear and branching distances do not coincide for deterministic quantitative transition systems. Finally, we provide algorithms for computing the distances

Generalizing Finiteness Conditions of Labelled Transition Systems

by F. Van Breugel, Franck Van Breugel , 1993
"... A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to g ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible
Results 1 - 10 of 2,020