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”

Algorithms for Computing Coverability Graphs for Continuous Petri Nets

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F08%3APU78085" target="_blank" >RIV/00216305:26230/08:PU78085 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Algorithms for Computing Coverability Graphs for Continuous Petri Nets

  • Original language description

    A useful method for Petri nets analysis is based on a coverability tree or a coverability graph that represents a state space of a system. The paper formalizes the concept of the coverability graphs for autonomous continuous Petri nets and introduces algorithms for their computing. The algorithms for the bounded and unbounded continuous Petri nets are presented. Every algorithm is accompanied with an example. The new concept of a signed continuous macro-marking for the bounded continuous Petri nets is described.

  • Czech name

    Algoritmy pro výpočet grafu pokrytí spojitých Petriho sítí

  • Czech description

    Užitečné metody pro analýzu Petriho sítí jsou založeny na stromě pokrytí nebo grafu pokrytí, které reprezentují stavový prostor systému. Článek formalizuje koncept grafů pokrytí pro autonomní spojité Petriho sítě a uvádí algoritmy pro jejich výpočet. Prezentovány jsou algoritmy pro omezené i neomezené spojité Petriho sítě. U každého algoritmu je&nbsp;uveden příklad. Dále je popsán nový koncept znaménkového spojitého makro-značení pro omezené spojité Petriho sítě.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

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

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2008

  • 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

    Proceedings of 22th European Simulation and Modelling Conference ESM'2008

  • ISBN

    978-90-77381-44-1

  • ISSN

  • e-ISSN

  • Number of pages

    3

  • Pages from-to

  • Publisher name

    EUROSIM-FRANCOSIM-ARGESIM

  • Place of publication

    Le Havre

  • Event location

    Universite du Havre, Le Havre, France

  • Event date

    Aug 27, 2008

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article