Results 251 to 260 of about 262,073 (323)
Some of the next articles are maybe not open access.
Formal Methods in Computer Science, 2019
Exercise 1 (Dickson’s Lemma). A quasi-order (A,≤) is a set A endowed with a reflexive and transitive ordering relation ≤. A well quasi order (wqo) is a quasi order (A,≤) s.t., for any infinite sequence a0a1 · · · in Aω, there exist indices i < j with ai ≤
Jiacun Wang, William Tepfenhart
openaire +2 more sources
Exercise 1 (Dickson’s Lemma). A quasi-order (A,≤) is a set A endowed with a reflexive and transitive ordering relation ≤. A well quasi order (wqo) is a quasi order (A,≤) s.t., for any infinite sequence a0a1 · · · in Aω, there exist indices i < j with ai ≤
Jiacun Wang, William Tepfenhart
openaire +2 more sources
Monographs in Theoretical Computer Science. An EATCS Series, 1996
Falko Bause, Pieter S. Kritzinger
openaire +2 more sources
Falko Bause, Pieter S. Kritzinger
openaire +2 more sources
Encyclopedia of Creativity, Invention, Innovation and Entrepreneurship, 2020
Carl Adam Petri
openaire +2 more sources
Carl Adam Petri
openaire +2 more sources
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1999
This paper presents the possibilistic Petri net model which combines possibility logic with Petri nets with objects. The main feature of this model is to allow one to reason about the aspects of uncertainty and change in dynamic discrete event systems.
Cardoso, Janette +2 more
openaire +4 more sources
This paper presents the possibilistic Petri net model which combines possibility logic with Petri nets with objects. The main feature of this model is to allow one to reason about the aspects of uncertainty and change in dynamic discrete event systems.
Cardoso, Janette +2 more
openaire +4 more sources
Fundamenta Informaticae, 1983
This paper investigates the use of sets of places of a Petri net as additional (to input places) constraints for granting concession to a transition. Various modes of using constraints give rise to various classes (of languages) of constrained Petri nets. The power of these classes is compared in the language theoretical framework.
Goeman, H. J. M. +3 more
openaire +2 more sources
This paper investigates the use of sets of places of a Petri net as additional (to input places) constraints for granting concession to a transition. Various modes of using constraints give rise to various classes (of languages) of constrained Petri nets. The power of these classes is compared in the language theoretical framework.
Goeman, H. J. M. +3 more
openaire +2 more sources
A simulation engine for stochastic timed petri nets and application to emergency healthcare systems
IEEE/CAA Journal of Automatica Sinica, 2019In many service delivery systems, the quantity of available resources is often a decisive factor of service quality. Resources can be personnel, offices, devices, supplies, and so on, depending on the nature of the services a system provides.
Jian Zhou, Jiacun Wang, Jun Wang
semanticscholar +1 more source
Parameterized Analysis of Immediate Observation Petri Nets
Applications and Theory of Petri Nets, 2019We introduce immediate observation Petri nets, a class of interest in the study of population protocols (a model of distributed computation), and enzymatic chemical networks.
J. Esparza +2 more
semanticscholar +1 more source
Resonance, 1999
Petri nets offer a versatile modeling framework for complex, distributed, concurrent systems and have been used in a wide range of modeling applications. In Part 1 of this two-part article, we have seen important features and representational power of the Petri net model.
Christos G. Cassandras +1 more
openaire +2 more sources
Petri nets offer a versatile modeling framework for complex, distributed, concurrent systems and have been used in a wide range of modeling applications. In Part 1 of this two-part article, we have seen important features and representational power of the Petri net model.
Christos G. Cassandras +1 more
openaire +2 more sources