Die Virtualitaet: Philosophische Grundlagen der logischen Relativitaet

SIGLEAvailable from TIB Hannover: RO8347(1992,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Remarks on periods and colorings in graphs

Connectivity of an undirected graph is revisited by means of its reduced graphs and related to its orientations. Sufficient conditions for chromatic numbers are obtained from periods of strong orientations. (orig.)Available from TIB Hannover: RO 8347(1997,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Bestimmung eines Lastprofils auf vernetzten Arbeitsplatzrechnern

To compare new developments in the field of computer performance, it is necessary to simulate a computer system. The simulation of computer system need a representative artificial test workload, which describe the workload of a real computer system. This paper includes a derivation from the real workload to an artificial test workload and concludes with some hypothetical clauses, which came in mind during the measurement. This clauses may be a basis of workload prognosis. (orig.)Available from TIB Hannover: RO 8347(1996,25)+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

An algorithm for finding the connectivity structure of undirected graphs

An algorithm is presented which decomposes an undirected graph into a hierarchy of components: Connected components, peripheral trees, stopfree kernels, internal trees, subcomponents, and biblocks. The algorithm consists of a simple 'token moving' procedure to identify the peripheral trees and a procedure based on depth-first search to find the stopfree kernels and their internal structure. All together, the complexity is O(m), m the number of edges, if there are at least as many edges as vertices. (orig.)Available from TIB Hannover: RO 8347(1997,13) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Perodicity: an application of digraphs to Markov chains

Periodicity as known from Markov chain theory is defined for directed graphs and its properties derived by purely graph theoretic means. An O(n"3)-complexity algorithm using breadth first search to find the period of a finite strongly connected component is presented. (orig.)Available from TIB Hannover: RO 8347(1995,24) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Equivalences of coloured Petri nets

Positive graph conserving module isomorphisms are used to define coloured and general Petri nets. Three kind of equivalences are introduced and investigated using these isomorphisms. An equivalence testing procedure using profiles is presented. (orig.)Available from TIB Hannover: RO 8347(1996,24)+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman