ABSTRACTIONS OF FINITE-STATE MACHINES OPTIMAL WITH RESPECT TO SINGLE UNDETECTABLE OUTPUT FAULTS.

被引：0

作者：

Oikonomou, Kostas N. ^{[1
]}

机构：

[1] AT&T Information Systems,, Middletown, NJ, USA, AT&T Information Systems, Middletown, NJ, USA

来源：

IEEE Transactions on Computers | 1987年 / C-36卷 / 02期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：185 / 200

共 50 条

[1] ABSTRACTIONS OF FINITE-STATE MACHINES OPTIMAL WITH RESPECT TO SINGLE UNDETECTABLE OUTPUT FAULTS
OIKONOMOU, KN
IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (02) : 185 - 200
[2] ABSTRACTIONS OF FINITE-STATE MACHINES AND IMMEDIATELY-DETECTABLE OUTPUT FAULTS
OIKONOMOU, KN
IEEE TRANSACTIONS ON COMPUTERS, 1992, 41 (03) : 325 - 338
[3] On a class of optimal abstractions of finite-state machines
Oikonomou, KN
FORMAL METHODS IN SYSTEM DESIGN, 1996, 8 (03) : 195 - 220
[4] Abstractions of finite-state machines and optimality with respect to immediately-detectable next-state faults
Oikonomou, KN
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1996, 26 (01): : 151 - 160
[5] Abstractions of Random Finite-State Machines
Kostas N. Oikonomou
Formal Methods in System Design, 2001, 18 : 171 - 207
[6] Abstractions of random finite-state machines
Oikonomou, KN
FORMAL METHODS IN SYSTEM DESIGN, 2001, 18 (03) : 171 - 207
[7] DIAGNOSTIC-TESTS FOR SINGLE TRANSITION FAULTS IN NONDETERMINISTIC FINITE-STATE MACHINES
GHEDAMSI, A
DSSOULI, P
VONBOCHMANN, G
PROTOCOL TEST SYSTEMS, V, 1993, 11 : 105 - 116
[8] FINITE-STATE ABSTRACTIONS ON ARABIC MORPHOLOGY
NARAYANAN, A
HASHEM, L
ARTIFICIAL INTELLIGENCE REVIEW, 1993, 7 (06) : 373 - 399
[9] Compositional Synthesis of Finite-State Abstractions
Mallik, Kaushik
Schmuck, Anne-Kathrin
Soudjani, Sadegh
Majumdar, Rupak
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (06) : 2629 - 2636
[10] STEADY-STATE OPTIMAL CONTROL OF FINITE-STATE MACHINES
DORATO, P
AUTOMATICA, 1971, 7 (03) : 351 - +

← 1 2 3 4 5 →