Informacja

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

Wyszukujesz frazę "Petri-net" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Stability analysis of fuzzy controll systems simplified as a discrete system
Autorzy:
Hasegawa, T.
Furuhashi, T.
Powiązania:
https://bibliotekanauki.pl/articles/206083.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
analiza stabilności
sieć Petriego
sterowanie rozmyte
fuzzy control
Petri net
stability analysis
Opis:
Fuzzy controls can describe control rules using fuzzy if-then rules and it can incorporate experts' control rules. It is, however, difficult to guarantee the stability of fuzzy control system. This paper presents a new method for stability analysis of fuzzy control system using petri nets. The proposed method crisply divides all of the input and output variables of the fuzzy controller and the fuzzy model of the controlled object. This crisp division makes the fired rules of the fuzzy controller and the fuzzy model, which have truth values greater then 0, be single each. These simplified fuzzy rules can be considered as discrete description of the controller and the controlled object. By approximating and the fuzzy control system as this discrete system, the system can be expressed by the petri nets. The proposed method describes the fuzzy control system using matrix based on a bipartite directed multigraph of the petri net, thereby enables to analyse the stability of the fuzzy control system. The analytic results using the petri nets have clear correspondence to the fired fuzzy rules. The dynamical behavior of the system are able to be understood easily. Simulation is done to verify the proposed stability analysis method.
Źródło:
Control and Cybernetics; 1998, 27, 4; 565-577
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Time Petri nets state space reduction using dynamic programming
Autorzy:
Popova-Zeugmann, L.
Powiązania:
https://bibliotekanauki.pl/articles/970865.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie dynamiczne
time Petri net
dynamic programming
state space reduction
integer state
reachability graph
Opis:
In this paper a parametric description for the state space of an arbitrary TPN is given. An enumerative procedure for reducing the state space is introduced. The reduction is defined as a truncated multistage decision problem and solved recursively. A reachability graph is denned in a discrete way by using the reachable integer-states of the TPN.
Źródło:
Control and Cybernetics; 2006, 35, 3; 721-748
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
DP2PN2Solver: A flexible dynamic programming solver software tool
Autorzy:
Mauch, H.
Powiązania:
https://bibliotekanauki.pl/articles/970851.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sieć Bellmana
model sieci Petri
programowanie dynamiczne
Bellman net
dynamic programming
matrix chain multiplication problem
optimization software
Petri net model
traveling salesman problem
Opis:
Dynamic programming (DP) is a very general optimization technique, which can be applied to numerous decision problems that typically require a sequence of decisions to be made. The solver software DP2PN2Solver presented in this paper is a general, flexible, and expandable software tool that solves DP problems. It consists of modules on two levels. A level one module takes the specification of a discrete DP problem instance as input and produces an intermediate Petri net (PN) representation called Bellman net (Lew, 2002; Lew, Mauch, 2003, 2004) as output - a middle layer, which concisely captures all the essential elements of a DP problem in a standardized and mathematically precise fashion. The optimal solution for the problem instance is computed by an "executable" code (e.g. Java, Spreadsheet, etc.) derived by a level two module from the Bellman net representation. DP2PN2Solver's unique potential lies in its Bellman net representation. In theory, a PN's intrinsic concurrency allows to distribute the computational load encountered when solving a single DP problem instance to several computational units.
Źródło:
Control and Cybernetics; 2006, 35, 3; 687-702
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    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