@article{2056,
  abstract     = {We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a variant of weak lumpability, which also characterizes that the measure over the original process can be recovered from that of the aggregated one. We show how the applicability of de-aggregation depends on the initial distribution. The application section is devoted to illustrate how the developed theory aids in reducing CTMC models of biochemical systems particularly in connection to protein-protein interactions. We assume that the model is written by a biologist in form of site-graph-rewrite rules. Site-graph-rewrite rules compactly express that, often, only a local context of a protein (instead of a full molecular species) needs to be in a certain configuration in order to trigger a reaction event. This observation leads to suitable aggregate Markov chains with smaller state spaces, thereby providing sufficient reduction in computational complexity. This is further exemplified in two case studies: simple unbounded polymerization and early EGFR/insulin crosstalk.},
  author       = {Ganguly, Arnab and Petrov, Tatjana and Koeppl, Heinz},
  journal      = {Journal of Mathematical Biology},
  number       = {3},
  pages        = {767 -- 797},
  publisher    = {Springer},
  title        = {{Markov chain aggregation and its applications to combinatorial reaction networks}},
  doi          = {10.1007/s00285-013-0738-7},
  volume       = {69},
  year         = {2014},
}

@inproceedings{2057,
  abstract     = {In the past few years, a lot of attention has been devoted to multimedia indexing by fusing multimodal informations. Two kinds of fusion schemes are generally considered: The early fusion and the late fusion. We focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle this problem, we investigate a recent and elegant well-founded quadratic program named MinCq coming from the machine learning PAC-Bayesian theory. MinCq looks for the weighted combination, over a set of real-valued functions seen as voters, leading to the lowest misclassification rate, while maximizing the voters’ diversity. We propose an extension of MinCq tailored to multimedia indexing. Our method is based on an order-preserving pairwise loss adapted to ranking that allows us to improve Mean Averaged Precision measure while taking into account the diversity of the voters that we want to fuse. We provide evidence that this method is naturally adapted to late fusion procedures and confirm the good behavior of our approach on the challenging PASCAL VOC’07 benchmark.},
  author       = {Morvant, Emilie and Habrard, Amaury and Ayache, Stéphane},
  booktitle    = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  location     = {Joensuu, Finland},
  pages        = {153 -- 162},
  publisher    = {Springer},
  title        = {{Majority vote of diverse classifiers for late fusion}},
  doi          = {10.1007/978-3-662-44415-3_16},
  volume       = {8621},
  year         = {2014},
}

@inproceedings{2058,
  abstract     = {We present a method for smoothly blending between existing liquid animations. We introduce a semi-automatic method for matching two existing liquid animations, which we use to create new fluid motion that plausibly interpolates the input. Our contributions include a new space-time non-rigid iterative closest point algorithm that incorporates user guidance, a subsampling technique for efficient registration of meshes with millions of vertices, and a fast surface extraction algorithm that produces 3D triangle meshes from a 4D space-time surface. Our technique can be used to instantly create hundreds of new simulations, or to interactively explore complex parameter spaces. Our method is guaranteed to produce output that does not deviate from the input animations, and it generalizes to multiple dimensions. Because our method runs at interactive rates after the initial precomputation step, it has potential applications in games and training simulations.},
  author       = {Raveendran, Karthik and Wojtan, Christopher J and Thuerey, Nils and Türk, Greg},
  booktitle    = {ACM Transactions on Graphics},
  location     = {Vancouver, Canada},
  number       = {4},
  publisher    = {ACM},
  title        = {{Blending liquids}},
  doi          = {10.1145/2601097.2601126},
  volume       = {33},
  year         = {2014},
}

