Theoretical Computer Science
Compositional Specification of Timed Systems (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Testing Concurrent Systems: A Formal Approach
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
A test generation framework for quiescent real-time systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
On Conformance Testing for Timed Systems
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
We are interested in black-box conformance testing of real-time systems. Our framework is based on the model of timed automata with inputs and outputs (TAIO). We use a timed conformance relation called tioco which is the extension of the untimed relation ioco. We show that considering only lazy-input TAIO is enough for describing all possible non-blocking specifications. We compare between tioco and the trace-inclusion relation. We prove that tioco is undecidable and that it does not distinguish specifications with the same set of observable traces. We prove tioco to be transitive and stable w.r.t both compositionality and action hiding for input-complete specifications. We compare between tioco and two other timed conformance relations, rtioco and $ \sqsubseteq_{\mathsf{\it tioco}}$.