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...

Full description

Saved in:
Bibliographic Details
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
Be the first to leave a comment!
You must be logged in first