by Holger Giese
Abstract:
A number of approaches exists that permit to synthesize the operational state-based behavior of a set of components for a set of scenarios. In this paper we explore how to extend these approaches to also tackle the problem for scenarios with parametric timing constraints in form of upper and lower time bounds. The resulting time consistency problems are identified and ideas for an algorithmic handling are presented.
Reference:
Towards Scenario-Based Synthesis for Parametric Timed Automata (Holger Giese), In Proc. of the 2nd International Workshop on Scenarios and State Machines: Models, Algorithms and Tools (SCESM, ICSE 2003 Workshop 8), Portland, USA, 2003.
Bibtex Entry:
@InProceedings{G03_ag,
AUTHOR = {Giese, Holger},
TITLE = {{Towards Scenario-Based Synthesis for Parametric Timed Automata}},
YEAR = {2003},
MONTH = {May},
BOOKTITLE = {Proc. of the 2nd International Workshop on Scenarios and State Machines: Models, Algorithms and Tools (SCESM, ICSE 2003 Workshop 8), Portland, USA},
URL = {http://www.upb.de/cs/ag-schaefer/Veroeffentlichungen/Quellen/Papers/2003/ICSE2003-SCESM-G.pdf},
PDF = {ICSE2003-SCESM-G.pdf},
ABSTRACT = {A number of approaches exists that permit to synthesize the operational state-based behavior of a set of components for a set of scenarios. In this paper we explore how to extend these approaches to also tackle the problem for scenarios with parametric timing constraints in form of upper and lower time bounds. The resulting time consistency problems are identified and ideas for an algorithmic handling are presented.}
}