Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: pb-models

Sortuj według:

Ogranicz wyniki do:

Reachability Analysis for Timed Automata Using Partitioning Algorithms

Półrola A., Penczek W., Szreter M.

Fundamenta Informaticae

2003

Vol. 55, nr 2

203-221

The paper presents a new method for checking reachability properties of Timed Automata. The idea consists in on-the-fly verification of a property on a pseudo-bisimulating model generated by a modified partitioning algorithm. Pseudo-bisimulating models are often much smaller than forward-reachability graphs commonly used in reachability analysis. A theoretical description of the algorithm is supported by several experimental results.