Publication result detail

Algorithms for Computing Coverability Graphs for Hybrid Petri Nets

NOVOSAD, P.; ČEŠKA, M.

Original Title

Algorithms for Computing Coverability Graphs for Hybrid Petri Nets

English Title

Algorithms for Computing Coverability Graphs for Hybrid Petri Nets

Type

Paper in proceedings outside WoS and Scopus

Original Abstract

The paper formalizes the concept of the coverability graphs for autonomous hybrid Petri nets and introduces algorithms for their computing. Every algorithm is accompanied with an example. Algorithms for the bounded and unbounded hybrid Petri nets are presented.

English abstract

The paper formalizes the concept of the coverability graphs for autonomous hybrid Petri nets and introduces algorithms for their computing. Every algorithm is accompanied with an example. Algorithms for the bounded and unbounded hybrid Petri nets are presented.

Keywords

Hybrid Petri Net, Coverability Graph, Algorithm.

Key words in English

Hybrid Petri Net, Coverability Graph, Algorithm.

Authors

NOVOSAD, P.; ČEŠKA, M.

RIV year

2010

Released

10.11.2008

Publisher

Masaryk University

Location

Brno

ISBN

978-80-7355-082-0

Book

4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

Pages from

177

Pages to

183

Pages count

7

BibTex

@inproceedings{BUT30728,
  author="Petr {Novosad} and Milan {Češka}",
  title="Algorithms for Computing Coverability Graphs for Hybrid Petri Nets",
  booktitle="4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  year="2008",
  pages="177--183",
  publisher="Masaryk University",
  address="Brno",
  isbn="978-80-7355-082-0"
}