On the testability of SDL specifications

DOI10.1016/J.COMNET.2003.06.001MaRDI QIDQ1881177zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 October 2004

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL http://bura.brunel.ac.uk/handle/2438/349

zbMATH Keywords

infeasible path problemInres protocol

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1979819
• scientific article; zbMATH DE number 1728527
• scientific article; zbMATH DE number 2084330
• scientific article; zbMATH DE number 1728528
• Formal Techniques for Networked and Distributed Systems - FORTE 2003
• scientific article; zbMATH DE number 1728514
• scientific article; zbMATH DE number 1982203
• scientific article; zbMATH DE number 1951539

Cited in

(7)

• Specification of Timed EFSM Fault Models in SDL
• Coverage testing software architectural design in SDL.
• scientific article; zbMATH DE number 1951539 (Why is no real title available?)
• Formal Techniques for Networked and Distributed Systems - FORTE 2003
• Canonical finite state machines for distributed systems
• Testing for refinement in \textsf{Circus}
• scientific article; zbMATH DE number 1982203 (Why is no real title available?)

This page was built for publication: On the testability of SDL specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881177)