Premium
Requirements completeness: Absolute or relative? Comments on "System function implementation and behavioral modeling"[Syst Eng 4 (2001), 58‐75]
Author(s) -
Carson Ronald S.,
Shell Tony
Publication year - 2001
Publication title -
systems engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.474
H-Index - 50
eISSN - 1520-6858
pISSN - 1098-1241
DOI - 10.1002/sys.1019
Subject(s) - completeness (order theory) , assertion , computer science , set (abstract data type) , calculus (dental) , mathematics , programming language , medicine , mathematical analysis , dentistry
Shell [Syst Eng 4 (2001), 58–75] raised the issue of requirements “completeness,” concluding that its proof is not possible. This communication is intended to clarify the original intent of the assertion and identify a set of conditions under which completeness may be verified. © 2001 John Wiley & Sons, Inc. Syst Eng 4: 230–231, 2001
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom