1 |
"IEC 61158-6-21: 2010, Industrial communication networks - Fieldbus specifications - Part 6-21: Application layer protocol specification - Type 21 elements."
|
2 |
"IEC 61158-3-21: 2010, Industrial communication networks - Fieldbus specifications - Part 3-21: Data-link layer service definition Type 21 elements."
|
3 |
"IEC 61158-4-21: 2010, Industrial communication networks - Fieldbus specifications - Part 4-21: Data-link layer protocol specification - Type 21 elements."
|
4 |
"IEC 61158-5-21: 2010, Industrial communication networks - Fieldbus specifications - Part 5-21: Application layer service definition - Type 21 elements."
|
5 |
"IEC 61784-2: 2010, Industrial communication networks - Profiles - Part 2: Additional fieldbus profiles for real-time networks based on ISO/IEC 8802-3."
|
6 |
"IEC 62439-7, Industrial communication networks - High availability automation networks - Part 7: Ring-based Redundancy Protocol (RRP)."
|
7 |
F. Dopatka and R.Wismller, "Design of a realtime industrial-Ethernet network including hot-pluggable asynchronous devices," in Proc. IEEE ISIE, 2007, pp. 1826-1831.
|
8 |
G. Chartrand and O. R. Oellermann, Applied and Algorithmic Graph Theory. New York: McGraw-Hill, 1993.
|
9 |
F. Dopatka and R. Wismller, "A top-down Approach for realtime industrial-Ethernet networks using edge-coloring of conflict-multigraphs," in Proc. SPEEDAM, Taormina, Italy, May 2006, pp. 883-890.
|
10 |
GE fanuc intelligent platforms. (2009). Switched Ethernet latency analysis [Online]. Available: http://www.gefanuc.com
|
11 |
J. Gross and Yellen, Graph Theory and Its Applications. Washington, DC: CRC Press, 1999.
|
12 |
V. K. Balakrishan, Schaums Outline of Graph Theory. New York: McGraw-Hill, 1997.
|
13 |
G. Chartrand and L. Lesniak, Graphs and Digraphs. 4th Ed., Washington, DC: CRC Press, 2005.
|
14 |
M. Russell, Graph Theory. New York: John Wiley, 2001.
|
15 |
R. J. Wilson, Introduction to Graph Theory. 4th ed., Prentice Hall, 1996.
|
16 |
IEEE 802.3 LAN/MAN CSMA/CD Access Method, IEEE Standard, 802.3, 2002.
|
17 |
U. Nowak, "Graphentheoretische modellierung eines automatisierungstechnischen echtzeitnetzwerks und algorithmenentwurf zum kommunikations- scheduling," Diploma Thesis, Dept. of Math., Univ. Siegen, Germany, 2006.
|
18 |
N. Alon, "A simple algorithm for edge-coloring bipartite multigraphs," Inf. Process. Lett. vol. 85, no. 6, pp. 301-302, 2003.
DOI
ScienceOn
|
19 |
D. Marx. (2003). Graph coloring problems and their applications in scheduling [Online]. Available: http://citeseer.ist.psu.edu/672702.html
|
20 |
I. Holyer, "The NP-completeness of edge-coloring," SIAMJ. Comput., vol. 10, no. 4, pp. 718-720, 1981.
DOI
|
21 |
R. Jain and J. Werth, "Analysis of approximate algorithms for edgecoloring bipartite graphs," Inf. Process. Lett., vol.54(3), pp. 163-168, 1995.
DOI
ScienceOn
|
22 |
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. 2nd ed., MIT Press and McGraw-Hill, 2001.
|
23 |
S. Iglin, "GrTheory-Graph Theory Toolbox," Mathworks Inc. Matlab.
|