Synthesis of distinguishing test cases for timed finite state machines
From MaRDI portal
Publication:1758682
DOI10.1134/S0361768810040043zbMath1251.68132MaRDI QIDQ1758682
Maksim Leonidovich Gromov, N. V. Yevtushenko
Publication date: 16 November 2012
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0361768810040043
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A calculus of communicating systems
- A theory of timed automata
- Formal testing from timed finite state machines
- Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
- Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
- Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
- Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
- Testing timed automata