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ę "Net" wg kryterium: Temat


Wyświetlanie 1-8 z 8
Tytuł:
An analytical method for well-formed workflow/Petri net verification of classical soundness
Autorzy:
Clempner, J.
Powiązania:
https://bibliotekanauki.pl/articles/331027.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
Lyapunov stability
Petri net
decidability
workflow net
soundness
verification
sieć Petriego
sieć przepływu pracy
stabilność Lapunova
Opis:
In this paper we consider workflow nets as dynamical systems governed by ordinary difference equations described by a particular class of Petri nets. Workflow nets are a formal model of business processes. Well-formed business processes correspond to sound workflow nets. Even if it seems necessary to require the soundness of workflow nets, there exist business processes with conditional behavior that will not necessarily satisfy the soundness property. In this sense, we propose an analytical method for showing that a workflow net satisfies the classical soundness property using a Petri net. To present our statement, we use Lyapunov stability theory to tackle the classical soundness verification problem for a class of dynamical systems described by Petri nets. This class of Petri nets allows a dynamical model representation that can be expressed in terms of difference equations. As a result, by applying Lyapunov theory, the classical soundness property for workflow nets is solved proving that the Petri net representation is stable. We show that a finite and non-blocking workflow net satisfies the sound property if and only if its corresponding PN is stable, i.e., given the incidence matrix A of the corresponding PN, there exists a Φ strictly positive m vector such that AΦ ≤ 0. The key contribution of the paper is the analytical method itself that satisfies part of the definition of the classical soundness requirements. The method is designed for practical applications, guarantees that anomalies can be detected without domain knowledge, and can be easily implemented into existing commercial systems that do not support the verification of workflows. The validity of the proposed method is successfully demonstrated by application examples.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 931-939
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Detection of deadlocks and traps in Petri nets by means of Thelens prime implicant method
Autorzy:
Węgrzyn, A.
Karatkevich, A.
Bieganowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/907258.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć Petriego
blokada
pułapka
żywotność
Petri net
deadlock
trap
analysis
liveness
Opis:
A new method of detecting deadlocks and traps in Petri nets is presented. Deadlocks and traps in Petri nets can be represented by the roots of special equations in CNF form. Such equations can be solved by using the search tree algorithm proposed by Thelen. In order to decrease the tree size and to accelerate the computations, some heuristics for Thelen's method are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 1; 113-121
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Classification of high resolution satellite images using improved U-Net
Autorzy:
Wang, Yong
Zhang, Dongfang
Dai, Guangming
Powiązania:
https://bibliotekanauki.pl/articles/331235.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
satellite image classification
deep learning
U-net
spatial pyramid pooling
zdjęcia satelitarne
uczenie głębokie
Opis:
Satellite image classification is essential for many socio-economic and environmental applications of geographic information systems, including urban and regional planning, conservation and management of natural resources, etc. In this paper, we propose a deep learning architecture to perform the pixel-level understanding of high spatial resolution satellite images and apply it to image classification tasks. Specifically, we augment the spatial pyramid pooling module with image-level features encoding the global context, and integrate it into the U-Net structure. The proposed model solves the problem consisting in the fact that U-Net tends to lose object boundaries after multiple pooling operations. In our experiments, two public datasets are used to assess the performance of the proposed model. Comparison with the results from the published algorithms demonstrates the effectiveness of our approach.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 3; 399-413
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new approach to image reconstruction from projections using a recurrent neural network
Autorzy:
Cierniak, R.
Powiązania:
https://bibliotekanauki.pl/articles/907945.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
rekonstrukcja obrazu
sieć neuronowa
sieć rekurencyjna
image reconstruction from projections
neural networks
recurrent net
Opis:
A new neural network approach to image reconstruction from projections considering the parallel geometry of the scanner is presented. To solve this key problem in computed tomography, a special recurrent neural network is proposed. The reconstruction process is performed during the minimization of the energy function in this network. The performed computer simulations show that the neural network reconstruction algorithm designed to work in this way outperforms conventional methods in the obtained image quality.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 2; 147-157
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simple environment for developing methods of controlling chaos in spatially distributed systems
Autorzy:
Korus, Ł.
Powiązania:
https://bibliotekanauki.pl/articles/907826.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
stabilność układu
wykładnik Lapunowa
metoda Lyapunova
coupled map lattice
spatiotemporal chaos
system stability
Lyapunov exponents
net direction phase
Opis:
The paper presents a simple mathematical model called a coupled map lattice (CML). For some range of its parameters, this model generates complex, spatiotemporal behavior which seems to be chaotic. The main purpose of the paper is to provide results of stability analysis and compare them with those obtained from numerical simulation. The indirect Lyapunov method and Lyapunov exponents are used to examine the dependence on initial conditions. The net direction phase is introduced to measure the symmetry of the system state trajectory. In addition, a real system, which can be modeled by the CML, is presented. In general, this article describes basic elements of environment, which can be used for creating and examining methods of chaos controlling in systems with spatiotemporal dynamics.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 1; 149-159
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficiency analysis of control algorithms in spatially distributed systems with chaotic behavior
Autorzy:
Korus, Ł.
Powiązania:
https://bibliotekanauki.pl/articles/331175.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
controlling spatiotemporal chaos
coupled map lattice
system stability
Lyapunov exponent
net direction phase
stabilność układu
wykładnik Lapunowa
kierunek fazy
Opis:
The paper presents results of examination of control algorithms for the purpose of controlling chaos in spatially distributed systems like the coupled map lattice (CML). The mathematical definition of the CML, stability analysis as well as some basic results of numerical simulation exposing complex, spatiotemporal and chaotic behavior of the CML were already presented in another paper. The main purpose of this article is to compare the efficiency of controlling chaos by simple classical algorithms in spatially distributed systems like CMLs. This comparison is made based on qualitative and quantitative evaluation methods proposed in the previous paper such as the indirect Lyapunov method, Lyapunov exponents and the net direction phase indicator. As a summary of this paper, some conclusions which can be useful for creating a more efficient algorithm of controlling chaos in spatially distributed systems are made.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 759-770
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generation of synchronizing state machines from a transition system: A region-based approach
Autorzy:
Teren, Viktor
Cortadella, Jordi
Villa, Tiziano
Powiązania:
https://bibliotekanauki.pl/articles/2201022.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
transition system
Petri net
state machine
theory of regions
SAT
pseudo Boolean optimization
układ przejściowy
sieć Petriego
maszyna stanów
teoria regionów
Opis:
Transition systems (TSs) and Petri nets (PNs) are important models of computation ubiquitous in formal methods for modeling systems. A crucial problem is how to extract, from a given TS, a PN whose reachability graph is equivalent (with a suitable notion of equivalence) to the original TS. This paper addresses the decomposition of transition systems into synchronizing state machines (SMs), which are a class of Petri nets where each transition has one incoming and one outgoing arc. Furthermore, all reachable markings (non-negative vectors representing the number of tokens for each place) of an SM have only one marked place with only one token. This is a significant case of the general problem of extracting a PN from a TS. The decomposition is based on the theory of regions, and it is shown that a property of regions called excitation-closure is a sufficient condition to guarantee the equivalence between the original TS and a decomposition into SMs. An efficient algorithm is provided which solves the problem by reducing its critical steps to the maximal independent set problem (to compute a minimal set of irredundant SMs) or to satisfiability (to merge the SMs). We report experimental results that show a good trade-off between quality of results vs. computation time.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 133--149
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems
Autorzy:
Wojnakowski, Marcin
Wiśniewski, Remigiusz
Bazydło, Grzegorz
Popławski, Mateusz
Powiązania:
https://bibliotekanauki.pl/articles/2055147.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
safeness
control part
cyber physical system
Petri net
state machine cover
place invariant
bezpieczeństwo baz danych
część kontrolna
system cyberfizyczny
sieć Petriego
maszyna stanów
niezmiennik miejsca
Opis:
The paper proposes an algorithm for safeness verification of a Petri net-based specification of the control part of cyber-physical systems. The method involves a linear algebra technique and is based on the computation of the state machine cover of a Petri net. Contrary to the well-known methods, the presented idea does not require obtaining all sequential components, nor the computation of all reachable states in the system. The efficiency and effectiveness of the proposed method have been verified experimentally with a set of 243 test modules (Petri net-based systems). The results of experiments show high efficiency of the proposed method since a solution has been found even for such nets where popular techniques are not able to analyze the safeness of the system. Finally, the presented algorithm is explained in detail using a real-life case-study example of the control part of a cyber-physical system.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 4; 647--657
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-8 z 8

    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