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”

Determinization of timed Petri nets behaviors

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F16%3A00460479" target="_blank" >RIV/67985840:_____/16:00460479 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/s10626-015-0214-1" target="_blank" >http://dx.doi.org/10.1007/s10626-015-0214-1</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10626-015-0214-1" target="_blank" >10.1007/s10626-015-0214-1</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Determinization of timed Petri nets behaviors

  • Original language description

    We study sequentialization of formal power series with coefficients in the semiring $(mathbb{R}cup {- infty },max,+)$, which represent the behavior of timed Petri nets. Several approaches make it possible to derive nondeterministic (max,+) automata modeling safe timed Petri nets. Determinism is a crucial property for numerous results on (max,+) automata(in particular, for applications to performance evaluation and control) and existing procedures for determinization succeed only for restrictive classes of (max,+) automata. We present a semi-algorithm for determinization of behaviors based on the semantics of bounded timed Petri nets. The resulting deterministic (max,+) automata can be infinite, but a sufficient condition called strong liveness is proposed to ensure the termination.Moreover, if the net cannot be sequentialized we propose a restriction of its logical behavior so that the sufficient condition becomes satisfied for the restricted net.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • 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

  • Name of the periodical

    Discrete Event Dynamic Systems-Theory and Applications

  • ISSN

    0924-6703

  • e-ISSN

  • Volume of the periodical

    26

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    25

  • Pages from-to

    413-437

  • UT code for WoS article

    000379009200002

  • EID of the result in the Scopus database

    2-s2.0-84930901090