@article{2059,
  abstract     = {Plant embryogenesis is regulated by differential distribution of the plant hormone auxin. However, the cells establishing these gradients during microspore embryogenesis remain to be identified. For the first time, we describe, using the DR5 or DR5rev reporter gene systems, the GFP- and GUS-based auxin biosensors to monitor auxin during Brassica napus androgenesis at cellular resolution in the initial stages. Our study provides evidence that the distribution of auxin changes during embryo development and depends on the temperature-inducible in vitro culture conditions. For this, microspores (mcs) were induced to embryogenesis by heat treatment and then subjected to genetic modification via Agrobacterium tumefaciens. The duration of high temperature treatment had a significant influence on auxin distribution in isolated and in vitro-cultured microspores and on microspore-derived embryo development. In the “mild” heat-treated (1 day at 32 °C) mcs, auxin localized in a polar way already at the uni-nucleate microspore, which was critical for the initiation of embryos with suspensor-like structure. Assuming a mean mcs radius of 20 μm, endogenous auxin content in a single cell corresponded to concentration of 1.01 μM. In mcs subjected to a prolonged heat (5 days at 32 °C), although auxin concentration increased dozen times, auxin polarization was set up at a few-celled pro-embryos without suspensor. Those embryos were enclosed in the outer wall called the exine. The exine rupture was accompanied by the auxin gradient polarization. Relative quantitative estimation of auxin, using time-lapse imaging, revealed that primordia possess up to 1.3-fold higher amounts than those found in the root apices of transgenic MDEs in the presence of exogenous auxin. Our results show, for the first time, which concentration of endogenous auxin coincides with the first cell division and how the high temperature interplays with auxin, by what affects delay early establishing microspore polarity. Moreover, we present how the local auxin accumulation demonstrates the apical–basal axis formation of the androgenic embryo and directs the axiality of the adult haploid plant.},
  author       = {Dubas, Ewa and Moravčíková, Jana and Libantová, Jana and Matušíková, Ildikó and Benková, Eva and Zur, Iwona and Krzewska, Monika},
  journal      = {Protoplasma},
  number       = {5},
  pages        = {1077 -- 1087},
  publisher    = {Springer},
  title        = {{The influence of heat stress on auxin distribution in transgenic B napus microspores and microspore derived embryos}},
  doi          = {10.1007/s00709-014-0616-1},
  volume       = {251},
  year         = {2014},
}

@article{2062,
  abstract     = {The success story of fast-spiking, parvalbumin-positive (PV+) GABAergic interneurons (GABA, γ-aminobutyric acid) in the mammalian central nervous system is noteworthy. In 1995, the properties of these interneurons were completely unknown. Twenty years later, thanks to the massive use of subcellular patch-clamp techniques, simultaneous multiple-cell recording, optogenetics, in vivo measurements, and computational approaches, our knowledge about PV+ interneurons became more extensive than for several types of pyramidal neurons. These findings have implications beyond the “small world” of basic research on GABAergic cells. For example, the results provide a first proof of principle that neuroscientists might be able to close the gaps between the molecular, cellular, network, and behavioral levels, representing one of the main challenges at the present time. Furthermore, the results may form the basis for PV+ interneurons as therapeutic targets for brain disease in the future. However, much needs to be learned about the basic function of these interneurons before clinical neuroscientists will be able to use PV+ interneurons for therapeutic purposes.},
  author       = {Hu, Hua and Gan, Jian and Jonas, Peter M},
  journal      = {Science},
  number       = {6196},
  publisher    = {American Association for the Advancement of Science},
  title        = {{Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function}},
  doi          = {10.1126/science.1255263},
  volume       = {345},
  year         = {2014},
}

@article{2064,
  abstract     = {We examined the synaptic structure, quantity, and distribution of α-amino-3-hydroxy-5-methylisoxazole-4-propionic acid (AMPA)- and N-methyl-D-aspartate (NMDA)-type glutamate receptors (AMPARs and NMDARs, respectively) in rat cochlear nuclei by a highly sensitive freeze-fracture replica labeling technique. Four excitatory synapses formed by two distinct inputs, auditory nerve (AN) and parallel fibers (PF), on different cell types were analyzed. These excitatory synapse types included AN synapses on bushy cells (AN-BC synapses) and fusiform cells (AN-FC synapses) and PF synapses on FC (PF-FC synapses) and cartwheel cell spines (PF-CwC synapses). Immunogold labeling revealed differences in synaptic structure as well as AMPAR and NMDAR number and/or density in both AN and PF synapses, indicating a target-dependent organization. The immunogold receptor labeling also identified differences in the synaptic organization of FCs based on AN or PF connections, indicating an input-dependent organization in FCs. Among the four excitatory synapse types, the AN-BC synapses were the smallest and had the most densely packed intramembrane particles (IMPs), whereas the PF-CwC synapses were the largest and had sparsely packed IMPs. All four synapse types showed positive correlations between the IMP-cluster area and the AMPAR number, indicating a common intrasynapse-type relationship for glutamatergic synapses. Immunogold particles for AMPARs were distributed over the entire area of individual AN synapses; PF synapses often showed synaptic areas devoid of labeling. The gold-labeling for NMDARs occurred in a mosaic fashion, with less positive correlations between the IMP-cluster area and the NMDAR number. Our observations reveal target- and input-dependent features in the structure, number, and organization of AMPARs and NMDARs in AN and PF synapses.},
  author       = {Rubio, Maía and Fukazawa, Yugo and Kamasawa, Naomi and Clarkson, Cheryl and Molnár, Elek and Shigemoto, Ryuichi},
  journal      = {Journal of Comparative Neurology},
  number       = {18},
  pages        = {4023 -- 4042},
  publisher    = {Wiley-Blackwell},
  title        = {{Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus}},
  doi          = {10.1002/cne.23654},
  volume       = {522},
  year         = {2014},
}

