Modeling of safe timed Petri nets by two -level (max, plus) automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F22%3A73620772" target="_blank" >RIV/61989592:15310/22:73620772 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S2405896322023825" target="_blank" >https://www.sciencedirect.com/science/article/pii/S2405896322023825</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ifacol.2022.10.345" target="_blank" >10.1016/j.ifacol.2022.10.345</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Modeling of safe timed Petri nets by two -level (max, plus) automata

Popis výsledku v původním jazyce

In this paper we will show that safe timed Petri nets (TPNs) with preselection semantics can be represented by deterministic two-level (max,+) automata (21-MPA). In 21MPA, the outer dynamics, corresponding to the evolution of component clocks, is represented by deterministic Mealy automata with vector-valued outputs from (max,+) semiring. The outer dynamics is then adjusted by inner dynamics corresponding to synchronizations, which are implemented through scalar-like multiplication of the coefficients by symmetric Boolean matrices. These Boolean matrices encode synchronization among the state machines components. The previous approaches encoded either safe TPNs under preselection policy as nondeterministic (max,+) automata, or TPNs under (more restrictive) race policy as deterministic (max,+) automata.

Název v anglickém jazyce

Modeling of safe timed Petri nets by two -level (max, plus) automata

Popis výsledku anglicky

In this paper we will show that safe timed Petri nets (TPNs) with preselection semantics can be represented by deterministic two-level (max,+) automata (21-MPA). In 21MPA, the outer dynamics, corresponding to the evolution of component clocks, is represented by deterministic Mealy automata with vector-valued outputs from (max,+) semiring. The outer dynamics is then adjusted by inner dynamics corresponding to synchronizations, which are implemented through scalar-like multiplication of the coefficients by symmetric Boolean matrices. These Boolean matrices encode synchronization among the state machines components. The previous approaches encoded either safe TPNs under preselection policy as nondeterministic (max,+) automata, or TPNs under (more restrictive) race policy as deterministic (max,+) automata.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

IFAC PAPERSONLINE

ISBN

—

ISSN

2405-8963

e-ISSN

—

Počet stran výsledku

8

Strana od-do

212-219

Název nakladatele

Elsevier (NL)

Místo vydání

Nizozemsko

Místo konání akce

Praha

Datum konání akce

7. 9. 2022

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000877003700030