Weakly strong semantics of Time Petri Nets for performance evaluations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00598504" target="_blank" >RIV/67985840:_____/24:00598504 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.ifacol.2024.07.012" target="_blank" >https://doi.org/10.1016/j.ifacol.2024.07.012</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ifacol.2024.07.012" target="_blank" >10.1016/j.ifacol.2024.07.012</a>
Alternative languages
Result language
angličtina
Original language name
Weakly strong semantics of Time Petri Nets for performance evaluations
Original language description
We propose two new semantics for T-time Petri nets (T-TPN), which fill the gap between strong and weak semantics. By encoding a 2-counter machine, we prove that reachability is not decidable for these semantics in the case of unbounded nets. We then consider safe nets and we propose a translation into interval weighted automata over an interval like semiring, product of (max,+) semiring with itself, that preserves the timed behavior of T-TPN.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
20205 - Automation and control systems
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
IFAC-PapersOnLine. Volume 58, Issue 1 - 17th IFAC Workshop on discrete Event Systems WODES 2024
ISBN
—
ISSN
2405-8963
e-ISSN
—
Number of pages
6
Pages from-to
66-71
Publisher name
Elsevier
Place of publication
Amsterdam
Event location
Rio de Janeiro
Event date
Apr 29, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
001278103000012