@article{13402,
  abstract     = {Nanoporous frameworks are polymeric materials built from rigid molecules, which give rise to their nanoporous structures with applications in gas sorption and storage, catalysis and others. Conceptually new applications could emerge, should these beneficial properties be manipulated by external stimuli in a reversible manner. One approach to render nanoporous frameworks responsive to external signals would be to immobilize molecular switches within their nanopores. Although the majority of molecular switches require conformational freedom to isomerize, and switching in the solid state is prohibited, the nanopores may provide enough room for the switches to efficiently isomerize. Here we describe two families of nanoporous materials incorporating the spiropyran molecular switch. These materials exhibit a variety of interesting properties, including reversible photochromism and acidochromism under solvent-free conditions, light-controlled capture and release of metal ions, as well reversible chromism induced by solvation/desolvation.},
  author       = {Kundu, Pintu K. and Olsen, Gregory L. and Kiss, Vladimir and Klajn, Rafal},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  keywords     = {General Physics and Astronomy, General Biochemistry, Genetics and Molecular Biology, General Chemistry, Multidisciplinary},
  publisher    = {Springer Nature},
  title        = {{Nanoporous frameworks exhibiting multiple stimuli responsiveness}},
  doi          = {10.1038/ncomms4588},
  volume       = {5},
  year         = {2014},
}

@article{13404,
  abstract     = {In the past few years, spiropyran has emerged as the molecule-of-choice for the construction of novel dynamic materials. This unique molecular switch undergoes structural isomerisation in response to a variety of orthogonal stimuli, e.g. light, temperature, metal ions, redox potential, and mechanical stress. Incorporation of this switch onto macromolecular supports or inorganic scaffolds allows for the creation of robust dynamic materials. This review discusses the synthesis, switching conditions, and use of dynamic materials in which spiropyran has been attached to the surfaces of polymers, biomacromolecules, inorganic nanoparticles, as well as solid surfaces. The resulting materials show fascinating properties whereby the state of the switch intimately affects a multitude of useful properties of the support. The utility of the spiropyran switch will undoubtedly endow these materials with far-reaching applications in the near future.},
  author       = {Klajn, Rafal},
  issn         = {1460-4744},
  journal      = {Chemical Society Reviews},
  keywords     = {General Chemistry},
  number       = {1},
  pages        = {148--184},
  publisher    = {Royal Society of Chemistry},
  title        = {{Spiropyran-based dynamic materials}},
  doi          = {10.1039/c3cs60181a},
  volume       = {43},
  year         = {2014},
}

@article{1375,
  abstract     = {We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that the algorithmic question is reducible to the problem of a logarithmic number of min-plus matrix multiplications of n×n-matrices, where n is the number of vertices of the graph. (2) Second, when the weights are nonnegative, we present the first (1+ε)-approximation algorithm for the problem and the running time of our algorithm is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε)) factor in space a cycle with approximately optimal weight can be computed within the same time bound.},
  author       = {Chatterjee, Krishnendu and Henzinger, Monika H and Krinninger, Sebastian and Loitzenbauer, Veronika and Raskin, Michael},
  journal      = {Theoretical Computer Science},
  number       = {C},
  pages        = {104 -- 116},
  publisher    = {Elsevier},
  title        = {{Approximating the minimum cycle mean}},
  doi          = {10.1016/j.tcs.2014.06.031},
  volume       = {547},
  year         = {2014},
}

@inproceedings{1392,
  abstract     = {Fault-tolerant distributed algorithms play an important role in ensuring the reliability of many software applications. In this paper we consider distributed algorithms whose computations are organized in rounds. To verify the correctness of such algorithms, we reason about (i) properties (such as invariants) of the state, (ii) the transitions controlled by the algorithm, and (iii) the communication graph. We introduce a logic that addresses these points, and contains set comprehensions with cardinality constraints, function symbols to describe the local states of each process, and a limited form of quantifier alternation to express the verification conditions. We show its use in automating the verification of consensus algorithms. In particular, we give a semi-decision procedure for the unsatisfiability problem of the logic and identify a decidable fragment. We successfully applied our framework to verify the correctness of a variety of consensus algorithms tolerant to both benign faults (message loss, process crashes) and value faults (message corruption).},
  author       = {Dragoi, Cezara and Henzinger, Thomas A and Veith, Helmut and Widder, Josef and Zufferey, Damien},
  location     = {San Diego, USA},
  pages        = {161 -- 181},
  publisher    = {Springer},
  title        = {{A logic-based framework for verifying consensus algorithms}},
  doi          = {10.1007/978-3-642-54013-4_10},
  volume       = {8318},
  year         = {2014},
}

