{"title":"Consistency for Parametric Interval Markov Chains","authors":"Benoît Delahaye","doi":"10.4230/OASIcs.SynCoP.2015.17","DOIUrl":"https://doi.org/10.4230/OASIcs.SynCoP.2015.17","url":null,"abstract":"Interval Markov Chains (IMCs) are the base of a classic probabilistic specification theory by Larsen and Jonsson in 1991. They are also a popular abstraction for probabilistic systems. In this paper we introduce and study an extension of Interval Markov Chains with parametric intervals. In particular, we investigate the consistency problem for such models and propose an efficient solution for the subclass of parametric IMCs with local parameters only. We also show that this problem is still decidable for parametric IMCs with global parameters, although more complex in this case.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127786455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Olivier Mullier
{"title":"Tuning PI controller in non-linear uncertain closed-loop systems with interval analysis","authors":"Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Olivier Mullier","doi":"10.4230/OASIcs.SynCoP.2015.91","DOIUrl":"https://doi.org/10.4230/OASIcs.SynCoP.2015.91","url":null,"abstract":"The tuning of a PI controller is usually done through simulation, except for few classes of problems, e.g., linear systems. With a new approach for validated integration allowing us to simulate \u0000dynamical systems with uncertain parameters, we are able to design guaranteed PI controllers. In practical, we propose a new method to identify the parameters of a PI controller for non-linear plants with bounded uncertain parameters using tools from interval analysis and validated simulation. This work relies on interval computation and guaranteed numerical integration of ordinary differential equations based on Runge-Kutta methods. Our method is applied to the \u0000well-known cruise-control problem, under a simplified linear version and with the aerodynamic force taken into account leading to a non-linear formulation.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131898421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Coënt, F. Vuyst, C. Rey, L. Chamoin, L. Fribourg
{"title":"Guaranteed control of switched control systems using model order reduction and state-space bisection","authors":"A. Coënt, F. Vuyst, C. Rey, L. Chamoin, L. Fribourg","doi":"10.4230/OASIcs.SynCoP.2015.33","DOIUrl":"https://doi.org/10.4230/OASIcs.SynCoP.2015.33","url":null,"abstract":"This paper considers discrete-time linear systems controlled \u0000by a quantized law, i.e., a piecewise constant time function taking \u0000a finite set of values. We show how to generate the control by, \u0000first, applying model reduction to the original system, then using a \"state-space bisection\" method for synthesizing a control at the reduced-order level, and finally computing an upper bound to the \u0000deviations between the controlled output trajectories of the reduced-order model and those of the original model. The effectiveness of our approach is illustrated on several examples of the literature.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130644953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Worst-case Throughput Analysis for Parametric Rate and Parametric Actor Execution Time Scenario-Aware Dataflow Graphs","authors":"É. André, Goran Frehse","doi":"10.4204/EPTCS.145.7","DOIUrl":"https://doi.org/10.4204/EPTCS.145.7","url":null,"abstract":"´Scenario-aware dataflow (SADF) is a prominent tool for model ing and analysis of dynamic embedded dataflow applications. In SADF the application is rep resented as a finite collection of synchronous dataflow (SDF) graphs, each of which represents one possible application behaviour or scenario. A finite state machine (FSM) specifies the possible orders of scenario occurrences. The SADF model renders the tightest possible performance guarantees, but is limited by its finiteness. This means that from a practical point of view, it can only handle dynamic dataflow applications that are characterized by a reasonably sized set of possible behaviours or scenarios. In this paper we remove this limitation for a class of SADF graphs by means of SADF model parametrization in terms of graph port rates and actor execution times. First , we formally define the semantics of the model relevant for throughput analysis based on (max,+) linear system theory and (max,+) automata. Second, by generalizing some of the existing results, we give the algorithms for worst-case throughput analysis of parametric rate and parametric actor execution time acyclic SADF graphs with a fully connected, possibly infinite state transition syste m. Third, we demonstrate our approach on a few realistic applications from digital signal processin g (DSP) domain mapped onto an embedded multi-processor architecture.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125223554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Probabilistic Bisimulations for PCTL Model Checking of Interval MDPs (extended version)","authors":"V. Hashemi, Hassan Hatefi, J. Krcál","doi":"10.4204/EPTCS.145.4","DOIUrl":"https://doi.org/10.4204/EPTCS.145.4","url":null,"abstract":"Verification of PCTL properties of MDPs with convex uncertainties has been investigated recently by Puggelli et al. However, model checking algorithms typically suffer from state space explosion. In this paper, we address probabilistic bisimulation to reduce the size of such an MDPs while preserving PCTL properties it satisfies. We discuss different interpretations of uncertainty in the models which are studied in the literature and that result in two different definitions of bisimulations. We give algorithms to compute the quotients of these bisimulations in time polynomial in the size of the model and exponential in the uncertain branching. Finally, we show by a case study that large models in practice can have small branching and that a substantial state space reduction can be achieved by our approach.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117302611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable","authors":"Karin Quaas","doi":"10.4204/EPTCS.145.3","DOIUrl":"https://doi.org/10.4204/EPTCS.145.3","url":null,"abstract":"Parametric timed automata extend timed automata (Alur and Dill, 1991) in that they allow the specification of parametric bounds on the clock values. Since their introduction in 1993 by Alur, Henzinger, and Vardi, it is known that the emptiness problem for parametric timed automata with one clock is decidable, whereas it is undecidable if the automaton uses three or more parametric clocks. The problem is open for parametric timed automata with two parametric clocks. Metric temporal logic, MTL for short, is a widely used specification language for real-time systems. MTL-model checking of timed automata is decidable, no matter how many clocks are used in the timed automaton. In this paper, we prove that MTL-model checking for parametric timed automata is undecidable, even if the automaton uses only one clock and one parameter and is deterministic.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126365953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Toward Parametric Timed Interfaces for Real-Time Components","authors":"Youcheng Sun, G. Lipari, É. André, L. Fribourg","doi":"10.4204/EPTCS.145.6","DOIUrl":"https://doi.org/10.4204/EPTCS.145.6","url":null,"abstract":"We propose here a framework to model real-time components consisting of concurrent real-time tasks running on a single processor, using parametric timed automata. Our framework is generic and modular, so as to be easily adapted to different schedulers and more complex task models. We first perform a parametric schedulability analysis of the components using the inverse method. We show that the method unfortunately does not provide satisfactory results when the task periods are consid- ered as parameters. After identifying and explaining the problem, we present a solution adapting the model by making use of the worst-case scenario in schedulability analysis. We show that the analysis with the inverse method always converges on the modified model when the system load is strictly less than 100%. Finally, we show how to use our parametric analysis for the generation of timed interfaces in compositional system design.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117314374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Schivo, J. Scholma, M. Karperien, J. Post, J. Pol, R. Langerak
{"title":"Setting Parameters for Biological Models With ANIMO","authors":"S. Schivo, J. Scholma, M. Karperien, J. Post, J. Pol, R. Langerak","doi":"10.4204/EPTCS.145.5","DOIUrl":"https://doi.org/10.4204/EPTCS.145.5","url":null,"abstract":"ANIMO (Analysis of Networks with Interactive MOdeling) is a software for modeling biological networks, such as e.g. signaling, metabolic or gene networks. An ANIMO model is essentially the sum of a network topology and a number of interaction parameters. The topology describes the interactions between biological entities in form of a graph, while the parameters determine the speed of occurrence of such interactions. When a mismatch is observed between the behavior of an ANIMO model and experimental data, we want to update the model so that it explains the new data. In general, the topology of a model can be expanded with new (known or hypothetical) nodes, and enables it to match experimental data. However, the unrestrained addition of new parts to a model causes two problems: models can become too complex too fast, to the point of being intractable, and too many parts marked as \"hypothetical\" or \"not known\" make a model unrealistic. Even if changing the topology is normally the easier task, these problems push us to try a better parameter fit as a first step, and resort to modifying the model topology only as a last resource. In this paper we show the support added in ANIMO to ease the task of expanding the knowledge on biological networks, concentrating in particular on the parameter settings.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116607212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Game-based Synthesis of Distributed Controllers for Sampled Switched Systems","authors":"L. Fribourg, U. Kühne, N. Markey","doi":"10.4230/OASIcs.SynCoP.2015.48","DOIUrl":"https://doi.org/10.4230/OASIcs.SynCoP.2015.48","url":null,"abstract":"Switched systems are a convenient formalism for modeling physical processes interacting with a digital controller. Unfortunately, the formalism does not capture the distributed nature encountered e.g. in cyber-physical systems, which are organized as networks of elements interacting with local controllers. Most current methods for control synthesis can only produce a centralized controller, which is assumed to have complete knowledge of all the component states and can interact with all of them. In this paper, we consider a centralized-controller synthesis technique based on state-space decomposition, and use a game-based approach to extend it to a distributed framework.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115633766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Discrete Parameters in Petri Nets (Informal Presentation)","authors":"Nicolas David, C. Jard, D. Lime, O. Roux","doi":"10.4230/OASIcs.SynCoP.2015.103","DOIUrl":"https://doi.org/10.4230/OASIcs.SynCoP.2015.103","url":null,"abstract":"With the aim of significantly increasing the modeling capability of Petri nets, we suggest models that involve parameters to represent the weights of arcs, or the number of tokens in places. We call these Petri nets parameterised nets or PPNs. Indeed, the introduction of parameters in models aims to improve genericity. \u0000It therefore allows the designer to leave unspecified aspects, \u0000such as those related to the modeling of the environment. This increase in modeling power usually results in greater complexity in the analysis and verification of the model. Here, we consider the property of coverability of markings. Two general questions arise: \"Is there a parameter value for which the property is satisfied?\" and \"Does the property hold for all possible values of the parameters?\". We first study the decidability of these issues, \u0000which we show to be undecidable in the general case. Therefore, we also define subclasses of parameterised networks, based on restriction of the use of parameters, depending on whether the parameters are used on places, input or output arcs of transitions or combinations of them. Those subclasses have therefore a dual interest. From a modeling point of view, restrict the use of parameters to tokens, outputs or inputs can be seen as respectively processes or synchronisation of a given number of processes. From a theoretical point of view, it is interesting to introduce those subclasses of PPN in a concern of completeness of the study. We study the relations between those subclasses and prove that, for some subclasses, certain problems become decidable, making these subclasses more usable in practice.","PeriodicalId":415478,"journal":{"name":"International Workshop on Synthesis of Complex Parameters","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115803870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}