Language inclusion checking of timed automata with non-Zenoness
Given a timed automaton P modeling an implementation and a timed automaton S as a specification, the problem of language inclusion checking is to decide whether the language of P is a subset of that of S. It is known to be undecidable. The problem gets more complicated if non-Zenoness is taken into...
Saved in:
Main Authors: | WANG, Xinyu, SUN, Jun, WANG, Ting, QIN, Shengchao |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4701 https://ink.library.smu.edu.sg/context/sis_research/article/5704/viewcontent/Non_Zenoness_av.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A systematic study on explicit-state non-zenoness checking for timed automata
by: WANG, Ting, et al.
Published: (2015) -
Parametric model checking timed automata under non-Zenoness assumption
by: ANDRE, Étienne, et al.
Published: (2017) -
Timed automata patterns
by: DONG, Jin Song, et al.
Published: (2008) -
Are timed automata bad for a specification language? Language inclusion checking for timed automata
by: WANG, Ting, et al.
Published: (2014) -
Timed automata patterns
by: Dong, J.S., et al.
Published: (2013)