{"title":"Discreteness, hybrid automata, and biology","authors":"A. Casagrande, C. Piazza, A. Policriti","doi":"10.1109/WODES.2008.4605960","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605960","url":null,"abstract":"Most of the observable natural phenomena exhibit a mixed discrete-continuous behavior characterized by laws changing according to a phase cycle. Such behaviors can be modeled in a very natural way by a class of automata called hybrid automata. In this class the evolution of measurable quantities, such as concentrations, is represented according to both dynamical system evolutions - on dense domains - and rules phases through a discrete transition structure. Once the real systems are modeled in such a framework, one may want to analyze them by applying automatic techniques, such as model checking or abstract interpretation. Unfortunately, the interleaving of dense and discrete evolutions soon leads to undecidability results on hybrid automata. This paper addresses questions regarding the decidability of reachability problem for hybrid automata (i.e., ldquocan the systems reach a state a from a state b?rdquo) by proposing a more ldquonaturerdquo-oriented semantics. In particular, after observing that dense domains are abstractions of real world, we suggest that, for any biological system, there should be a value isin such that if the distance of two objects are less than isin, we cannot distinguish them. Using the above considerations, we propose a new semantics for hybrid automata which guarantees the decidability of reachability. Moreover, we provide a biological example showing that the new semantics mimics the real world behaviors better than the ldquoclassicalrdquo one.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133860555","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":"Opacity enforcing control synthesis","authors":"Jérémy Dubreil, P. Darondeau, H. Marchand","doi":"10.1109/WODES.2008.4605918","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605918","url":null,"abstract":"Given a finite transition system and a regular predicate, we address the problem of computing a controller enforcing the opacity of the predicate against an attacker (that partially observes the system), supposedly trying to push the system to reveal the predicate. Assuming that the controller can only control a subset of the events it observes (possibly different from the ones of the attacker), we show that an optimal control always exists and provide sufficient conditions under which it is regular and effectively computable. These conditions rely on the inclusion relationships between the observable alphabets of the attacker and the controller and the controllable alphabet.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123150713","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}
Francesco Basile, Pasquale Chiacchiot, Gianmaria De Tommasi
{"title":"Sufficient conditions for diagnosability of Petri nets","authors":"Francesco Basile, Pasquale Chiacchiot, Gianmaria De Tommasi","doi":"10.1109/WODES.2008.4605974","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605974","url":null,"abstract":"Sufficient conditions for diagnosability of DES modeled as Petri net are given in this paper. In proposed framework we refer to the concept of diagnosability given by Sampath et al. for finite state automata; as far as the fault events are concerned, they are modeled as unobservable transitions. The results here presented are based on the mathematical representation of PNs, and their complexity does not depend on the initial marking of the net. Hence the proposed approach does not suffer of the state space explosion problem, as the diagnoser approach does.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123824824","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":"Decentralized modular diagnosis of concurrent discrete event systems","authors":"C. Zhou, R. Kumar, R. Sreenivas","doi":"10.1109/WODES.2008.4605977","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605977","url":null,"abstract":"The problem of decentralized modular fault diagnosis of concurrent discrete event systems, that is composed of a set of component modules, is formulated and studied. In the proposed decentralized modular framework, diagnosis is performed by the local diagnosers, located at the component sites, using their own local observations. This is to ensure the scalability of the approach with respect to the number of component modules, and we require that the local diagnosers be ldquomodularly computablerdquo, i.e., their computation should be based on the local models, and not the global models. It is also required that there are no missed-detections (every fault is detected within a bounded number of transitions) and no false-alarms (a fault detection report is issued only when a fault has occurred). We formally define the decentralized modular diagnosis problem and introduce the notion of modular diagnosability as a key property for the existence of desired decentralized modular diagnosers. We show that under this property, the complexity for constructing the local diagnosers is polynomial in the number of local modules. We present a method for testing the modular diagnosability property by reducing it to an instance of a certain codiagnosability property for which known verification techniques exist.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130646551","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}
F. Basile, P. Chiacchio, G. De Tommasi, D. Del Grosso
{"title":"Performing fault diagnosis for PNs using g-markings: A benchmark case","authors":"F. Basile, P. Chiacchio, G. De Tommasi, D. Del Grosso","doi":"10.1109/WODES.2008.4605935","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605935","url":null,"abstract":"The authors have recently presented an approach to fault diagnosis based on the online computation of the set of possible fault events required to explain the last observed event. This is efficiently achieved by using Petri nets, since their mathematical representation allows us to formulate the fault diagnosis problems in terms of mathematical programming, which is a standard tool. Then, an interpreted diagnoser is obtained. In this paper the performance of such a diagnoser are evaluated on a benchmark example.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"39 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132644109","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":"Relations between networks of standard automata and networks of I/O automata","authors":"J. Lunze","doi":"10.1109/WODES.2008.4605983","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605983","url":null,"abstract":"The paper compares networks of standard automata and networks of I/O automata with respect to their modelling power for composite discrete-event systems. It shows the similarities and the differences of both modelling philosophies and proves for the parallel composition of standard automata that an equivalent network of I/O automata exists. The constructive proof shows the specific choice of the I/O automata that makes the state transition functions of both automata networks identical. Hence, both modelling approaches share the modelling power at least for the class of discrete-event systems considered in this paper.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114481773","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}
Koen Claessen, N. Eén, M. Sheeran, Niklas Sörensson
{"title":"SAT-solving in practice","authors":"Koen Claessen, N. Eén, M. Sheeran, Niklas Sörensson","doi":"10.1109/WODES.2008.4605923","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605923","url":null,"abstract":"Satisfiability solving, the problem of deciding whether the variables of a propositional formula can be assigned in such a way that the formula evaluates to true, is one of the classic problems in computer science. It is of theoretical interest because it is the canonical NP-complete problem. It is of practical interest because modern SAT-solvers can be used to solve many important and practical problems. In this tutorial paper, we show briefly how such SAT-solvers are implemented, and point to some typical applications of them. Our aim is to provide sufficient information (much of it through the reference list) to kick-start researchers from new fields wishing to apply SAT-solvers to their problems.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774113","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":"Enhancing hybrid state Petri nets with the analysis power of stochastic hybrid processes","authors":"M. Everdij, H. Blom","doi":"10.1109/WODES.2008.4605979","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605979","url":null,"abstract":"This paper presents a power hierarchy of Petri nets and stochastic hybrid processes. At the left-hand-side of this power hierarchy are stochastic Petri net models at the bottom, and high level Petri nets at the top. At the right-hand-side of this power hierarchy are Markov chains at the bottom, and generalized hybrid state Markov processes at the top. The Petri net side of the power hierarchy makes it possible to specify a stochastic system model in a compositional way. The Markov process side of the power hierarchy exploits the available stochastic analysis tools. Between the Petri nets on the left and the Markov processes on the right are mathematical one-to-one mappings, which enable taking advantage of both the modelling power of hybrid state Petri nets and the analysis capability of stochastic hybrid Markov processes.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129057671","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":"Generalised nonblocking","authors":"R. Malik, R. Leduc","doi":"10.1109/wodes.2008.4605969","DOIUrl":"https://doi.org/10.1109/wodes.2008.4605969","url":null,"abstract":"This paper studies the nonblocking check used in supervisory control of discrete event systems and its limitations. Different examples with different liveness requirements are discussed. It is shown that the standard nonblocking check can be used to specify most requirements of interest, but that it lacks expressive power in a few cases. A generalised nonblocking check is proposed to overcome the weakness, and its relationship to standard nonblocking is explored. Results suggest that generalised nonblocking, while having the same useful properties with respect to synthesis and compositional verification, can provide for more concise problem representations in some cases.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127003001","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":"From discrete to continuous and back: Abstractions and mesoscopic phenomena in cells","authors":"Á. Halász, J.A. Agung, George J. Pappas, V. Kumar","doi":"10.1109/WODES.2008.4605958","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605958","url":null,"abstract":"We discuss the interplay between stochasticity and multistability in bio-molecular networks. The resulting cell-level stochastic behavior reflects the fundamentally discrete and random nature of the underlying molecular processes. These ideas are illustrated on the well studied example of the lac operon. We first describe the switching behavior predicted by a differential-equation based model and then show how cell-level stochastic behavior emerges. Finally we point out that the observed macroscopic behavior may not be enough to determine both the dynamic and stochastic parameters.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131676164","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}