Detail publikace

Algorithms for Computing Coverability Graphs for Hybrid Petri Nets

Originální název

Algorithms for Computing Coverability Graphs for Hybrid Petri Nets

Anglický název

Algorithms for Computing Coverability Graphs for Hybrid Petri Nets

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

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"
}