Off-line test selection with test purposes for non-deterministic timed automata
DOI10.2168/LMCS-8(4:8)2012zbMATH Open1248.68319MaRDI QIDQ3166229FDOQ3166229
Thierry Jรฉron, Amรฉlie Stainer, Nathalie Bertrand, Moez Krichen
Publication date: 22 October 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
timed automatagameconformance testingurgencypartial observabilitytest purposeapproximate determinization
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (4)
Recommendations
- Off-line test selection with test purposes for non-deterministic timed automata ๐ ๐
- On deriving test suites for nondeterministic finite state machines with time-outs ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Testing real-time systems using determinization techniques for automata over timed domains ๐ ๐
- The power of reachability testing for timed automata ๐ ๐
- Testing timed automata ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems ๐ ๐
This page was built for publication: Off-line test selection with test purposes for non-deterministic timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166229)