About: Algorithms for Computing Coverability Graphs for Hybrid Petri Nets     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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 hybrid Petri nets and introduces algorithms for their computing. Algorithms for bounded and unbounded hybrid Petri nets are presented. Every algorithm is accompanied with an example.
  • 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 hybrid Petri nets and introduces algorithms for their computing. Algorithms for bounded and unbounded hybrid Petri nets are presented. Every algorithm is accompanied with an example. (en)
Title
  • Algorithms for Computing Coverability Graphs for Hybrid Petri Nets
  • Algorithms for Computing Coverability Graphs for Hybrid Petri Nets (en)
skos:prefLabel
  • Algorithms for Computing Coverability Graphs for Hybrid Petri Nets
  • Algorithms for Computing Coverability Graphs for Hybrid Petri Nets (en)
skos:notation
  • RIV/00216305:26230/08:PU78086!RIV10-MSM-26230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/07/0322), P(GD102/05/H050), Z(MSM0021630528)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 355396
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/08:PU78086
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova

  • Hybrid ,Petri Net, Coverability Graph, Algorithm. (en)

http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [98FF85727D15]
http://linked.open...v/mistoKonaniAkce
  • Znojmo
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...i/riv/nazevZdroje
  • 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Češka, Milan
  • Novosad, Petr
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Masaryk University
https://schema.org/isbn
  • 978-80-7355-082-0
http://localhost/t...ganizacniJednotka
  • 26230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software