𝔖 Bobbio Scriptorium

✦ LIBER ✦

On finding a minimal functional description of a finite-state machine for test generation for adjacent machines

✍ Scribed by Pomeranz, I.; Reddy, S.M.

Book ID: 119773057
Publisher: IEEE
Year: 2000
Tongue: English
Weight: 259 KB
Volume: 49
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.822567

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The use of evolutionary programming base

The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior

✍ A. V. Aleksandrov, S. V. Kazakov… 📂 Article 📅 2013 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 948 KB

Tight bound on the length of distinguish

Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs

✍ Iksoon Hwang; Nina Yevtushenko; Ana Cavalli 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 126 KB

[IEEE 2012 XXth International Conference

[IEEE 2012 XXth International Conference on Electrical Machines (ICEM) - Marseille, France (2012.09.2-2012.09.5)] 2012 XXth International Conference on Electrical Machines - Development of a system for testing grid-connected Permanent Magnet wind generators

✍ de la Bat, J. G.; Khan, M. A.; Barendse, P. 📂 Article 📅 2012 🏛 IEEE ⚖ 730 KB

[IEEE 2012 Sixth International Symposium

[IEEE 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering (TASE) - Beijing, China (2012.07.4-2012.07.6)] 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering - A Path-oriented Approach to Generating Executable Test Sequences for Extended Finite State Machines

✍ Wu, Tianyong; Yan, Jun; Zhang, Jian 📂 Article 📅 2012 🏛 IEEE ⚖ 198 KB

[ACM Press the thirty-first annual ACM s

[ACM Press the thirty-first annual ACM symposium - Atlanta, Georgia, United States (1999.05.01-1999.05.04)] Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 - A PTAS for minimizing the weighted sum of job completion times on parallel machines

✍ Skutella, Martin; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 ACM Press 🌐 English ⚖ 605 KB

[ACM Press the 1980 ACM conference - Sta

[ACM Press the 1980 ACM conference - Stanford University, California, United States (1980.08.25-1980.08.27)] Proceedings of the 1980 ACM conference on LISP and functional programming - LFP '80 - Local optimization in a compiler for stack-based Lisp machines

✍ Masinter, Larry M.; Deutsch, L. Peter 📂 Article 📅 1980 🏛 ACM Press ⚖ 625 KB