|
|
|
|
|
|
|
 |
|
 |
|
Publications - An Unfolding Algorithm for Synchronous Products of Transition Systems
|
|
 |
|
 |
Reference:
J. Esparza and S. Römer. An unfolding algorithm for synchronous products of transition systems. In Proc. of CONCUR'99, number 1664 in Lecture Notes in Computer Science, pages 2–20. Springer-Verlag, 1999.
Abstract:
The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold. An unfolding procedure is provided which exploits the product structure of the model. Its performance is evaluated on a set of benchmarks.
Suggested BibTeX entry:
@inproceedings{ER99,
author = {J. Esparza and S. R{\"o}mer},
booktitle = {Proc. of CONCUR'99},
number = {1664},
pages = {2--20},
publisher = {{Springer-Verlag}},
series = {Lecture Notes in Computer Science},
title = {An Unfolding Algorithm for Synchronous Products of Transition Systems},
year = {1999}
}
|
 |
|
|
|
|
|
|
|
|