arXiv Open Access 2018

Parameter Synthesis Problems for Parametric Timed Automata

Liyun Dai Bo Liu Zhiming Liu and

Lihat Sumber

Abstrak

We consider the parameter synthesis problem of parametric timed automata (PTAs). The problem is, given a PTA and a property, to compute the set of valuations of the parameters under which the resulting timed automaton satisfies the property. Such a set of parameter valuations is called a feasible region for the PTA and the property. The problem is known undecidable in general. This paper, however, presents our study on some decidable sub-classes of PTAs and proposes efficient parameter synthesis algorithms for them.

Topik & Kata Kunci

eess.SY

Penulis (4)

Liyun Dai

Bo Liu

Zhiming Liu

and

Format Sitasi

APA MLA BibTeX

Dai, L., Liu, B., Liu, Z., and (2018). Parameter Synthesis Problems for Parametric Timed Automata. https://arxiv.org/abs/1808.06792

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