Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 2024

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: tabele decyzyjne

Sortuj według:

Ogranicz wyniki do:

Software requirements elaboration with decision tables

Grzybowski Michał, Młyńczak Jakub, Sokołowska Lucyna, Matowicki Michał

Zeszyty Naukowe. Transport / Politechnika Śląska

2024

z. 125

89--99

The paper describes decision table notation as a requirements definition technique. Modern critical systems, e.g., railway signaling systems, are implemented with electronic technologies. The use of computers in these systems has greatly expanded their functionality. Increase in functionality unfortunately leads to increase in complexity, which forces the designer to follow a more rigorous development process. The paper discusses the subject of describing expected software behavior, i.e., software requirements specification. It presents desired requirements features and describes how these features can be obtained by use of decision tables. The paper also discusses decision table transformations, which can reduce the effort to establish decision tables and facilitate their analysis. The authors’ experiments support the use of decision tables as a mean to increase requirements quality by providing tools for automatic decision table processing.

Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes

Ostonov Azimkhon, Moshkov Mikhail

Annals of Computer Science and Information Systems

2024

Vol. 39

667--670

In this research paper, we examine classes of decision tables that are closed under attribute (column) removal and changing of decisions associated with rows. For decision tables belonging to these closed classes, we investigate lower bounds on the minimum cardinality of reducts. Reducts are minimal sets of attributes that allow us to determine the decision attached to a given row. We assume that the number of rows in the decision tables from the closed class is not limited by a constant. We divide the set of these closed classes into two families. In one family, the minimum cardinality of reducts for decision tables is bounded by standard lower bounds of the forms Ω(log cl(Τ), where cl(Τ) represents the number of decision classes in the table Τ. In the other family, these lower bounds can be significantly tightened to the form Ω(cl(Τ) 1/q) for some natural number q.