About: Solving Deadlock States in Model of Railway Station Operation Using Coloured 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
  • Ambice vyhnutí se stavům uváznutí, které se vyskytují v simulačních modelech provozu železniční stanice, si vyžaduje použití metod systémů přidělování prostředků. Kvůli složitosti původního systému byl vybrán algoritmus bankéře. Pro otestování jeho použitelnosti byl vytvořen model jednoduchého provozu železniční stanice v barvené Petriho síti a v něm implementován algoritmus. Článek stručně opisuje celý proces tvorby a ukazuje, že algoritmus bankéře prokázal svoji účinnost na vyhýbání se uváznutí v systému přidělování prostředků s paralelním zpracováním, pružným směrováním, opakovaným použitím prostředků v procesu a použitím profesí při přidělování prostředků. (cs)
  • An ambition to avoid deadlock states occurring in simulation models of railway station operation requires an application of methods from resource allocation systems. Because of complexity of the underlying system, Banker's algorithm has been chosen. To test its applicability, a coloured Petri net model of a simple railway station operation was constructed and the algorithm implemented. This paper describes briefly the whole process and shows that the Banker's algorithm proved to be effective for deadlock avoidance in resource allocation system with parallel processing, flexible routing, repeated use of resources and use of professions for resource allocation.
  • An ambition to avoid deadlock states occurring in simulation models of railway station operation requires an application of methods from resource allocation systems. Because of complexity of the underlying system, Banker's algorithm has been chosen. To test its applicability, a coloured Petri net model of a simple railway station operation was constructed and the algorithm implemented. This paper describes briefly the whole process and shows that the Banker's algorithm proved to be effective for deadlock avoidance in resource allocation system with parallel processing, flexible routing, repeated use of resources and use of professions for resource allocation. (en)
Title
  • Solving Deadlock States in Model of Railway Station Operation Using Coloured Petri Nets
  • Solving Deadlock States in Model of Railway Station Operation Using Coloured Petri Nets (en)
  • Řešení stavů uváznutí v modelech provozu železničních stanic s využitím barvených Petriho sítí (cs)
skos:prefLabel
  • Solving Deadlock States in Model of Railway Station Operation Using Coloured Petri Nets
  • Solving Deadlock States in Model of Railway Station Operation Using Coloured Petri Nets (en)
  • Řešení stavů uváznutí v modelech provozu železničních stanic s využitím barvených Petriho sítí (cs)
skos:notation
  • RIV/00216275:25510/08:00007126!RIV09-MSM-25510___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021627505)
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
  • 395859
http://linked.open...ai/riv/idVysledku
  • RIV/00216275:25510/08:00007126
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • coloured Petri net; resource allocation system; transportation system; deadlock-avoidance policy; Banker's algorithm (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [6E4C6FA873CD]
http://linked.open...v/mistoKonaniAkce
  • Budapest
http://linked.open...i/riv/mistoVydani
  • Budapest
http://linked.open...i/riv/nazevZdroje
  • Formal methods for automation and safety in railway and automotive systems : proceedings of Symposium FORMS/FORMAT 2008
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Žarnay, Michal
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
  • Budapest University of Technology and Economics
https://schema.org/isbn
  • 978-963-236-138-3
http://localhost/t...ganizacniJednotka
  • 25510
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software