All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Representation of time Petri nets using interval weighted automata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F23%3A00578406" target="_blank" >RIV/67985840:_____/23:00578406 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/CoDIT58514.2023.10284333" target="_blank" >https://doi.org/10.1109/CoDIT58514.2023.10284333</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/CoDIT58514.2023.10284333" target="_blank" >10.1109/CoDIT58514.2023.10284333</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Representation of time Petri nets using interval weighted automata

  • Original language description

    Interval Weighted Automata are a modeling formalism for timed systems that can be viewed as an alternative (more algebraic) to timed automata. We present here a way of deriving a deterministic interval weighted automaton to represent any bounded T-time Petri net subject to strong and single-server semantics. This approach consequently contributes to the characterization of the expressiveness of weighted automata with respect to other formalisms for timed Discrete Event Systems. In addition, the time language of the obtained abstraction has the characteristics of being included or equal to the time language of the T-time Petri net, and, in other words, any accessible state in the obtained Interval Weighted Automaton corresponds to an equally accessible state in the T-time Petri net. This property should allow the future use of this abstraction for the verification of properties that are expressed as an accessibility issue and/or for control.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20205 - Automation and control systems

Result continuities

  • Project

    <a href="/en/project/GC19-06175J" target="_blank" >GC19-06175J: Compositional Methods for the Control of Concurrent Timed Discrete-Event Systems</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • 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

    9th International Conference on Control, Decision and Information Technologies (CoDIT)

  • ISBN

    979-8-3503-1141-9

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    "Č. 99"

  • Publisher name

    IEEE

  • Place of publication

    Los Alamitos

  • Event location

    Rome

  • Event date

    Jul 3, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article