6,887 research outputs found

    Identification of Stochastic Timed Discrete Event Systems with st-IPN

    Get PDF
    [EN] This paper presents amethod for the identification of stochastic timed discrete event systems, based on the analysis of the behavior of the input and output signals, arranged in a timeline. To achieve this goal stochastic timed interpreted Petri nets are defined.These nets link timed discrete event systems modelling with stochastic time modelling. The procedure starts with the observation of the input/output signals; these signals are converted into events, so that the sequence of events is the observed language. This language arrives to an identifier that builds a stochastic timed interpreted Petri net which generates the same language. The identified model is a deterministic generator of the observed language.The identification method also includes an algorithm that determines when the identification process is over.This work was supported by a Grant from the Universidad del Cauca, reference 2.3-31.2/05 2011.Muñoz-Añasco, DM.; Correcher Salvador, A.; GarcĂ­a Moreno, E.; Morant Anglada, FJ. (2014). Identification of Stochastic Timed Discrete Event Systems with st-IPN. Mathematical Problems in Engineering. 2014:1-21. https://doi.org/10.1155/2014/835312S1212014Cassandras, C. G., & Lafortune, S. (Eds.). (2008). Introduction to Discrete Event Systems. doi:10.1007/978-0-387-68612-7Yingwei Zhang, Jiayu An, & Chi Ma. (2013). Fault Detection of Non-Gaussian Processes Based on Model Migration. IEEE Transactions on Control Systems Technology, 21(5), 1517-1526. doi:10.1109/tcst.2012.2217966Ichikawa, A., & Hiraishi, K. (s. f.). Analysis and control of discrete event systems represented by petri nets. Lecture Notes in Control and Information Sciences, 115-134. doi:10.1007/bfb0042308Fanti, M. P., Mangini, A. M., & Ukovich, W. (2013). Fault Detection by Labeled Petri Nets in Centralized and Distributed Approaches. IEEE Transactions on Automation Science and Engineering, 10(2), 392-404. doi:10.1109/tase.2012.2203596Cabasino, M. P., Giua, A., & Seatzu, C. (2010). Fault detection for discrete event systems using Petri nets with unobservable transitions. Automatica, 46(9), 1531-1539. doi:10.1016/j.automatica.2010.06.013Hu, H., Zhou, M., Li, Z., & Tang, Y. (2013). An Optimization Approach to Improved Petri Net Controller Design for Automated Manufacturing Systems. IEEE Transactions on Automation Science and Engineering, 10(3), 772-782. doi:10.1109/tase.2012.2201714Hu, H., Zhou, M., & Li, Z. (2011). Supervisor Optimization for Deadlock Resolution in Automated Manufacturing Systems With Petri Nets. IEEE Transactions on Automation Science and Engineering, 8(4), 794-804. doi:10.1109/tase.2011.2156783Hiraishi, K. (1992). Construction of a class of safe Petri nets by presenting firing sequences. Lecture Notes in Computer Science, 244-262. doi:10.1007/3-540-55676-1_14Estrada-Vargas, A. P., LĂłpez-Mellado, E., & Lesage, J.-J. (2010). A Comparative Analysis of Recent Identification Approaches for Discrete-Event Systems. Mathematical Problems in Engineering, 2010, 1-21. doi:10.1155/2010/453254Shaolong Shu, & Feng Lin. (2013). I-Detectability of Discrete-Event Systems. IEEE Transactions on Automation Science and Engineering, 10(1), 187-196. doi:10.1109/tase.2012.2215959Li, L., & Hadjicostis, C. N. (2011). Least-Cost Transition Firing Sequence Estimation in Labeled Petri Nets With Unobservable Transitions. IEEE Transactions on Automation Science and Engineering, 8(2), 394-403. doi:10.1109/tase.2010.2070065Supavatanakul, P., Lunze, J., Puig, V., & Quevedo, J. (2006). Diagnosis of timed automata: Theory and application to the DAMADICS actuator benchmark problem. Control Engineering Practice, 14(6), 609-619. doi:10.1016/j.conengprac.2005.03.028Dotoli, M., Fanti, M. P., & Mangini, A. M. (2008). Real time identification of discrete event systems using Petri nets. Automatica, 44(5), 1209-1219. doi:10.1016/j.automatica.2007.10.014Chen, Y., Li, Z., Khalgui, M., & Mosbahi, O. (2011). Design of a Maximally Permissive Liveness- Enforcing Petri Net Supervisor for Flexible Manufacturing Systems. IEEE Transactions on Automation Science and Engineering, 8(2), 374-393. doi:10.1109/tase.2010.2060332Murata, T. (1989). Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4), 541-580. doi:10.1109/5.24143Ramirez-Trevino, A., Ruiz-Beltran, E., Aramburo-Lizarraga, J., & Lopez-Mellado, E. (2012). Structural Diagnosability of DES and Design of Reduced Petri Net Diagnosers. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 42(2), 416-429. doi:10.1109/tsmca.2011.2169950Ramirez-Trevino, A., Ruiz-Beltran, E., Rivera-Rangel, I., & Lopez-Mellado, E. (2007). Online Fault Diagnosis of Discrete Event Systems. A Petri Net-Based Approach. IEEE Transactions on Automation Science and Engineering, 4(1), 31-39. doi:10.1109/tase.2006.872120Toutenburg, H. (1974). Fleiss, J. L.: Statistical Methods for Rates and Proportions. John Wiley & Sons, New York-London-Sydney-Toronto 1973. XIII, 233 S. Biometrische Zeitschrift, 16(8), 539-539. doi:10.1002/bimj.19740160814Livingston, E. H., & Cassidy, L. (2005). Statistical Power and Estimation of the Number of Required Subjects for a Study Based on the t-Test: A Surgeon’s Primer. Journal of Surgical Research, 126(2), 149-159. doi:10.1016/j.jss.2004.12.013Ruppert, D. (2011). Statistics and Data Analysis for Financial Engineering. Springer Texts in Statistics. doi:10.1007/978-1-4419-7787-

    Performance Bounds for Synchronized Queueing Networks

    Get PDF
    Las redes de Petri estocĂĄsticas constituyen un modelo unificado de las diferentes extensiones de redes de colas con sincronizaciones existentes en la literatura, vĂĄlido para el diseño y anĂĄlisis de prestaciones de sistemas informĂĄticos distribuidos. En este trabajo se proponen tĂ©cnicas de cĂĄlculo de cotas superiores e inferiores de las prestaciones de redes de Petri estocĂĄsticas en estado estacionario. Las cotas obtenidas son calculables en tiempo polinĂłmico en el tamaño del modelo, por medio de la resoluciĂłn de ciertos problemas de programaciĂłn lineal definidos a partir de la matriz de incidencia de la red (en este sentido, las tĂ©cnicas desarrolladas pueden considerarse estructurales). Las cotas calculadas dependen sĂłlamente de los valores medios de las variables aleatorias que describen la temporizaciĂłn del sistema, y son independientes de los momentos de mayor orden. Esta independencia de la forma de las distribuciones de probabilidad asociadas puede considerarse como una Ăștil generalizaciĂłn de otros resultados existentes para distribuciones particulares, puesto que los momentos de orden superior son, habitualmente, desconocidos en la realidad y difĂ­ciles de estimar. Finalmente, las tĂ©cnicas desarrolladas se aplican al anĂĄlisis de diferentes ejemplos tomados de la literatura sobre sistemas informĂĄticos distribuidos y sistemas de fabricaciĂłn. ******* Product form queueing networks have long been used for the performance evaluation of computer systems. Their success has been due to their capability of naturally expressing sharing of resources and queueing, that are typical situations of traditional computer systems, as well as to their efficient solution algorithms, of polynomial complexity on the size of the model. Unfortunately, the introduction of synchronization constraints usually destroys the product form solution, so that general concurrent and distributed systems are not easily studied with this class of models. Petri nets have been proved specially adequate to model parallel and distributed systems. Moreover, they have a well-founded theory of analysis that allows to investigate a great number of qualitative properties of the system. In the original definition, Petri nets did not include the notion of time, and tried to model only the logical behaviour of systems by describing the causal relations existing among events. This approach showed its power in the specification and analysis of concurrent systems in a way independent of the concept of time. Nevertheless the introduction of a timing specification is essential if we want to use this class of models for the performance evaluation of distributed systems. One of the main problems in the actual use of timed and stochastic Petri net models for the quantitative evaluation of large systems is the explosion of the computational complexity of the analysis algorithms. In general, exact performance results are obtained from the numerical solution of a continuous time Markov chain, whose dimension is given by the size of the state space of the model. Structural computation of exact performance measures has been possible for some subclasses of nets such as those with state machine topology. These nets, under certain assumptions on the stochastic interpretation are isomorphic to Gordon and Newell's networks, in queueing theory terminology. In the general case, efficient methods for the derivation of performance measures are still needed. Two complementary approaches to the derivation of exact measures for the analysis of distributed systems are the utilization of approximation techniques and the computation of bounds. Approximate values for the performance parameters are in general more efficiently derived than the exact ones. On the other hand, "exactness" only exists in theory! In other words, numerical algorithms must be applied in practice for the computation of exact values, therefore making errors is inevitable. Performance bounds are useful in the preliminary phases of the design of a system, in which many parameters are not known accurately. Several alternatives for those parameters should be quickly evaluated, and rejected those that are clearly bad. Exact (and even approximate) solutions would be computationally very expensive. Bounds become useful in these instances since they usually require much less computation effort. The computation of upper and lower bounds for the steady-state performance of timed and stochastic Petri nets is considered in this work. In particular, we study the throughput of transitions, defined as the average number of firings per time unit. For this measure we try to compute upper and lower bounds in polynomial time on the size of the net model, by means of proper linear programming problems defined from the incidence matrix of the net (in this sense, we develop structural techniques). These bounds depend only on the mean values and not on the higher moments of the probability distribution functions of the random variables that describe the timing of the system. The independence of the probability distributions can be viewed as a useful generalization of the performance results, since higher moments of the delays are usually unknown for real cases, and difficult to estimate and assess. From a different perspective, the obtained results can be applied to the analysis of queueing networks extended with some synchronization schemes. Monoclass queueing networks can be mapped on stochastic Petri nets. On the other hand, stochastic Petri nets can be interpreted as monoclass queueing networks augmented with synchronization primitives. Concerning the presentation of this manuscript, it should be mentioned that chapter 1 has been written with the object of giving the reader an outline of the stochastic Petri net model: its definition, terminology, basic properties, and related concepts, together with its deep relation with other classic stochastic network models. Chapter 2 is devoted to the presentation of the net subclasses considered in the rest of the work. The classification presented here is quite different from the one which is usual in the framework of Petri nets. The reason lies on the fact that our classification criterion, the computability of visit ratios for transitions, is introduced for the first time in the field of stochastic Petri nets in this work. The significance of that criterion is based on the important role that the visit ratios play in the computation of upper and lower bounds for the performance of the models. Nevertheless, classical important net subclasses are identified here in terms of the computability of their visit ratios from different parameters of the model. Chapter 3 is concerned with the computation of reachable upper and lower bounds for the most restrictive subclass of those presented in chapter 2: marked graphs. The explanation of this fact is easy to understand. The more simple is the model the more accessible will be the techniques an ideas for the development of good results. Chapter 4 provides a generalization for live and bounded free choice nets of the results presented in the previous chapter. Quality of obtained bounds is similar to that for strongly connected marked graphs: throughput lower bounds are reachable for bounded nets while upper bounds are reachable for 1-bounded nets. Chapter 5 considers the extension to other net subclasses, like mono-T-semiflow nets, FRT-nets, totally open deterministic systems of sequential processes, and persistent nets. The results are of diverse colours. For mono-T-semiflow nets and, therefore, for general FRT-nets, it is not possible (so far) to obtain reachable throughput bounds. On the other hand, for bounded ordinary persistent nets, tight throughput upper bounds are derived. Moreover, in the case of totally open deterministic systems of sequential processes the exact steady-state performance measures can be computed in polynomial time on the net size. In chapter 6 bounds for other interesting performance measures are derived from throughput bounds and from classical queueing theory laws. After that, we explore the introduction of more information from the probability distribution functions of service times in order to improve the bounds. In particular, for Coxian service delay of transitions it is possible to improve the throughput upper bounds of previous chapters which held for more general forms of distribution functions. This improvement shows to be specially fruitful for live and bounded free choice nets. Chapter 7 is devoted to case studies. Several examples taken from literature in the fields of distributed computing systems and manufacturing systems are modelled by means of stochastic Petri nets and evaluated using the techniques developed in previous chapters. Finally, some concluding remarks and considerations on possible extensions of the work are presented

    Structural characterization of decomposition in rate-insensitive stochastic Petri nets

    Get PDF
    This paper focuses on stochastic Petri nets that have an equilibrium distribution that is a product form over the number of tokens at the places. We formulate a decomposition result for the class of nets that have a product form solution irrespective of the values of the transition rates. These nets where algebraically characterized by Haddad et al.~as SΠ2S\Pi^2 nets. By providing an intuitive interpretation of this algebraical characterization, and associating state machines to sets of TT-invariants, we obtain a one-to-one correspondence between the marking of the original places and the places of the added state machines. This enables us to show that the subclass of stochastic Petri nets under study can be decomposed into subnets that are identified by sets of its TT-invariants

    Petri nets for systems and synthetic biology

    Get PDF
    We give a description of a Petri net-based framework for modelling and analysing biochemical pathways, which uniÂŻes the qualita- tive, stochastic and continuous paradigms. Each perspective adds its con- tribution to the understanding of the system, thus the three approaches do not compete, but complement each other. We illustrate our approach by applying it to an extended model of the three stage cascade, which forms the core of the ERK signal transduction pathway. Consequently our focus is on transient behaviour analysis. We demonstrate how quali- tative descriptions are abstractions over stochastic or continuous descrip- tions, and show that the stochastic and continuous models approximate each other. Although our framework is based on Petri nets, it can be applied more widely to other formalisms which are used to model and analyse biochemical networks

    Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets

    Get PDF
    Two formal stochastic models are said to be bisimilar if their solutions as a stochastic process are probabilistically equivalent. Bisimilarity between two stochastic model formalisms means that the strengths of one stochastic model formalism can be used by the other stochastic model formalism. The aim of this paper is to explain bisimilarity relations between stochastic hybrid automata, stochastic differential equations on hybrid space and stochastic hybrid Petri nets. These bisimilarity relations make it possible to combine the formal verification power of automata with the analysis power of stochastic differential equations and the compositional specification power of Petri nets. The relations and their combined strengths are illustrated for an air traffic example.Comment: 15 pages, 4 figures, Workshop on Formal Methods for Aerospace (FMA), EPTCS 20m 201

    CSL model checking of Deterministic and Stochastic Petri Nets

    Get PDF
    Deterministic and Stochastic Petri Nets (DSPNs) are a widely used high-level formalism for modeling discrete-event systems where events may occur either without consuming time, after a deterministic time, or after an exponentially distributed time. The underlying process dened by DSPNs, under certain restrictions, corresponds to a class of Markov Regenerative Stochastic Processes (MRGP). In this paper, we investigate the use of CSL (Continuous Stochastic Logic) to express probabilistic properties, such a time-bounded until and time-bounded next, at the DSPN level. The verication of such properties requires the solution of the steady-state and transient probabilities of the underlying MRGP. We also address a number of semantic issues regarding the application of CSL on MRGP and provide numerical model checking algorithms for this logic. A prototype model checker, based on SPNica, is also described

    Abridged Petri Nets

    Full text link
    A new graphical framework, Abridged Petri Nets (APNs) is introduced for bottom-up modeling of complex stochastic systems. APNs are similar to Stochastic Petri Nets (SPNs) in as much as they both rely on component-based representation of system state space, in contrast to Markov chains that explicitly model the states of an entire system. In both frameworks, so-called tokens (denoted as small circles) represent individual entities comprising the system; however, SPN graphs contain two distinct types of nodes (called places and transitions) with transitions serving the purpose of routing tokens among places. As a result, a pair of place nodes in SPNs can be linked to each other only via a transient stop, a transition node. In contrast, APN graphs link place nodes directly by arcs (transitions), similar to state space diagrams for Markov chains, and separate transition nodes are not needed. Tokens in APN are distinct and have labels that can assume both discrete values ("colors") and continuous values ("ages"), both of which can change during simulation. Component interactions are modeled in APNs using triggers, which are either inhibitors or enablers (the inhibitors' opposites). Hierarchical construction of APNs rely on using stacks (layers) of submodels with automatically matching color policies. As a result, APNs provide at least the same modeling power as SPNs, but, as demonstrated by means of several examples, the resulting models are often more compact and transparent, therefore facilitating more efficient performance evaluation of complex systems.Comment: 17 figure

    About Dynamical Systems Appearing in the Microscopic Traffic Modeling

    Full text link
    Motivated by microscopic traffic modeling, we analyze dynamical systems which have a piecewise linear concave dynamics not necessarily monotonic. We introduce a deterministic Petri net extension where edges may have negative weights. The dynamics of these Petri nets are well-defined and may be described by a generalized matrix with a submatrix in the standard algebra with possibly negative entries, and another submatrix in the minplus algebra. When the dynamics is additively homogeneous, a generalized additive eigenvalue may be introduced, and the ergodic theory may be used to define a growth rate under additional technical assumptions. In the traffic example of two roads with one junction, we compute explicitly the eigenvalue and we show, by numerical simulations, that these two quantities (the additive eigenvalue and the growth rate) are not equal, but are close to each other. With this result, we are able to extend the well-studied notion of fundamental traffic diagram (the average flow as a function of the car density on a road) to the case of two roads with one junction and give a very simple analytic approximation of this diagram where four phases appear with clear traffic interpretations. Simulations show that the fundamental diagram shape obtained is also valid for systems with many junctions. To simulate these systems, we have to compute their dynamics, which are not quite simple. For building them in a modular way, we introduce generalized parallel, series and feedback compositions of piecewise linear concave dynamics.Comment: PDF 38 page

    Matrix-geometric solution of infinite stochastic Petri nets

    Get PDF
    We characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such on approach are that very efficient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. We first characterize the class of stochastic Petri nets of interest by formally defining a number of constraints that have to be fulfilled. We then discuss the matrix geometric solution technique that can be employed and present some boundary conditions on tool support. We illustrate the practical usage of the class of stochastic Petri nets with two examples: a queueing system with delayed service and a model of connection management in ATM network
    • 

    corecore