By Topic

Hierarchical determination of precedence order and representation of digraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Inagaki, T. ; Inst. of Information Sci. & Electronics, Univ. of Tsukuba, Ibaraki, Japan ; Himmelblau, D.H.

A new way is described via a linked records structure of establishing the precedence order among relations given by an acyclic digraph with Boolean AND or OR gates at some vertices. The proposed algorithm is illustrated by an application to modular instruction system, and contrasted with ISM.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-13 ,  Issue: 3 )