Name
Abstract | ||
|---|---|---|
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 consideration. A run is Zeno if it permits infinitely many actions within finite time. Otherwise it ... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TSE.2017.2653778 | IEEE Transactions on Software Engineering |
Keywords | Field | DocType |
Automata,Clocks,Safety,Analytical models,Sun,Real-time systems,Semantics | Zeno's paradoxes,Language inclusion,Model checking,Computer science,Automaton,Theoretical computer science,Timed automaton,Counterexample,Semantics,Undecidable problem | Journal |
Volume | Issue | ISSN |
43 | 11 | 0098-5589 |
Citations | PageRank | References |
0 | 0.34 | 27 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| xinyu | 1 | 590 | 30.19 |
| Jun Sun | 2 | 1407 | 120.35 |
| Ting Wang | 3 | 27 | 1.72 |
| Shengchao Qin | 4 | 711 | 62.81 |