Lattices of processes in graphs with inputs
Journal Article
·
· Cybernetics and Systems Analysis
This article is a continuation of others work, presenting a detailed analysis of finite lattices of processes in graphs with input nodes. Lattices of processes in such graphs are studied by representing the lattices in the form of an algebra of pairs. We define the algebra of pairs somewhat generalizing the definition. Let K and D be bounded distributive lattices. A sublattice {delta} {contained_in} K x D is called an algebra of pairs if for all K {element_of} K we have (K, 1{sub D}) {element_of} {delta} and for all d {element_of} D we have (O{sub K}).
- Sponsoring Organization:
- USDOE
- OSTI ID:
- 457567
- Journal Information:
- Cybernetics and Systems Analysis, Vol. 31, Issue 1; Other Information: PBD: Sep 1995; TN: Translated from Kibernetika i Sistemnyi Analiz; No. 1, 23-29(Jan-Feb 1995)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Confidential balls minimizing in mean convex functional
Computing the isoperimetric number of a graph
Algebraic connectivity and graph robustness.
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:457567
Computing the isoperimetric number of a graph
Journal Article
·
Sun Jan 01 00:00:00 EST 1995
· Cybernetics and Systems Analysis
·
OSTI ID:457567
Algebraic connectivity and graph robustness.
Technical Report
·
Wed Jul 01 00:00:00 EDT 2009
·
OSTI ID:457567