On the testability of SDL specifications

DOI10.1016/j.comnet.2003.06.001zbMath1068.68026OpenAlexW2058922219MaRDI QIDQ1881177

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

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

Related Items (2)

Testing for refinement in \textsf{Circus} ⋮ Canonical finite state machines for distributed systems

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