Bounded Determinization of Timed Automata with Silent Transitions

Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees, removes all silent transitions and determinizes via disjunction of guards. The proposed algorithms are optimized to the bounded setting and thus are more efficient and can handle a larger class of timed automata than the general algorithms. The approach is implemented in a prototype tool and evaluated on several examples. To our best knowledge, this is the first implementation of this type of procedure for timed automata.Comment: 25 page

Mightyl: A compositional translation from mitl to timed automata

Metric Interval Temporal Logic (MITL) was first proposed in the early 1990s as a specification formalism for real-time systems. Apart from its appealing intuitive syntax, there are also theoretical evidences that make MITL a prime real-time counterpart of Linear Temporal Logic (LTL). Unfortunately, the tool support for MITL verification is still lacking to this day. In this paper, we propose a new construction from MITL to timed automata via very-weak one-clock alternating timed automata. Our construction subsumes the well-known construction from LTL to Büchi automata by Gastin and Oddoux and yet has the additional benefits of being compositional and integrating easily with existing tools. We implement the construction in our new tool MightyL and report on experiments using Uppaal and LTSmin as back-ends

FGF Signaling Pathway in the Developing Chick Lung: Expression and Inhibition Studies

Background: Fibroblast growth factors (FGF) are essential key players during embryonic development. Through their specific cognate receptors (FGFR) they activate intracellular cascades, finely regulated by modulators such as Sprouty. Several FGF ligands (FGF1, 2, 7, 9, 10 and 18) signaling through the four known FGFRs, have been implicated in lung morphogenesis. Although much is known about mammalian lung, so far, the avian model has not been explored for lung studies. Methodology/Principal Findings: In this study we provide the first description of fgf10, fgfr1-4 and spry2 expression patterns in early stages of chick lung development by in situ hybridization and observe that they are expressed similarly to their mammalian counterparts. Furthermore, aiming to determine a role for FGF signaling in chick lung development, in vitro FGFR inhibition studies were performed. Lung explants treated with an FGF receptor antagonist (SU5402) presented an impairment of secondary branch formation after 48 h of culture; moreover, abnormal lung growth with a cystic appearance of secondary bronchi and reduction of the mesenchymal tissue was observed. Branching and morphometric analysis of lung explants confirmed that FGFR inhibition impaired branching morphogenesis and induced a significant reduction of the mesenchyme. Conclusions/Significance: This work demonstrates that FGFRs are essential for the epithelial-mesenchymal interactions tha

Statistical Model Checking for Product Lines

International audienceWe report on the suitability of statistical model checking forthe analysis of quantitative properties of product line models by an extendedtreatment of earlier work by the authors. The type of analysis thatcan be performed includes the likelihood of specific product behaviour,the expected average cost of products (in terms of the attributes of theproducts’ features) and the probability of features to be (un)installed atruntime. The product lines must be modelled in QFLan, which extendsthe probabilistic feature-oriented language PFLan with novel quantitativeconstraints among features and on behaviour and with advancedfeature installation options. QFLan is a rich process-algebraic specifi-cation language whose operational behaviour interacts with a store ofconstraints, neatly separating product configuration from product behaviour.The resulting probabilistic configurations and probabilistic behaviourconverge in a discrete-time Markov chain semantics, enablingthe analysis of quantitative properties. Technically, a Maude implementationof QFLan, integrated with Microsoft’s SMT constraint solver Z3,is combined with the distributed statistical model checker MultiVeStA,developed by one of the authors. We illustrate the feasibility of our frameworkby applying it to a case study of a product line of bikes