Structural Aspects Of Switching Classes

Proefschrift ter verkrijging van de graad van Doctor aan de Universiteit Leiden, op gezag van de Rector Magnificus Dr. Jurriaan Hage geboren te Alphen aan den Rijn in 1969 The work in this thesis was carried within the context of the IPA graduate school.

[1]  Jaap-Henk Hoepman,et al.  Communication, synchronization and fault tolerance , 1996 .

[2]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[3]  Frank Harary,et al.  Graph Theory , 2016 .

[4]  Twan Laan.  The evolution of type theory in logic and mathematics , 1997 .

[5]  Stefan Blom,et al.  Term Graph Rewriting. Syntax and semantics , 2001 .

[6]  Alain Hertz.  On Perfect Switching Classes , 1999, Discret. Appl. Math..

[7]  Charles F. Miller,et al.  Combinatorial Group Theory , 2002 .

[8]  J. Seidel.  Graphs and two-graphs , 1974 .

[9]  G Georgina Fabian,et al.  A language and simulator for hybrid systems , 1999 .

[10]  M.H.G. Kesseler,et al.  The implementation of functional languages on parallel machines with distributed memory , 1996 .

[11]  Tero Harju,et al.  Structure and organization , 2014 .

[12]  Judi Maria Tirza Romijn,et al.  Analysing Industrial Protocols with Formal Methods , 1999 .

[13]  S. Afriat.  The ring of linked rings , 1982 .

[14]  J.J.H. Fey,et al.  Design of a fruit juice blending and packaging plant , 2000 .

[15]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[16]  Isabelle Reymen,et al.  Improving Design Processes through Structured Reflection: Feedback , 2001 .

[17]  J. J. Seidel,et al.  Geometry and Combinatorics: Selected Works of J.J. Seidel , 1991 .

[18]  Tero Harju,et al.  Complexity Issues in Switching of Graphs , 1998, TAGT.

[19]  B. D. Fluiter.  Algorithms for graphs of small treewidth , 1997 .

[20]  D. Turi,et al.  Functional Operational Semantics and its Denotational Dual , 1996 .

[21]  Andrzej Ehrenfeucht,et al.  Dynamic labeled 2-structures , 1994, Mathematical Structures in Computer Science.

[22]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[23]  Erik Harald Saaman,et al.  Another formal specification language , 2000 .

[24]  A. G. Engels,et al.  Languages for analysis and testing of event sequences , 2001 .

[25]  Mingchu Li,et al.  Pancyclicity and NP-completeness in Planar Graphs , 2000, Discret. Appl. Math..

[26]  Peter J. Cameron,et al.  Cohomological aspects of two-graphs , 1977 .

[27]  P. Severi.  Normalisation in lambda calculus and its relation to type inference , 1996 .

[28]  J. J. Seidel,et al.  TWO-GRAPHS, A SECOND SURVEY , 1981 .

[29]  J. P. Warners,et al.  Nonlinear approaches to satisfiability problems , 1999 .

[30]  R. S. Venema,et al.  Aspects of an integrated neural prediction system , 1999 .

[31]  Thomas Zaslavsky,et al.  Biased graphs. I. Bias, balance, and gains , 1989, J. Comb. Theory, Ser. B.

[32]  Lex Heerink,et al.  Ins and Outs in Refusal Testing , 1998 .

[33]  J Jan Zwanenburg,et al.  Object-oriented concepts and proof rules : formalization in type theory and implementation in Yarrow , 1999 .

[34]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

[35]  J. Verriet.  Scheduling with communication for multiprocessor computation , 1998 .

[36]  Nwa Norbert Arends,et al.  A systems engineering specification formalism , 1996 .

[37]  M. Franssen.  Cocktail : a tool for deriving correct programs , 2000 .

[38]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[39]  Jpl John Segers.  Algorithms for the simulation of surface processes , 1999 .

[40]  Cj Roel Bloo,et al.  Preservation of termination for explicit substitution , 1997 .

