Publication 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

conference paper

Language

en

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.

RIV year

2008

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

Edition

NEUVEDEN

Edition number

NEUVEDEN

Pages from

177

Pages to

183

Pages count

7

Documents

BibTex


@inproceedings{BUT30728,
  author="Petr {Novosad} and Milan {Češka}",
  title="Algorithms for Computing Coverability Graphs for Hybrid Petri Nets",
  annote="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.",
  address="Masaryk University",
  booktitle="4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  chapter="30728",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Masaryk University",
  year="2008",
  month="november",
  pages="177--183",
  publisher="Masaryk University",
  type="conference paper"
}