@inproceedings{1393,
  abstract     = {Probabilistic programs are usual functional or imperative programs with two added constructs: (1) the ability to draw values at random from distributions, and (2) the ability to condition values of variables in a program via observations. Models from diverse application areas such as computer vision, coding theory, cryptographic protocols, biology and reliability analysis can be written as probabilistic programs. Probabilistic inference is the problem of computing an explicit representation of the probability distribution implicitly specified by a probabilistic program. Depending on the application, the desired output from inference may vary-we may want to estimate the expected value of some function f with respect to the distribution, or the mode of the distribution, or simply a set of samples drawn from the distribution. In this paper, we describe connections this research area called \Probabilistic Programming" has with programming languages and software engineering, and this includes language design, and the static and dynamic analysis of programs. We survey current state of the art and speculate on promising directions for future research.},
  author       = {Gordon, Andrew and Henzinger, Thomas A and Nori, Aditya and Rajamani, Sriram},
  booktitle    = {Proceedings of the on Future of Software Engineering},
  location     = {Hyderabad, India},
  pages        = {167 -- 181},
  publisher    = {ACM},
  title        = {{Probabilistic programming}},
  doi          = {10.1145/2593882.2593900},
  year         = {2014},
}

@article{14020,
  abstract     = {We report the observation of macroscopic field-free orientation, i.e., more than 73% of CO molecules pointing in the same direction. This is achieved through an all-optical scheme operating at high particle densities (>10(17)  cm(-3)) that combines one-color (ω) and two-color (ω+2ω) nonresonant femtosecond laser pulses. We show that the achieved orientation solely relies on the hyperpolarizability interaction as opposed to an ionization-depletion mechanism, thus, opening a wide range of applications. The achieved strong orientation enables us to reveal the molecular-frame anisotropies of the photorecombination amplitudes and phases caused by a shape resonance. The resonance appears as a local maximum in the even-harmonic emission around 28 eV. In contrast, the odd-harmonic emission is suppressed in this spectral region through the combined effects of an asymmetric photorecombination phase and a subcycle Stark effect, generic for polar molecules, that we experimentally identify.},
  author       = {Kraus, P. M. and Baykusheva, Denitsa Rangelova and Wörner, H. J.},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  keywords     = {General Physics and Astronomy},
  number       = {2},
  publisher    = {American Physical Society},
  title        = {{Two-pulse field-free orientation reveals anisotropy of molecular shape resonance}},
  doi          = {10.1103/physrevlett.113.023001},
  volume       = {113},
  year         = {2014},
}

@article{14021,
  abstract     = {We present the detailed analysis of a new two-pulse orientation scheme that achieves macroscopic field-free orientation at the high particle densities required for attosecond and high-harmonic spectroscopies (Kraus et al 2013 arXiv:1311.3923). Carbon monoxide molecules are oriented by combining one-colour and delayed two-colour non-resonant femtosecond laser pulses. High-harmonic generation is used to probe the oriented wave-packet dynamics and reveals that a very high degree of orientation (Nup/Ntotal = 0.73–0.82) is achieved. We further extend this approach to orienting carbonyl sulphide molecules. We show that the present two-pulse scheme selectively enhances orientation created by the hyperpolarizability interaction whereas the ionization-depletion mechanism plays no role. We further control and optimize orientation through the delay between the one- and two-colour pump pulses. Finally, we demonstrate a complementary encoding of electronic-structure features, such as shape resonances, in the even- and odd-harmonic spectrum. The achieved progress makes two-pulse field-free orientation an attractive tool for a broad class of time-resolved measurements.},
  author       = {Kraus, P M and Baykusheva, Denitsa Rangelova and Wörner, H J},
  issn         = {1361-6455},
  journal      = {Journal of Physics B: Atomic, Molecular and Optical Physics},
  keywords     = {Condensed Matter Physics, Atomic and Molecular Physics, and Optics},
  number       = {12},
  publisher    = {IOP Publishing},
  title        = {{Two-pulse orientation dynamics and high-harmonic spectroscopy of strongly-oriented molecules}},
  doi          = {10.1088/0953-4075/47/12/124030},
  volume       = {47},
  year         = {2014},
}

@article{14301,
  abstract     = {DNA has become a prime material for assembling complex three-dimensional objects that promise utility in various areas of application. However, achieving user-defined goals with DNA objects has been hampered by the difficulty to prepare them at arbitrary concentrations and in user-defined solution conditions. Here, we describe a method that solves this problem. The method is based on poly(ethylene glycol)-induced depletion of species with high molecular weight. We demonstrate that our method is applicable to a wide spectrum of DNA shapes and that it achieves excellent recovery yields of target objects up to 97 %, while providing efficient separation from non-integrated DNA strands. DNA objects may be prepared at concentrations up to the limit of solubility, including the possibility for bringing DNA objects into a solid phase. Due to the fidelity and simplicity of our method we anticipate that it will help to catalyze the development of new types of applications that use self-assembled DNA objects.},
  author       = {Stahl, Evi and Martin, Thomas and Praetorius, Florian M and Dietz, Hendrik},
  issn         = {1521-3773},
  journal      = {Angewandte Chemie International Edition},
  number       = {47},
  pages        = {12949--12954},
  publisher    = {Wiley},
  title        = {{Facile and scalable preparation of pure and dense DNA origami solutions}},
  doi          = {10.1002/ange.201405991},
  volume       = {126},
  year         = {2014},
}

@misc{5411,
  abstract     = {Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing.
In this paper, we study compositional properties of the IOCO-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the IOCO conformance relation, the resulting methodology can be applied to a broader class of systems.},
  author       = {Daca, Przemyslaw and Henzinger, Thomas A and Krenn, Willibald and Nickovic, Dejan},
  issn         = {2664-1690},
  pages        = {20},
  publisher    = {IST Austria},
  title        = {{Compositional specifications for IOCO testing}},
  doi          = {10.15479/AT:IST-2014-148-v2-1},
  year         = {2014},
}

@misc{5412,
  abstract     = {We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.
We introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.
We present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. },
  author       = {Chatterjee, Krishnendu and Daca, Przemyslaw and Chmelik, Martin},
  issn         = {2664-1690},
  pages        = {31},
  publisher    = {IST Austria},
  title        = {{CEGAR for qualitative analysis of probabilistic systems}},
  doi          = {10.15479/AT:IST-2014-153-v1-1},
  year         = {2014},
}

@misc{5413,
  abstract     = {We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.
We introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.
We present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. },
  author       = {Chatterjee, Krishnendu and Daca, Przemyslaw and Chmelik, Martin},
  issn         = {2664-1690},
  pages        = {33},
  publisher    = {IST Austria},
  title        = {{CEGAR for qualitative analysis of probabilistic systems}},
  doi          = {10.15479/AT:IST-2014-153-v2-2},
  year         = {2014},
}

@misc{5414,
  abstract     = {We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.
We introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.
We present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. 
We have implemented our algorithms and show that the compositional analysis leads to significant improvements. },
  author       = {Chatterjee, Krishnendu and Daca, Przemyslaw and Chmelik, Martin},
  issn         = {2664-1690},
  pages        = {33},
  publisher    = {IST Austria},
  title        = {{CEGAR for qualitative analysis of probabilistic systems}},
  doi          = {10.15479/AT:IST-2014-153-v3-1},
  year         = {2014},
}

@misc{5415,
  abstract     = {Recently there has been a significant effort to add quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, several basic system properties such as average response time cannot be expressed with weighted automata. In this work, we introduce nested weighted automata as a new formalism for expressing important quantitative properties such as average response time. We establish an almost complete decidability picture for the basic decision problems for nested weighted automata, and illustrate its applicability in several domains.  },
  author       = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan},
  issn         = {2664-1690},
  pages        = {27},
  publisher    = {IST Austria},
  title        = {{Nested weighted automata}},
  doi          = {10.15479/AT:IST-2014-170-v1-1},
  year         = {2014},
}

@misc{5416,
  abstract     = {As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.The contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem.},
  author       = {Henzinger, Thomas A and Otop, Jan},
  issn         = {2664-1690},
  pages        = {22},
  publisher    = {IST Austria},
  title        = {{Model measuring for hybrid systems}},
  doi          = {10.15479/AT:IST-2014-171-v1-1},
  year         = {2014},
}