Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Petri Nets" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Timed Petri-Net Based Formulation and an Algorithm for the Optimal Scheduling of Batch Plants
    Autorzy:
    Gu, T.
    Bahri, P. A.
    Cai, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/908094.pdf
    Data publikacji:
    2003
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    informatyka
    timed Petri nets
    scheduling
    batch plants
    discrete event
    algorithm
    heuristic
    Opis:
    The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis of behavioural properties and performance evaluation, as well as for the systematic construction of discrete-event simulators and controllers. This paper aims at presenting a Petri-net based approach to the scheduling of operations in batch plants. Firstly, the short term of the `scheduling of batch plants' is formulated by means of a timed Petri net which can accommodate various intermediate storage policies, such as unlimited intermediate storage (UIS), no intermediate storage (NIS), finite intermediate storage (FIS), and mixed intermediate storage (MIS). Secondly, a heuristic search algorithm for the optimal scheduling of batch plants is given, which is based on generating and checking the markings in the reachability tree of the Petri-net model. Finally, the novel formulation and algorithm are tested with several simulation case studies.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2003, 13, 4; 527-536
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Novel Continuous Model to Approximate Time Petri Nets: Modelling and Analysis
    Autorzy:
    Gu, T.
    Dong, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/908478.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sieć Petriego
    system hybrydowy
    system dyskretny
    continuous Petri nets
    hybrid systems
    discrete event systems
    Opis:
    In order to approximate discrete-event systems in which there exist considerable states and events, David and Alla define a continuous Petri net (CPN). So far, CPNs have been a useful tool not only for approximating discrete-event systems but also for modelling continuous processes. Due to different ways of calculating instantaneous firing speeds of transitions, various continuous Petri net models, such as the CCPN (constant speed CPN), VCPN (variable speed CPN) and the ACPN (asymptotic CPN), have been proposed, where the continuous flow is specified uniquely by maximal firing speeds. However, in applications such as chemical processes there exist situations where the continuous flow must be above some minimal speed or in the range of minimal and maximal speeds. In this paper, from the point of view of approximating a time Petri net, the CPN is augmented with maximal and minimal firing speeds, and a novel continuous model, i.e., the Interval speed CPN (ICPN) is defined. The enabling and firing semantics of transitions of the ICPN are discussed, and the facilitating of continuous transitions is classified into three levels: 0-level, 1-level and 2-level. Some policies to resolve the conflicts and algorithms to undertake the behavioural analysis for the ICPN are developed. In addition, a chemical process example is presented.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2005, 15, 1; 141-150
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets
    Autorzy:
    Li, B.
    Khlif-Bouassida, M.
    Toguéyni, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/330272.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fault diagnosis
    discrete event system
    labeled Petri nets
    on-the-fly diagnosability analysis
    verifier nets
    diagnostyka błędu
    układ zdarzeń dyskretnych
    sieci Petriego
    Opis:
    This paper considers the problem of diagnosability analysis of discrete event systems modeled by labeled Petri nets (LPNs). We assume that the LPN can be bounded or unbounded with no deadlock after firing any fault transition. Our approach is novel and presents the on-the-fly diagnosability analysis using verifier nets. For a given LPN model, the verifier net and its reachability graph (for a bounded LPN) or coverability graph (for an unbounded LPN) are built on-the-fly and in parallel for diagnosability analysis. As soon as a diagnosability decision is established, the construction is stopped. This approach achieves a compromise between computation limitations due to efficiency and combinatorial explosion and it is useful to implement an engineering approach to the diagnosability analysis of complex systems.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 2; 269-281
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Colored decision process Petri nets: Modeling, analysis and stability
    Autorzy:
    Clempner, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/908525.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    proces decyzyjny
    kolorowane sieci Petriego
    metoda Lapunowa
    teoria gier
    decision process
    colored decision process Petri nets
    stability
    Lyapunov methods
    optimization
    game theory
    Opis:
    In this paper we introduce a new modeling paradigm for developing a decision process representation called the Colored Decision Process Petri Net (CDPPN). It extends the Colored Petri Net (CPN) theoretic approach including Markov decision processes. CPNs are used for process representation taking advantage of the formal semantic and the graphical display. A Markov decision process is utilized as a tool for trajectory planning via a utility function. The main point of the CDPPN is its ability to represent the mark-dynamic and trajectory-dynamic properties of a decision process. Within the mark-dynamic properties framework we show that CDPPN theoretic notions of equilibrium and stability are those of the CPN. In the trajectory-dynamic properties framework, we optimize the utility function used for trajectory planning in the CDPPN by a Lyapunov-like function, obtaining as a result new characterizations for final decision points (optimum point) and stability. Moreover, we show that CDPPN mark-dynamic and Lyapunov trajectory-dynamic properties of equilibrium, stability and final decision points converge under certain restrictions. We propose an algorithm for optimum trajectory planning that makes use of the graphical representation (CPN) and the utility function. Moreover, we consider some results and discuss possible directions for further research.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2005, 15, 3; 405-420
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies