Parametric model checking timed automata under non-Zenoness assumption
Real-time systems often involve hard timing constraints and concurrency, and are notoriously hard to design or verify. Given a model of a real-time system and a property, parametric model-checking aims at synthesizing timing valuations such that the model satisfies the property. However, the counter...
Saved in:
Main Authors: | ANDRE, Étienne, NGUYEN, Hoang Gia, PETRUCCI, Laure, SUN, Jun |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4714 https://ink.library.smu.edu.sg/context/sis_research/article/5717/viewcontent/Parametric_model_checking_non_Zenoness_av_2017.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Classification-based parameter synthesis for parametric timed automata
by: LI, Jiaying, et al.
Published: (2017) -
Language inclusion checking of timed automata with non-Zenoness
by: WANG, Xinyu, et al.
Published: (2017) -
A systematic study on explicit-state non-zenoness checking for timed automata
by: WANG, Ting, et al.
Published: (2015) -
Parametric timed model checking for guaranteeing timed opacity
by: ANDRÉ, Étienne, et al.
Published: (2019) -
The language preservation problem is undecidable for parametric event-recording automata
by: André, Étienne, et al.
Published: (2020)