Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Berthomieu, Bernard"'
Publikováno v:
Theoretical Computer Science, 2023, 114346, ISSN 0304-3975
The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled transitions
Externí odkaz:
http://arxiv.org/abs/2306.12440
Publikováno v:
Fundamenta Informaticae, Volume 187, Issues 2-4: Petri Nets 2021 (October 21, 2022) fi:8831
We define a new method for taking advantage of net reductions in combination with a SMT-based model checker. Our approach consists in transforming a reachability problem about some Petri net, into the verification of an updated reachability property
Externí odkaz:
http://arxiv.org/abs/2104.09850
Although decidable, the marking reachability problem for Petri nets is well-known to be intractable in general, and a non-elementary lower bound has been recently uncovered. In order to alleviate this difficulty, various structural and behavioral res
Externí odkaz:
http://arxiv.org/abs/2006.05600
Petri nets proved useful to describe various real-world systems, but many of their properties are very hard to check. To alleviate this difficulty, subclasses are often considered. The class of weighted marked graphs with relaxed place constraint (WM
Externí odkaz:
http://arxiv.org/abs/2005.04818
Publikováno v:
International Symposium on Model Checking Software, SPIN 2018, Jun 2018, Malaga, Spain. Springer, 10869, Lecture Notes in Computer Science
We propose a method to count the number of reachable markings of a Petri net without having to enumerate these rst. The method relies on a structural reduction system that reduces the number of places and transitions of the net in such a way that we
Externí odkaz:
http://arxiv.org/abs/1807.02973
A classical method for model-checking timed properties-such as those expressed using timed extensions of temporal logic-is to rely on the use of observers. In this context, a major problem is to prove the correctness of observers. Essentially, this b
Externí odkaz:
http://arxiv.org/abs/1509.06507
We describe our experience with modeling a video tracking system used to detect and follow moving targets from an airplane. We provide a formal model that takes into account the real-time properties of the system and use it to compute the worst and b
Externí odkaz:
http://arxiv.org/abs/1509.06506
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We define an extension of time Petri nets such that the time at which a transition can fire, also called its firing date, may be dynamically updated. Our extension provides two mechanisms for updating the timing constraints of a net. First, we propos
Externí odkaz:
http://arxiv.org/abs/1404.7067
Autor:
Stewart, Robert, Berthomieu, Bernard, Garcia, Paulo, Ibrahim, Idris, Michaelson, Greg, Wallace, Andrew
Publikováno v:
In Journal of Systems Architecture December 2019 101
