NOVOSAD Petr and ČEŠKA Milan. Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets. In: *Proc. of Computer Aided System Theory 2013*. Universidad de Las Palmas de Gran Canaria: The Universidad de Las Palmas de Gran Canaria, 2013, pp. 244-245. ISBN 84-695-6971-6. |

Publication language: | english |
---|

Original title: | Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets |
---|

Title (cs): | Algoritmus pro výpočet rozvojů neomezených hybridních Petriho sítí |
---|

Pages: | 244-245 |
---|

Proceedings: | Proc. of Computer Aided System Theory 2013 |
---|

Conference: | Fourteenth International Conference On Computer Aided Systems Theory |
---|

Place: | Universidad de Las Palmas de Gran Canaria, ES |
---|

Year: | 2013 |
---|

ISBN: | 84-695-6971-6 |
---|

Publisher: | The Universidad de Las Palmas de Gran Canaria |
---|

Keywords |
---|

Hybrid Petri Nets, unfoldings, complete finite prefix. |

Annotation |
---|

The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. The unfolding is a useful partial-order method for analysis and verification of the Petri net properties. The motivation for introducing unfoldings for hybrid Petri nets is that this technique can cope well with the so-called state space explosion problem especially for the Petri nets with a lot of concurrency. This contribution extends our previous work and formalizes the concept of the unfoldings for autonomous hybrid Petri nets, introduces an algorithm for their computing and shows new results. The developed algorithm constructs the finite and complete prefix of the unfolding of the unbounded hybrid Petri net. In the future we plan to develop algorithms for analysing properties of the hybrid Petri nets from the unfolding. |

Abstract |
---|

The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. The motivation for introducing unfoldings for hybrid Petri nets is that this technique can cope well with the so-called state space explosion problem especially for the Petri nets with a lot of concurrency. This contribution extends our previous work and formalizes the concept of the unfoldings for autonomous hybrid Petri nets, introduces an algorithm for their computing and shows new results. |

BibTeX: |
---|

@INPROCEEDINGS{
author = {Petr Novosad and Milan {\v{C}}e{\v{s}}ka},
title = {Algorithm for Computing Unfoldings of Unbounded
Hybrid Petri Nets},
pages = {244--245},
booktitle = {Proc. of Computer Aided System Theory 2013},
year = {2013},
location = {Universidad de Las Palmas de Gran Canaria, ES},
publisher = {The Universidad de Las Palmas de Gran Canaria},
ISBN = {84-695-6971-6},
language = {english},
url = {http://www.fit.vutbr.cz/research/view_pub.php.en?id=10185}
} |