LTL Parameter Synthesis of Parametric Timed Automata

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis problem could be solved using an explicit enumeration of all possible parameter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL model checking of timed automata. To justify the usefulness of our approach, we provide experimental evaluation and compare our method with explicit enumeration technique.Comment: 23 pages, extended versio

Metabolic Tumor Imaging with Rapidly Signal-Enhanced 1-C-13-Pyruvate-d(3)

The metabolism of malignant cells differs significantly from that of healthy cells and thus, it is possible to perform metabolic imaging to reveal not only the exact location of a tumor, but also intratumoral areas of high metabolic activity. Herein, we demonstrate the feasibility of metabolic tumor imaging using signal-enhanced 1-13C-pyruvate-d3, which is rapidly enhanced via para-hydrogen, and thus, the signal is amplified by several orders of magnitudes in less than a minute. Using as a model, human melanoma xenografts injected with signal-enhanced 1-13C-pyruvate-d3, we show that the conversion of pyruvate into lactate can be monitored along with its kinetics, which could pave the way for rapidly detecting and monitoring changes in tumor metabolism

Parametric timed model checking for guaranteeing timed opacity

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage is the ability for an attacker to deduce internal information depending on the system execution time. We address the following problem: given a timed system, synthesize the execution times for which one cannot deduce whether the system performed some secret behavior. We solve this problem in the setting of timed automata (TAs). We first provide a general solution, and then extend the problem to parametric TAs, by synthesizing internal timings making the TA secure. We study decidability, devise algorithms, and show that our method can also apply to program analysis.Comment: This is the author (and extended) version of the manuscript of the same name published in the proceedings of ATVA 2019. This work is partially supported by the ANR national research program PACS (ANR-14-CE28-0002), the ANR-NRF research program (ProMiS) and by ERATO HASUO Metamathematics for Systems Design Project (No. JPMJER1603), JS

Probabilistic Reachability for Parametric Markov Models

Abstract. Given a parametric Markov model, we consider the problem of computing the formula expressing the probability of reaching a given set of states. To attack this principal problem, Daws has suggested to first convert the Markov chain into a finite automaton, from which a regular expression is computed. Afterwards, this expression is evaluated to a closed form expression representing the reachability probability. This paper investigates how this idea can be turned into an effective procedure. It turns out that the bottleneck lies in an exponential growth of the regular expression relative to the number of states. We therefore proceed differently, by tightly intertwining the regular expression computation with its evaluation. This allows us to arrive at an effective method that avoids the exponential blow up in most practical cases. We give a detailed account of the approach, also extending to parametric models with rewards and with non-determinism. Experimental evidence is provided, illustrating that our implementation provides meaningful insights on non-trivial models.

Bounded Model Checking for Parametric Timed Automata

Abstract. The paper shows how bounded model checking can be ap-plied to parameter synthesis for parametric timed automata with con-tinuous time. While it is known that the general problem is undecidable even for reachability, we show how to synthesize a part of the set of all the parameter valuations under which the given property holds in a model. The results form a complete theory which can be easily applied to parametric verification of a wide range of temporal formulae – we present such an implementation for the existential part of CTL −X. 1 Introduction and related work The growing abundance of complex systems in real world, and their presence in critical areas fuels the research in formal specification and analysis. One of the established methods in systems verification is model checking, where the system is abstracted into the algebraic model (e.g. various versions of Kripke structures

Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems

International audienceThis article aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [8, 9]. The paper gives comprehensive definitions of timed automata, priced (or weighted) timed automata, and timed games and highlights a number of results on associated decision problems related to model checking, equivalence checking, optimal scheduling, the existence of winning strategies, and then statistical model checking

Numerical and experimental studies of shallow cone penetration in clay

The fall-cone test is widely used in geotechnical practice to obtain rapid estimates of the undrained shear strength of cohesive soil, and as an index test to determine the liquid limit. This thesis is concerned with numerical modelling of the penetration of solids by conical indenters, and with interpretation of the numerical results in the context of the fall-cone test. Experimental studies of shallow cone penetration in clay are also reported, with the aim of verifying the numerical predictions. The practical significance of the results, in terms of the interpretation of fall-cone test results, is assessed. Results are reported from finite element analyses with the commercial codes ELFEN and Abaqus, in which an explicit dynamic approach was adopted for analysis of continuous cone indentation. Quasi-static analyses using an elastoplastic Tresca material model are used to obtain bearing capacity factors for shallow cone penetration, taking account of the material displaced, for various cone apex angles and adhesion factors. Further analyses are reported in which a simple extension of the Tresca material model, implemented as a user-defined material subroutine for Abaqus, is used to simulate viscous rate effects (known to be important in cohesive soils). Some analyses with the rate-dependent model are displacement-controlled, while others model the effect of rate-dependence on the dynamics of freefall cone indentation tests. Laboratory measurements of the forces required to indent clay samples in the laboratory are reported. Results from displacement-controlled tests with imposed step-changes in cone speed, and from freefall tests, confirm that the numerical rate-dependent strength model represents the observed behaviour well. Some results from experiments to observe plastic flow around conical indenters are also presented. Finally, additional numerical analyses are presented in which a critical state model of clay plasticity is used to study the variation of effective stress, strain and pore pressure around cones in indentation tests at various speeds