[41]  K. Leeuw.  Cryptology and statecraft in the Dutch Republic , 2000 .

[42]  Marieke Huisman,et al.  Reasoning about Java programs in higher order logic using PVS and Isabelle , 2001 .

[43]  G Goce Naumoski,et al.  A discrete-event simulator for systems engineering , 1998 .

[44]  Memorandum Cosor,et al.  Faculty of Mathematics and Computing Science , 1986 .

[45]  Peter J. Cameron.  Two-graphs and trees , 1994, Discret. Math..

[46]  J. J. Seidel,et al.  Tables of two-graphs , 1981 .

[47]  Michel A. Reniers,et al.  Message sequence chart : syntax and semantics , 1999 .

[48]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[49]  Thomas Zaslavsky,et al.  Characterizations of signed graphs , 1981, J. Graph Theory.

[50]  Jurriaan Hage.  The Membership Problem for Switching Classes with Skew Gains , 1999, Fundam. Informaticae.

[51]  Tero Harju,et al.  The size of switching classes with skew gains , 2000, Discret. Math..

[52]  Aa Twan Basten,et al.  In terms of nets : system design with Petri nets and process algebra , 1998 .

[53]  J. J. Seidel,et al.  A SURVEY OF TWO-GRAPHS , 1976 .

[54]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[55]  Jelasity Márk,et al.  The shape of evolutionary search: discovering and representingsearch space structure , 2001 .

[56]  T. Harju,et al.  The Size of 2-Classes in Group Labeled 2-Structures , 1996 .

[57]  Ts Ed Voermans.  Inductive datatypes with laws and subtyping : a relational model , 1999 .

[58]  Charles F. Miller.  On Group-Theoretic Decision Problems and Their Classification. , 1971 .

[59]  F.A.M. van den Beuken,et al.  A functional approach to syntax and typing , 1997 .

[60]  F. Harary.  On the notion of balance of a signed graph. , 1953 .

[61]  N. J. A. Sloane,et al.  TWO-GRAPHS, SWITCHING CLASSES AND EULER GRAPHS ARE EQUAL IN NUMBER* , 1975 .

[62]  Pedro R. D'Argenio,et al.  Algebras and Automata for Timed and Stochastic Systems , 1999 .

[63]  Tero Harju,et al.  Acyclicity of Switching Classes , 1998, Eur. J. Comb..

[64]  A. M. Geerling,et al.  Transformational development of data-parallel algorithms , 1996 .

[65]  Rmc Rene Ahn,et al.  Agents, objects and events : a computational approach to knowledge, observation and communication , 2001 .

[66]  Willem Otto David Griffioen,et al.  Studies in computer aided verification of protocols , 2000 .

[67]  J. O. Blanco,et al.  The state operator in process algebra , 1996 .

[68]  van Robert Liere,et al.  Studies in Interactive Visualization , 2001 .

[69]  Dick Alstein,et al.  Distributed algorithms for hard real-time systems , 1996 .

[70]  Ad M. G. Peeters,et al.  An asynchronous low-power 80C51 microcontroller , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[71]  ter Hugo Wilfried Laurenz Doest.  Towards Probabilistic Unification-Based Parsing , 1999 .

[72]  Ad M. G. Peeters,et al.  Single-rail handshake circuits , 1995, Proceedings Second Working Conference on Asynchronous Design Methodologies.

[73]  Tero Harju,et al.  Pancyclicity in switching classes , 2000, Inf. Process. Lett..

[74]  Emilia I. Barakova,et al.  Learning reliability : a study on dindecisiveness in sample selection , 1999 .

[75]  Joao Paulo Saraiva,et al.  Purely Functional Implementation of Attribute Grammars , 1999 .

[76]  Peter Achten,et al.  Interactive functional programs: models, methods, and implementation , 1996 .

[77]  Jan Kratochvíl,et al.  On the Computational Complexity of Seidel's Switching , 1992 .

[78]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .