Browse

ftp://ftp.win.tue.nl (280)

	ftp://ftp.win.tue.nl/pub/techreports/janjoris/GraphGrammars.ps.gz, 19930519 Graph Grammars and Operations on Graphs Jan Joris Vereijken May 19, 1993 Department of Computer Science Leiden University The Netherlands ii Master's Thesis, Leiden University, The Netherlands. Title : Graph Grammars and Operations on Graphs Author : Jan Joris Vereijken Supervisor : Dr. Joost Engelfriet
	ftp://ftp.win.tue.nl/pub/techreports/josb/discretetime.ps.Z, 19931011 1 Discrete Time Process Algebra J.C.M. Baeten Department of Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands and Department of
	ftp://ftp.win.tue.nl/pub/techreports/josb/axiomsurvey.ps.Z, 19931011 1 A Survey of Axiom Systems for Process Algebras J.C.M. Baeten Department of Software Technology, CWI, P.O.Box 4079, 1009 AB Amsterdam, The Netherlands and Programming Research Group, University of Amsterdam, P.O.Box 41882, 1009 DB Amsterdam, The Netherlands J.A. Bergstra Programming Research Group,
	ftp://ftp.win.tue.nl/pub/techreports/josb/realspace.ps.Z, 19931011 1 Real Space Process Algebra J.C.M. Baeten Department of Computer Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands and Department of
	ftp://ftp.win.tue.nl/pub/techreports/josb/signals.ps.Z, 19931011 1 Process Algebra with Signals and Conditions J.C.M. Baeten Department of Software Technology, CWI, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands J.A. Bergstra Programming Research Group,
	ftp://ftp.win.tue.nl/pub/techreports/josb/totalorder.ps.Z, 19931011 The Total Order Assumption1 J.C.M. Baeten Department of Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands The total order assumption (TOA) is the assumption that all execution sequences of observable actions or events are totally ordered by
	ftp://ftp.win.tue.nl/pub/techreports/josb/SOSwithpredicates.ps.Z, 19931011 A congruence theorem for structured operational semantics with predicates J.C.M. Baeten and C. Verhoef Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands e-mail: chrisv@win.tue.nl, josb@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/josb/wetenschap.ps.Z, 19931011 10/11/93 intreerede versie informatie 1 Informatica als Wetenschap Formele Specificatie en Wiskundige Verificatie J.C.M. Baeten Vakgroep Informatica, Technische Universiteit Eindhoven Postbus 513, 5600 MB Eindhoven In dit artikel wordt betoogd dat de informatica nog een lange weg te gaan heeft, voordat
	ftp://ftp.win.tue.nl/pub/techreports/josb/prefixes.ps.Z, 19931011 1 On Sequential Composition, Action Prefixes and Process Prefix J.C.M. Baeten Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, P.O.Box 41882, 1009 DB
	ftp://ftp.win.tue.nl/pub/techreports/josb/processcreation.ps.Z, 19931011 1 An Algebra for Process Creation Jos C.M. Baeten1 Frits W. Vaandrager2 Department of Software Technology, CWI, P.O.Box 4079, 1009 AB Amsterdam, The Netherlands In this paper, we study the issue of process creation from an algebraic perspective. The key to our approach, which is inspired by the work of
	ftp://ftp.win.tue.nl/pub/techreports/josb/infinitesimals.ps.Z, 19931011 10/7/93 1 Real Time Process Algebra with Infinitesimals J.C.M. Baeten Department of Computer Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/josb/processlogic.ps.Z, 19931011 A Real Time Process Logic J.C.M. Baeten Department of Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands and Department of Philosophy,
	ftp://ftp.win.tue.nl/pub/techreports/josb/noninterleaving.ps.Z, 19931027 1 Non Interleaving Process Algebra J.C.M. Baeten Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, P.O.Box 41882, 1009 DB Amsterdam, The Netherlands and
	ftp://ftp.win.tue.nl/pub/techreports/weffers/thesis/erratum.ps.Z, 19940106 Implementing Elements of the Spec-Calculus Errata H.T.G. Weffers October 1, 1993 A book may be amusing with numerous errors, or it may be very dull without a single absurdity. \| O. Goldsmith, The vicar of Wakefield (1762) ffl On the first page there should also be: `Graduation Committee: prof.dr. R.C.
	ftp://ftp.win.tue.nl/pub/techreports/weffers/thesis/sheets.ps.Z, 19940106 Eindhoven tue University of Technology ' Implementing Elements of the Spec-Calculus H.T.G. Weffers August 1993 De spraak is de mens gegeven om zijn gedachten uiteen te zetten. Frans: La parole a et e donn ee a l'homme pour expliquer ses pens ees. \| Moli ere, La mariage forc e (1661) Department of
	ftp://ftp.win.tue.nl/pub/techreports/weffers/thesis/mscrep.ps.Z, 19940106 EINDHOVEN tue UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computing Science Graduating Dissertation Implementing Elements of the Spec-Calculus by H.T.G. Weffers Supervisor: Prof.dr. R.C. Backhouse August 16, 1993 Trademarks Throughout this document trademarked names may be used. Rather than
	ftp://ftp.win.tue.nl/pub/techreports/weffers/gronics/gr94.ps.Z, 19940106 Implementing Elements of the Spec-Calculus: An Example H.T.G. Weffers Department of Mathematics and Computing Science Eindhoven University of Technology HG 6.57, P.O.Box 513, 5600 MB Eindhoven, The Netherlands December 15, 1993
	ftp://ftp.win.tue.nl/pub/techreports/weffers/gronics/gr94_sh.ps.Z, 19940113 Eindhoven tue University of Technology / Dept. of Mathematics and Computing Science 1 Implementing Elements of the Spec-Calculus: An Example H.T.G. Weffers January 14, 1994 GRONICS-94 / H.T.G. Weffers (c) HTGW - January 13, 1994 Eindhoven tue University of Technology / Dept. of Mathematics and Computing
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/iwtools.ps.Z, 19940228 A Prototype Tool Set for Interworkings Sjouke Mauw, Thijs Winter The interworking language provides a graphical method for the description of synchronous interactions between system components. In this paper we give an overview of the language and discuss the prototype tool set which has been developed
	ftp://ftp.win.tue.nl/pub/techreports/josb/partialchoice.ps.Z, 19940311 1 Process Algebra with Partial Choice J.C.M. Baeten Department of Computer Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands and Department of
	ftp://ftp.win.tue.nl/pub/techreports/josb/graphiso.ps.Z, 19940325 3/25/94 1 Graph Isomorphism Models for Non Interleaving Process Algebra J.C.M. Baeten Department of Computer Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam,
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/mscsemantics.ps.Z, 19940406 An algebraic semantics of Message Sequence Charts S. Mauw M.A. Reniers Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. sjouke@win.tue.nl michelr@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/toolkit/v1.1/design.ps.gz, 19940517 The design and implementation of the FIRE engine: A C++ toolkit for FInite automata and Regular Expressions Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands email: watson@win.tue.nl May 17, 1994
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/toolkit/v1.1/design.600dpi.ps.gz, 19940518 The design and implementation of the FIRE engine: A C++ toolkit for FInite automata and Regular Expressions Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands email: watson@win.tue.nl May 17, 1994
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/2nd.edition/constax.ps.gz, 19940518 A taxonomy of finite automata construction algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 May 18, 1994
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/2nd.edition/mintax.ps.gz, 19940518 A taxonomy of finite automata minimization algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 May 18, 1994
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/toolkit/v1.1/intro.600dpi.ps.gz, 19940518 An introduction to the FIRE engine: A C++ toolkit for FInite automata and Regular Expressions Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands email: watson@win.tue.nl May 17, 1994
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/2nd.edition/mintax.600dpi.ps.gz, 19940519 A taxonomy of finite automata minimization algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 May 18, 1994
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/1st.edition/mintax.2up.ps.gz, 19940519 A taxonomy of finite automata minimization algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 December 13, 1993
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/2nd.edition/constax.600dpi.ps.gz, 19940519 A taxonomy of finite automata construction algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 May 18, 1994
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/1st.edition/mintax.ps.gz, 19940519 A taxonomy of finite automata minimization algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 December 13, 1993
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/1st.edition/constax.2up.ps.gz, 19940519 A taxonomy of finite automata construction algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 December 13, 1993
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/1st.edition/mintax.600dpi.ps.gz, 19940519 A taxonomy of finite automata minimization algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 December 13, 1993
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/1st.edition/constax.ps.gz, 19940519 A taxonomy of finite automata construction algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 December 13, 1993
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/1st.edition/constax.600dpi.ps.gz, 19940519 A taxonomy of finite automata construction algorithms Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail: watson@win.tue.nl Tel: +31 40 474319 December 13, 1993
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/regular.ps.Z, 19940526 Regularity of BPA-Systems is Decidable Sjouke Mauw and Hans Mulder Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. sjouke@win.tue.nl, hansm@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/pi/automata/toolkit/v1.1/intro.ps.Z, 19940620 An introduction to the FIRE engine: A C++ toolkit for FInite automata and Regular Expressions Bruce W. Watson Faculty of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands email: watson@win.tue.nl May 17, 1994
	ftp://ftp.win.tue.nl/pub/math.prog.construction/isos.ps.Z, 19940701 Constructive Lattice Theory Roland Backhouse Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. rolandb@win.tue.nl October 15, 1993
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/brochure.ps.Z, 19940728 External Projects of the Department of Computing Science The Department of Computing Science of Eindhoven University of Technology (TUE) endeavours to work closely with trade and industry. So as to bring about this close cooperation, trainee computing science engineers are often provided with placements
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/choice.ps.Z, 19940728 1 Delayed choice: an operator for joining Message Sequence Charts J.C.M. Baeten and S. Mauw Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. We study the extension of a simple process algebra with the delayed choice
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/bpts.ps.Z, 19940823 Breakpoints and Time in Distributed Computations Twan Basten Dept. of Computing Science, Eindhoven University of Technology, The Netherlands email: tbasten@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/master.ps.Z, 19940823 EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computing Science Master's Thesis Hierarchical Event-Based Behavioral Abstraction in Interactive Distributed Debugging: A Theoretical Approach by A.A. Basten Supervisors: Dr. J.P. Black0 Dr. M.H. Coffin0 Advisor: Prof.Dr.Dipl.Ing. D.K.
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/simisl.ps.Z, 19940908 Simulating and Analyzing Railway Interlockings in ExSpect Twan Basten, Roland Bol, and Marc Voorhoeve Department of Computing Science, Eindhoven University of Technology, The Netherlands email: ftbasten,bol,wsinmarcg@win.tue.nl
	ftp://ftp.win.tue.nl/pub/math.prog.construction/skel.ps.Z, 19940913 Transformational derivation of (parallel) programs using skeletons Eerke A. Boiteny Eindhoven University of Technology A. Max Geerling University of Nijmegen Helmut A. Partschy University of Ulm
	ftp://ftp.win.tue.nl/pub/techreports/janjoris/FischersProtocol.ps.gz, 19940927 Fischer's Protocol in Timed Process Algebra Jan Joris Vereijken Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands email: janjoris@acm.org August 18, 1994
	ftp://ftp.win.tue.nl/pub/techreports/janjoris/ConcatenationOfGraphs.ps.gz, 19940927 Concatenation of Graphs Joost Engelfriet Department of Computer Science, Leiden University, P.O. Box 9512, NL-2300 RA Leiden, The Netherlands email: engelfriet@rulwinw.leidenuniv.nl Jan Joris Vereijken Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/calma-eut-ch-0994a.ps, 19941003 Progress report of the Eindhoven participants in the CALMA-project on the Frequency Assignment Problem: Upper and Lower Bounds. To be presented at the Maastricht meeting, September 30, 1994. For the radio link frequency assignment problem several techniques based on local search are investigated by Jan
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/calma-eut-ch-0994b.ps, 19941003 Radio Link Frequency Assignment Problem Jan Karel Lenstra (EUT) Cor Hurkens (EUT) Sergey Tiourine (EUT) Stan van Hoesel (EUT/UL) Giovanni Righini (Milano) Karen Aardal (Tilburg) given: - digraph G = (V,A); - set of frequencies F; - " e A: domain Dome F; - A = {e 1 , e 2 , e 3 , e 4 , . . . }; - "e, f A:
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/req.ps.Z, 19941014 Syntax Requirements of Message Sequence Charts M.A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. michelr@win.tue.nl September 14, 1994
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/tools.ps.Z, 19941102 Generating tools for Message Sequence Charts S. Mauw Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands E.A. van der Meulen Dept. of Mathematics and Computing Science, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam,
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/timestamping.ps.Z, 19941115 Time and the Order of Abstract Events in Distributed Computations Twan Basten1, Thomas Kunz2, James Black3, Michael Coffin3, and David Taylor3 1 Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands 2 Department of Computer Science, Technical
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/corrlist.ps.Z, 19941130 1 Temporary Document Original: English ITU Telecommunication Standardization Sector (ITU-TS) Period 1993 -1996 Geneva, 19 - 27 October 1994 Question: 9 (Maintenance of MSC) Study Group 10 Source: Rapporteur Contact: Ekkart Rudolph Siemens AG ZFE BT SE 43 Otto-Hahn-Ring 6 D-81739 M nchen Germany e-mail:
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/modcomp.ps.Z, 19941205 Event Abstraction in Modeling Distributed Computations Twan Basten Department of Mathematics and Computing Science Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-mail: tbasten@win.tue.nl
	ftp://ftp.win.tue.nl/pub/math.prog.construction/monad.ps.Z, 19941208 Monad Decomposition Roland C. Backhouse April 16, 1993 Chapters 7 and 8 of the 1992 STOP proceedings are devoted to the study of closure operators. At the end of chapter 8 a research programme was outlined, a goal of which was to be the derivation of programs on lists as by-products of calculations with
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/ooti/opdr2.ps.Z, 19941213 Exercises PSF Ontwerpersopleiding Technische Informatica, 2J170 Sjouke Mauw, HG7.01, 040-472908, sjouke@win.tue.nl Exercise 3. Specify exponentiation on the naturals. Exercise 4. Consider the specification of the naturals from the course book. Proof div(s(zero); s(zero)) = s(zero). Exercise 5. Consider
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/ooti/assignment.ps.Z, 19941213 Assignment specification methods 1994/1995 Sjouke Mauw, sjouke@win.tue.nl This assignment consists of the development of a system for the regulation of traffic streams at intersections. We start with some terminology. Terminology A signalized intersection is a location where the routes of several
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/ooti/opdr3.ps.Z, 19941213 Exercises PSF Ontwerpersopleiding Technische Informatica, 2J170 Sjouke Mauw, HG7.01, 040-472908, sjouke@win.tue.nl Exercise 7. Consider the situation of N completely connected entities. This means that each two entities can communicate (synchronously) to each other. The entities have to choose among
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/ooti/opdr1.ps.Z, 19941213 Exercises PSF Ontwerpersopleiding Technische Informatica, 2J170 Sjouke Mauw, HG7.01, 040-472908, sjouke@win.tue.nl Exercise 1. Draw the transition graph for processes X, Y and Z defined in the following module. process module ex1 begin atoms a,b,c,d,e,p,q processes X,Y,Z sets of atoms H = {b,d,e}
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/itemlist3.ps.Z, 19941214 1 Delayed Contribution Original: English ITU Telecommunication Standardization Sector (ITU-TS) Period 1993 -1996 Geneva, 19 - 27 October 1994 Question: 9 (Maintenance of MSC) Study Group 10 Source: Rapporteur Contact: Ekkart Rudolph Siemens AG ZFE BT SE 43 Otto-Hahn-Ring 6 D-81739 M nchen Germany
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/itemlist1.ps.Z, 19941219 1 Delayed Contribution Original: English ITU Telecommunication Standardization Sector (ITU-TS) Period 1993 -1996 Geneva, 19 - 27 October 1994 Question: 9 (Maintenance of MSC) Study Group 10 Source: Rapporteur Contact: Ekkart Rudolph Siemens AG ZFE BT SE 43 Otto-Hahn-Ring 6 D-81739 M nchen Germany
	ftp://ftp.win.tue.nl/pub/techreports/josb/propsignals.ps.Z, 19950119 9/1/95 1 Process Algebra with Propositional Signals J.C.M. Baeten Department of Computer Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands and
	ftp://ftp.win.tue.nl/pub/techreports/josb/feedback.ps.Z, 19950123 Process Algebra with Feedback J.C.M. Baeten1 J.A. Bergstra2;3 Gh. Stef>=anescu4 1Department of Computing Science, Eindhoven University of Technology P.O.Box 513, 5600 MB Eindhoven, The Netherlands 2Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/itemlist2.ps.Z, 19950124 1 Delayed Contribution Original: English ITU Telecommunication Standardization Sector (ITU-TS) Period 1993 -1996 Geneva, 19 - 27 October 1994 Question: 9 (Maintenance of MSC) Study Group 10 Source: Rapporteur Contact: Ekkart Rudolph Siemens AG ZFE T SE 4 Otto-Hahn-Ring 6 D-81739 M nchen Germany e-mail:
	ftp://ftp.win.tue.nl/pub/math.prog.construction/AIOchap2a.ps.Z, 19950217 Chapter 2 Relational datatypes and relational programs The goal of this chapter is to introduce relational datatypes and relational programs. This is not a trivial exposition, even though we introduced relations (or, as we called them, specs) extensively in the previous chapter. The situation is similar
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/abstract.ps.Z, 19950301 Delayed choice for process algebra with abstraction P. R. D'Argenio Depto. de Inform atica, Fac. de Cs. Exactas, Universidad Nacional de La Plata. 50 y 115 - 1er. piso. (1900) La Plata. Buenos Aires. Argentina. pedro@info.unlp.edu.ar S. Mauw Dept. of Mathematics and Computing Science, Eindhoven
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/composition.ps.Z, 19950308 1 Message Sequence Chart: Composition Techniques versus OO-Techniques { 'Tema con Variazioni' { Ekkart Rudolpha, Peter Graubmanna, and Jens Grabowskib aSiemens AG, ZFE T SE, Otto-Hahn-Ring 6, 81739 M unchen, Germany bUniversity of Berne, Institut for Informatics , L anggassstr. 51, 3012 Berne,
	ftp://ftp.win.tue.nl/pub/techreports/arie/elate-listing.ps.Z, 19950308 Experiments in Functional Prefix Algebra Arie van Deursen Formal Methods Group, Dept. of Computing Science TU Eindhoven, 5600 MB P.O. Box 513, The Netherlands arie@win.tue.nl, http://www.win.tue.nl/win/cs/fm/arie/index.html March 7, 1995 Contents 1 Introduction 3 2 Standard ACP 4 2.1 Basic Process
	ftp://ftp.win.tue.nl/pub/math.prog.construction/dbpl.ps.Z, 19950314 A database calculus based on strong monads and partial functions Eerke Boiten and Paul Hoogendijk Draft March '95; ext.abs. submitted to 5th DBPL 1 Introduction The research areas of database programming languages and formal program development have a lot to offer to each other. In particular, both
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/msclotos.ps.Z, 19950323 Delayed Contribution Original: English ITU Telecommunication Standardization Sector (ITU-TS) Period 1993-1996 St. Petersburg, 3.- 7. April 1995 Question: 9 (Maintenance of MSC) Study Group 10 Source: Rapporteur Contact: Ekkart Rudolph Siemens AG ZFE T SE 4 Otto-Hahn-Ring 6 D-81739 M nchen Germany
	ftp://ftp.win.tue.nl/pub/techreports/arie/pascal-listing.ps.Z, 19950327 Pascal should be Type Checked; A readable Approach to Formalizing the Static Semantics of Pascal Arie van Deursen August 12, 1994 Contents 1 Syntax 5 1.1 SyntaxLayOut : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 1.2 SyntaxNumbers : : : : : : : : : : : : : : : : : : :
	ftp://ftp.win.tue.nl/pub/techreports/arie/pascal-chapter.ps.Z, 19950327 An Algebraic Specification of the Static Semantics of Pascal Arie van Deursen CWI { P.O. Box 94079, 1090 GB Amsterdam Email: arie@cwi.nl One of the intended purposes of the Asf+Sdf formalism is the easy specification of realistic programming languages. In this case study, we describe and judge an
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/ashptn.ps.Z, 19950327 An Algebraic Semantics for Hierarchical P/T Nets (extended abstract) Twan Basten and Marc Voorhoeve Department of Computing Science, Eindhoven University of Technology, The Netherlands email: ftbasten,wsinmarcg@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/roadmaps1.ps.Z, 19950329 1 Temporary Document Original: English ITU Telecommunication Standardization Sector (ITU-TS) Period 1993 -1996 St. Petersburg, 3 - 7 April 1995 Question: 9 (Maintenance of MSC) Study Group 10 Source: Rapporteur Contact: Ekkart Rudolph Siemens AG ZFE T SE 4 Otto-Hahn-Ring 6 D-81739 M nchen Germany
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/conditions.ps.Z, 19950329 Thoughts on the Meaning of Conditions S. Mauw and M.A. Reniers Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands fsjouke,michelrg@win.tue.nl Draft March 29, 1995
	ftp://ftp.win.tue.nl/pub/techreports/weffers/icse-17/haroldw.ps.Z, 19950406 Formal Methods: Managing Quality and Development H.T.G. Weffers
	ftp://ftp.win.tue.nl/pub/techreports/chrisv/thesis.ps.Z, 19950418 TOOLS FOR PSF TOOLS FOR PSF Academisch Proefschrift ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof. dr. P.W.M. de Meijer in het openbaar te verdedigen in de Aula der Universiteit (Oude Lutherse Kerk, ingang Singel 411, hoek Spui), op
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/fundinf95.ps, 19950427 Axiomatizations of Temporal Logics on Trace Systems Wojciech Penczek Depart. of Computing Science Technical University of Eindhoveny Eindhoven, Den Dolech 2, The Netherlands wojtek@info.win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/lics95.ps.gz, 19950427 Model-Checking of Causality Properties Rajeev Alur Doron Peled Wojciech Penczek AT&T Bell Laboratories Eindhoven University of Technology 600 Mountain Ave. Den Dolech 2, Eindhoven Murray Hill, NJ 07974 , USA The Netherlands alur, doron @ research.att.com wojtek @ win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/concur92.ps, 19950427 Propositional Temporal Logics and Equivalences Ursula Goltz1, Ruurd Kuiper2, Wojciech Penczek3
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/istcs95.ps.gz, 19950427 A Partial Order Approach to Branching Time Logic Model Checking Rob Gerth and Ruurd Kuiper Eindhoven University of Technology Eindhoven, The Netherlands Doron Peled AT&T Bell Laboratories Murray Hill, NJ 07974, USA Wojciech Penczek Eindhoven University of Technology Eindhoven, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/polo95.ps, 19950427 Branching Time and Partial Order in Temporal Logics Wojciech Penczek Institute of Computer Science Polish Academy of Sciences Ordona 21, 01-237 Warsaw, Poland
	ftp://ftp.win.tue.nl/pub/techreports/hurkens/clicover.ps.Z, 19950510 Approximation Algorithms for the k-Clique Covering Problem Olivier Goldschmidt Dorit S. Hochbaumy Cor Hurkensz Gang Yux May 10, 1995
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/fsttcs95.ps.gz, 19950515 On the Connection of Partial Order Logics and Partial Order Reduction Methods Peter Niebert1 and Wojciech Penczek2 1 Institut f ur Informatik Universit at Hildesheim niebert@informatik.uni-hildesheim.de 2 Dept. of Computer Science Eindhoven University of Technology wojtek@info.win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/pstv95.ps, 19950515 Using Asynchronous B uchi Automata for Efficient Automatic Verification of Concurrent Systems Doron Peled AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974, USA doron@research.att.com Wojciech Penczek y Technical University of Eindhoven Den Dolech 2, HG 7.12 Eindhoven, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/ictl94.ps, 19950515 A Hierarchy of Partial Order Temporal Properties Marta Kwiatkowska Dept. of Math. and Comp. Science University of Leicester Leicester LE1 7RH, UK mzk@uk.ac.le.mcs Doron Peled AT&T Bell Laboratories 600 Mountain Avenue, POB 636 Murray Hill, NJ 07974-0636, USA doron@research.att.com Wojciech Penczeky
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/ijfcs93.ps.gz, 19950515 TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION WOJCIECH PENCZEK1 Institute of Computer Science, Polish Academy of Sciences Warsaw, ul. Ordona 21, Poland Received Revised
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/report94-52.ps.gz, 19950515 Traces and Logic Wojciech Penczeky Institute of Computer Science Polish Academy of Sciences Ordona 21, 01-237 Warsaw, Poland penczek@wars.ipipan.waw.pl Ruurd Kuiperz Eindhoven University of Technology Department of Mathematics and Computing Science P.O. Box 513, 5600 MB Eindhoven, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/wojtek/ipl92.ps.gz, 19950515 On Undecidability of Propositional Temporal Logics on Trace Systems Wojciech Penczek Institute of Computer Science, Polish Academy of Sciences 00-901 Warsaw, PKiN, P.O. Box 22, Poland May 15, 1995 Keywords: Undecidability; Partial Order Temporal Logics; Concurrency; Trace Systems; 1 Introduction Partial
	ftp://ftp.win.tue.nl/pub/techreports/schols/scpp-a.ps, 19950517 The design problem SCPP-A Charles E. Molnar SUN Microsystems Laboratories Mountain View, CA Huub Schols Department of Mathematics and Computing Science Eindhoven University of Technology Eindhoven, The Netherlands April 29, 1995 1 Introduction In this monograph we present a specification of the design
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/continuity.ps, 19950531 Continuity properties of solutions to H2 and H1 Riccati equations A.A. Stoorvogel A. Saberi Dept. of Mathematics and Comp. Science School of Electrical Engineering Eindhoven University of Technology and Computer Science P.O. Box 513 Washington State University 5600 MB Eindhoven Pullman, WA 99164-2752
	ftp://ftp.win.tue.nl/pub/techreports/arie/financial.ps.Z, 19950602 An Algebraic Specification of a Language for Describing Financial Products B.R.T. Arnold Bank MeesPierson, Rotterdam; and CAP Volmac, Utrecht P.O. Box 2575, 3500 GN Utrecht, The Netherlands A. van Deursen Department of Mathematics and Computing Science TU Eindhoven, 5600 MB P.O. Box 513, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/zwaan/sublin.300dpi.ps.gz, 19950607 Eindhoven University of Technology Department of Mathematics and Computing Science A taxonomy of sublinear multiple keyword pattern matching algorithms by B.W. Watson and G.Zwaan 95/13 ISSN 0926-4515 All rights reserved editors: prof.dr. J.C.M. Baeten prof.dr. M. Rem Computing Science Report 95/13
	ftp://ftp.win.tue.nl/pub/techreports/zwaan/sublin.600dpi.ps.gz, 19950607 Eindhoven University of Technology Department of Mathematics and Computing Science A taxonomy of sublinear multiple keyword pattern matching algorithms by B.W. Watson and G.Zwaan 95/13 ISSN 0926-4515 All rights reserved editors: prof.dr. J.C.M. Baeten prof.dr. M. Rem Computing Science Report 95/13
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/222.ps, 19950616 A constraint satisfaction approach to the radio link frequency assignment problem. 2.2 Work Element 2.2.2 Constraint satisfaction. Constraint satisfaction is a solution approach developed for feasibility problem instances (i.e. problem instances for which the objective is to find one or all feasible
	ftp://ftp.win.tue.nl/pub/techreports/arie/elate.ps.Z, 19950621 Axiomatizing Early and Late Input by Variable Elimination Arie van Deursen Formal Methods Group, Dept. of Computing Science TU Eindhoven, 5600 MB P.O. Box 513, The Netherlands arie@win.tue.nl, http://www.win.tue.nl/win/cs/fm/arie/ 15 January, 1995
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/T221B.ps.gz, 19950705 EUCLID CALMA Radio Link Frequency Assignment Project Technical Annex T-2.2.1.B: Combinatorial Lower Bounds for the RLFAP Sergey Tiourine Cor Hurkens Jan Karel Lenstra Eindhoven RLFAP Group Department of Mathematics and Computing Science Eindhoven University of Technology
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/T232a.ps.gz, 19950714 EUCLID CALMA Technical Report GRAPH: a test case generator, Generating Radiolink frequency Assignment Problems Heuristically TU Delft RLFAP Group J. Warners T. Terlaky C. Roos B. Jansen A. Hipolito H. van Benthem Faculty of Technical Mathematics and Informatics T.U. Delft, the Netherlands February 24,
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/T221A.ps.gz, 19950714 EUCLID CALMA Radio Link Frequency Assignment Project Technical Annex T-2.2.1 A: A Branch-and-Cut Algorithm for the Frequency Assignment Problem K.I. Aardal A. Hipolito C.P.M. van Hoesel B. Jansen C. Roos T. Terlaky T.U. Eindhoven RLFAP Group T.U. Delft RLFAP Group
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/232a.ps.gz, 19950714 EUCLID CALMA Radio Link Frequency Assignment Project Supplemental Report 2.3.2a: GRAPH A Test Problem Generator for the Radiolink Frequency Assignment Problem TU Delft RLFAP Group J. Warners T. Terlaky C. Roos B. Jansen A. Hipolito H. van Benthem Faculty of Technical Mathematics and Informatics T.U.
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/221.ps.gz, 19950714 EUCLID CALMA Radio Link Frequency Assignment Project Report 2.2.1: Implementation and Testing of Polyhedral Techniques and Interior Point Methods K.I. Aardal A. Hipolito C.P.M. van Hoesel B. Jansen C. Roos T. Terlaky T.U. Eindhoven RLFAP Group T.U. Delft RLFAP Group 1 Object Many military decisions can
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/T232.ps.gz, 19950714 EUCLID CALMA Radio Link Frequency Assignment Project Technical Annex T-2.3.2: Potential Reduction Methods T.U. Delft RLFAP group H. van Benthem A. Hipolito B. Jansen C. Roos T. Terlaky J. Warners Faculty of Technical Mathematics and Informatics Delft University of Technology
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/232.ps.gz, 19950714 EUCLID CALMA Radio Link Frequency Assignment Project Report 2.3.2: Potential Reduction Methods T.U. Delft RLFAP Group H. van Benthem A. Hipolito B. Jansen C. Roos T. Terlaky J. Warners Faculty of Technical Mathematics and Informatics Delft University of Technology 1 Object Many military decisions can be
	ftp://ftp.win.tue.nl/pub/techreports/hurkens/bcsmsp.ps.Z, 19950724 A Time-Indexed Formulation for Single-Machine Scheduling Problems: Branch-and-Cut J.M. van den Akker Center for Operations Research and Econometrics Catholic University of Louvain Voie du Roman Pays 34, 1348 Louvain-la-Neuve, Belgium C.A.J. Hurkens Department of Mathematics and Computing Science
	ftp://ftp.win.tue.nl/pub/techreports/severi/defs.ps.Z, 19950725 Pure Type Systems with definitions Paula Severi Erik Poll September 1993
	ftp://ftp.win.tue.nl/pub/techreports/severi/cwimain.ps.Z, 19950725 On Normalisation Femke van Raamsdonk CWI P.O. Box 94079, 1090 GB Amsterdam The Netherlands femke@cwi.nl Paula Severi Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands severi@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/Stoo_s1.ps, 19950726 The discrete algebraic Riccati equation and linear matrix inequality A.A. Stoorvogel A. Saberi Dept. of Mathematics and Comp. Science School of Electrical Engineering Eindhoven University of Technology and Computer Science P.O. Box 513 Washington State University 5600 MB Eindhoven Pullman, WA 99164-2752
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/Stoo_a24.ps, 19950726 The H1 control problem with zeros on the boundary of the stability domain A.A. Stoorvogel Dept. of Mathematics and Comp. Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands E-mail: wscoas@win.tue.nl July 26, 1995
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/Stoo_a23.ps, 19950726 H2 and H1 Almost Disturbance Decoupling Problem with Internal Stability Ali Saberi Zongli Lin Anton A. Stoorvogel School of Electr. Eng. and Comp. Science Dept. of Applied Math. and Statistics Dept. of Math. and Comp. Science Washington State University SUNY at Stony Brook Eindhoven Univ. of Technology
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/Stoo_s2.ps, 19950726 Semi-Global Stabilization of Linear Discrete-Time Systems Subject to Input Saturation via Linear Feedbacks \| An ARE-Based Approach Zongli Lin Ali Saberi Anton A. Stoorvogel Dept. of Applied Mathematics School of Electrical Engineering Department of Mathematics and Statistics and Computer Science and
	ftp://ftp.win.tue.nl/pub/techreports/josb/dttau.ps.Z, 19950814 14 August 1995 1 Discrete Time Process Algebra with Abstraction J.C.M. Baeten Department of Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The
	ftp://ftp.win.tue.nl/pub/techreports/josb/dtpa:arp.ps.Z, 19950814 14 June 1995 1 Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time J.C.M. Baeten Department of Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/overview.ps, 19950822 An overview of algorithmic approaches to frequency assignment problems Sergey Tiourine, Cor Hurkens, Jan Karel Lenstra Eindhoven University of Technology August 15, 1995 1. Introduction In the context of the EUCLID program for EUropean Cooperation on the Long term In Defence", six research groups from
	ftp://ftp.win.tue.nl/pub/techreports/arie/picalc.ps.Z, 19950825 A Simple ss-Calculus Manipulation Tool Arie van Deursen1; Formal Methods Group, Dept. of Computing Science TU Eindhoven, 5600 MB P.O. Box 513, The Netherlands arie@win.tue.nl, http://www.win.tue.nl/win/cs/fm/arie/
	ftp://ftp.win.tue.nl/pub/techreports/arie/autogids.ps.gz, 19950830 Formele Methoden voor uw eigen Applicatietaal De automatiseringswereld kent een overvloed aan talen. Aktiviteiten als programmeren (CO- BOL, C, Pascal), specificeren (VDM, COLD, Z), systeembeheer (DOS of Unix shell, Perl) worden vaak gekenmerkt door de taal die gebruikt wordt. Hier komt nog bij dat veel
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/calma-tno-at-95c.ps.gz, 19950911 The Weapon-Target Assignment Problem Alexander Toet Huub de Waard February 3, 1995 CALMA Report CALMA.TNO.WP31.AT.95c 1 2 CONTENTS Page SUMMARY 3 SAMENVATTING 4 1 INTRODUCTION 5 2 PROBLEM DESCRIPTION 5 2.1 General Problem 6 2.2 Maximizing the surviving value 6 2.3 Minimizing the threat 8 2.4
	ftp://ftp.win.tue.nl/pub/techreports/josb/dtcalc.ps.Z, 19950912 Some Simple Calculations in Relative Discrete Time Process Algebra J.C.M. Baeten Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/book.ps, 19950920 The H1 control problem: a state space approach A.A. Stoorvogel Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor U.S.A. September 20, 1995 Contents Preface v 1 Introduction 1 1.1 Robustness analysis : : : : : : : : : : : : : : : : : : : : : 1 1.2 The H1 control
	ftp://ftp.win.tue.nl/pub/techreports/josb/dtpa.ps.Z, 19950929 1 Discrete Time Process Algebra J.C.M. Baeten Department of Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands J.A. Bergstra Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands and Department of
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/MSCtoolslong.ps.Z, 19951003 Specification of tools for Message Sequence Charts S. Mauw E. A. van der Meuleny Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands, email: sjouke@win.tue.nl yDept. of Mathematics and Computing Science, University of
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/psflib.ps.Z, 19951003 A PSF library of data types S. Mauw J. C. Mulder Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands, email: fsjouke,hansmg@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/delsbwas.ps.Z, 19951003 Delayed choice for process algebra with abstraction P. R. D'Argenio1 and S. Mauw2 1 Depto. de Inform atica, Fac. de Cs. Exactas, Universidad Nacional de La Plata. CC 11 (1900) La Plata. Buenos Aires. Argentina. pedro@info.unlp.edu.ar 2 Dept. of Mathematics and Computing Science, Eindhoven University of
	ftp://ftp.win.tue.nl/pub/techreports/malo/substitOp.ps, 19951013 Operator substitution M.L.J. Hautus Department of Mathematics and Computing Science Eindhoven University of Technology October 13, 1995
	ftp://ftp.win.tue.nl/pub/techreports/malo/SubstitAlg.ps, 19951013 Substitution of matrices over rings M.L.J. Hautus Department of Mathematics and Computing Science Eindhoven University of Technology October 13, 1995 To Jaap Seidel, who taught me that linear algebra is interesting and has unexpected and elegant applications in many fields.
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-34.ps, 19951018 Upper and lower bounding techniques for frequency assignment problems C.A.J. Hurkens S.R. Tiourine Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands e-mail: sergeyt@win.tue.nl July 17, 1995
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-19.ps, 19951018 Memorandum COSOR 95-19, 1995, Eindhoven University of Technology A polyhedral approach to the delivery man problem C.A. van Eijl
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-23.ps, 19951018 Memorandum COSOR 95-23, 1995, Eindhoven University of Technology MULTI-LAYERED PERCEPTRONS FOR ON-LINE LOT SIZING (EXTENDED ABSTRACT) H.P. Stehouwer1, E.H.L. Aarts1;2, and J. Wessels1;3 1 Eindhoven University of Technology, Department of Mathematics and Computing Science P.O. Box 513, NL-5600 MB
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-03.ps, 19951018 Memorandum COSOR 95-03, 1995, Eindhoven University of Technology Some new designs for quantitative factors E.E.M. van Berkum Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands P.M. Upperman Quality Engineering Consultancy
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-11.ps, 19951018 Memorandum COSOR 95-11, 1995, Eindhoven University of Technology A NOTE ON A FLUID QUEUE DRIVEN BY AN M=M=1 QUEUE IVO ADAN AND JACQUES RESING
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-28.ps, 19951018 Memorandum COSOR 95-28, 1995, Eindhoven University of Technology On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs C.A. van Eijl and C.P.M. van Hoesely
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-14.ps, 19951018 Memorandum COSOR 95-14, 1995, Eindhoven University of Technology ON SELECTING THE BEST OF TWO NORMAL POPULATIONS USING A LOSS FUNCTION Paul van der Laan Constance van Eeden Eindhoven University of Technology University of British Columbia P.O. Box 513 Universit e du Qu ebec a Montr eal 5600 MB Eindhoven
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-09.ps, 19951018 Memorandum COSOR 95-09, 1995, Eindhoven University of Technology The change of traffic characteristics in ATM networks 2 J.L. van den Berg PTT Research P.O. Box 421, 2260 AK Leidschendam The Netherlands E.B. Diks, J.A.C. Resing and J. van der Wal Department of Mathematics and Computing Science Eindhoven
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-17.ps, 19951018 Memorandum COSOR 95-17, 1995, Eindhoven University of Technology A curious implication of Spitzers identity F.W. Steutel, T.U. Eindhoven
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-22.ps, 19951018 Memorandum COSOR 95-22, 1995, Eindhoven University of Technology Scheduling by positional completion times Han Hoogeveeny Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands Steef van de Velde Department of Mechanical
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-10.ps, 19951018 Memorandum COSOR 95-10, 1995, Eindhoven University of Technology Heuristic Methods for Machine Scheduling Problems with Processor Sets: A Computational Investigation Roberto Lioce Carlo Martini University of Bologna March 1995 1 Introduction In this research we have considered a general scheduling
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-29.ps, 19951018 Memorandum COSOR 95-29, 1995, Eindhoven University of Technology Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine Dedicated to the memory of Gene Lawler Hans Kellerer y Thomas Tautenhahn z Gerhard J. Woeginger x
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-05.ps, 19951018 Output Regulation for Linear Discrete-Time Systems Subject to Input Saturation Ravi Mantri & Ali Saberi Zongli Lin Anton A. Stoorvogel School of Electrical Engineering Dept. of Applied Mathematics Dept. of Mathematics and Computer Science and Statistics and Computing Science Washington State University
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-04.ps, 19951018 Memorandum COSOR 95-04, 1995, Eindhoven University of Technology Approximate and exact designs for incomplete quadratic models B. Pauwels UFSIA University of Antwerp Prinsstraat 13, 2000 Antwerpen, Belgium E.E.M. van Berkum Department of Mathematics Eindhoven University of Technology, 5600 MB Eindhoven,
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-24.ps, 19951018 Memorandum COSOR 95-24, 1995, Eindhoven University of Technology A Time-Indexed Formulation for Single-Machine Scheduling Problems: Branch-and-Cut J.M. van den Akker Center for Operations Research and Econometrics Catholic University of Louvain Voie du Roman Pays 34, 1348 Louvain-la-Neuve, Belgium
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-06.ps, 19951018 Observability of saturated systems with an offset M.L.J. Hautus Department of Mathematics and Computing Science Eindhoven University of Technology 1 Introduction and problem formulation In , the problem of observability of systems with output saturation was considered. (See also and .) In this
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-08.ps, 19951018 Memorandum COSOR 95-08, 1995, Eindhoven University of Technology A fluid flow model of an ATM traffic shaper J.L. van den Berg , E.B. Diks , J.A.C. Resing and J. van der Wal
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-07.ps, 19951018 Continuity properties of solutions to H2 and H1 Riccati equations A.A. Stoorvogel A. Saberi Dept. of Mathematics and Comp. Science School of Electrical Engineering Eindhoven University of Technology and Computer Science P.O. Box 513 Washington State University 5600 MB Eindhoven Pullman, WA 99164-2752
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-16.ps, 19951018 Memorandum COSOR 95-16, 1995, Eindhoven University of Technology Approximation Algorithms for the k-Clique Covering Problem Olivier Goldschmidt Dorit S. Hochbaumy Cor Hurkensz Gang Yux May 10, 1995
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-21.ps, 19951018 Memorandum COSOR 95-21, 1995, Eindhoven University of Technology Earliness-tardiness scheduling around almost equal due dates J.A. Hoogeveen Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands S.L. van de Velde Department of
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-35.ps, 19951018 Memorandum COSOR 95-35, 1995, Eindhoven University of Technology Parallel machine scheduling by column generation J.M. van den Akker Center for Operations Research and Econometrics Universit e Catholique de Louvain 1348 Louvain-la-Neuve, Belgium J.A. Hoogeveen Department of Mathematics and Computing
	ftp://ftp.win.tue.nl/pub/techreports/vaessens/lst1.ps.gz, 19951020 A Local Search Template (Extended Abstract) R.J.M. Vaessens1, E.H.L. Aarts2;1, J.K. Lenstra1;3 1: Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven 2: Philips Research Laboratories, P.O. Box 80000, 5600 JA Eindhoven 3: CWI, P.O. Box
	ftp://ftp.win.tue.nl/pub/techreports/vaessens/lst2.ps.gz, 19951020 A Local Search Template R.J.M. Vaessens1, E.H.L. Aarts2;1, J.K. Lenstra1;3 1: Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven 2: Philips Research Laboratories, P.O. Box 80000, 5600 JA Eindhoven 3: CWI, P.O. Box 4079, 1009 AB Amsterdam
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/24.ps.gz, 19951030 1 EUCLID PROGRAM CALMA Project Report 2.4: Parallelism in Combinatorial Optimisation UEA CALMA Group School of Information Systems University of East Anglia, Norwich, UK September 18, 1995 2 Contents 1 Introduction 9 2 Classification of Parallel Machines 13 3 Measuring Parallel Processor Performance 25
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/T212B.ps.gz, 19951030 1 Athanassos Kapsalis Jason W. Mann George D. Smith , UK UEA CALMA Group School of Information Systems University of East Anglia EUCLID CALMA Radio Link Frequency Assignment Project Technical Annexe T- 2.1:B - The GAmeter User Manual 2 ffl ffl select merge create Open Problem Save Solution GAmeter User
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/212.ps.gz, 19951030 1 George D. Smith Athanassos Kapsalis Victor J. Rayward-Smith , UK Antoon Kolen EUCLID CALMA Radio Link Frequency Assignment Project Report 2.1. - Implementation and Testing of Genetic Algorithm Approaches UEA CALMA Group School of Information Systems University of East Anglia LU RLFAP Group Faculty of
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/211.ps.gz, 19951030 Contents UEA CALMA Group May 5, 1995 Progress Report: Genetic Algorithm Approaches to Solving the Radio Link Frequency Assignment Problem 1 Introduction 2 2 General Background 2 3 Progress - Sub Programme 2.1 8 4 Summary 20 5 Conclusions 21 6 Recommendations 23 A The Technical Annexe 24 2.1 Global
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/T212A.ps.gz, 19951030 1 George D. Smith Athanassos Kapsalis Victor J. Rayward-Smith , UK Antoon Kolen EUCLID CALMA Radio Link Frequency Assignment Project Technical Annexe T- 2.1:A - Supplementary Report UEA CALMA Group School of Information Systems University of East Anglia LU RLFAP Group Faculty of Economics and Business
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/booklet.ps, 19951103 CALMA Booklet Institution : Eindhoven University of Technology Postal adress : P.O. Box 513, 5600 MB Eindhoven, The Netherlands Name : Dr. ir. C.P.M. Van Hoesel Phone number : +31 40 474268 Fax number : +31 40 465995 e-mail : hoesel@win.tue.nl Institution : Eindhoven University of Technology Postal
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-37.ps, 19951106 Memorandum COSOR 95-37, 1995, Eindhoven University of Technology Nonstrict vector summation in multi-operation scheduling Sergey Sevastianov y
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-33.ps, 19951106 Memorandum COSOR 95-33, 1995, Eindhoven University of Technology Unit-time Open-shop Scheduling Problems with Symmetric Objective Functions N.V. Shakhlevich Academy of Sciences of Belarus Surganov Street 6, 220012 Minsk, Belarus
	ftp://ftp.win.tue.nl/pub/techreports/laan/csn95_18.ps.gz, 19951114 A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths Fairouz Kamareddine Department of Computing Science University of Glasgow 17 Lilybank Gardens, Glasgow G12 8QQ, Scotland e-mail fairouz@dcs.gla.ac.uk Twan Laany Department of Mathematics and Computing Science Eindhoven University
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-39.ps, 19951114 Memorandum COSOR 95-39, 1995, Eindhoven University of Technology Optimal on-line algorithms for single-machine scheduling J.A. Hoogeveen A.P.A. Vestjens Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB, Eindhoven, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/laan/csn94_33.ps.gz, 19951114 A formalization of the Ramified Type Theory Twan Laan Co-operation Centre Tilburg and Eindhoven Universities Eindhoven University of Technology Department of Mathematics and Computing Science P.O.Box 513, 5600 mb Eindhoven, The Netherlands e-mail laan@win.tue.nl November 14, 1995
	ftp://ftp.win.tue.nl/pub/techreports/laan/csn94_14.ps.gz, 19951114 Ups and Downs of Type Theory W. Peremansy A global historical sketch of the development of formalized type theory in the 20th century will be given. No surprising historical insights will be presented as all the items discussed can be found in the current literature. In the beginning of the 20th
	ftp://ftp.win.tue.nl/pub/techreports/vestjens/94-35.ps.gz, 19951115 Memorandum COSOR 94-35, 1994, Eindhoven University of Technology Scheduling uniform machines on-line requires nondecreasing speed ratios Arjen Vestjens Eindhoven University of Technology Department of Mathematics and Computing Science P.O.Box 513, 5600 MB, Eindhoven arjenv@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/severi/ptsw.ps.Z, 19951116 Pure Type Systems without the -condition Paula Severi Eindhoven University of Technology Den Dolech 2 Postbus 513 5600 MB Eindhoven The Netherlands e-mail severi@win.tue.nl
	ftp://ftp.win.tue.nl/pub/math.prog.construction/reductivity.ps.Z, 19951117 Reductivity Henk Doornbos and Roland Backhouse Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands The notion of reductivity of a relation with respect to a datatype is introduced and related to inductivity and initiality. The use of reductivity in
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-38.ps, 19951117 Memorandum COSOR 95-38, 1995, Eindhoven University of Technology Long-Chord-Free and Fence-Free Tours for the Travelling Salesman Problem Dedicated to the memory of Dimitry A. Suprunenko Vladimir G. De>= neko y Gerhard J. Woeginger z
	ftp://ftp.win.tue.nl/pub/techreports/arie/pschrift.ps.gz, 19951129 Executable Language Definitions \| Case Studies and Origin Tracking Techniques \| ILLC Dissertation Series 1994-5 institute for logic, language and computation For further information about ILLC-publications, please contact Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage
	ftp://ftp.win.tue.nl/pub/techreports/janjoris/HybridSystemsAbstract.ps.gz, 19951130 A Process Algebra for Hybrid Systems Jan Joris Vereijken Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands http://www.win.tue.nl/win/cs/fm/janjoris/ janjoris@acm.org May 10, 1995 1 Introduction The work that is presented here was
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/233.ps.gz, 19951201 EUCLID CALMA Radio Link Frequency Assignment Project Report 2.3.3 Local search T.U. Eindhoven RLFAP Group December 1, 1995 1 Object Many military decisions can be formulated as combinatorial optimization problems. Such examples include ffl weapons-targets assignments, ffl areas to military units
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/T233.ps, 19951201 EUCLID CALMA Radio Link Frequency Assignment Project Technical Annex T-2.3.3: Local search T.U. Eindhoven RLFAP Group December 1, 1995
	ftp://ftp.win.tue.nl/pub/techreports/dignum/reason.ps, 19951206 Defeasible Reasoning with Legal Rules in a Deontic Logic based on Preferences Lamb er Royakkers Dept. of Legal Informatics Tilburg University P.O.box 90153, 5000 LE Tilburg L.M.M.Royakkers@kub.nl Frank Dignum Dept. of Mathematics and Computer Science Eindhoven University of Technology P.O.box 513, 5600
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/tno_wp31_c.ps.gz, 19951211 The Weapon-Target Assignment Problem Alexander Toet Huub de Waard February 24, 1994 CALMA Report CALMA.TNO.WP31.AT.95c 1 2 CONTENTS Page SUMMARY 3 SAMENVATTING 4 1 INTRODUCTION 5 2 PROBLEM DESCRIPTION 5 2.1 General Problem 6 2.2 Maximizing the surviving value 6 2.3 Minimizing the threat 8 2.4
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/tno_wp31_b.ps.gz, 19951211 Target Detection and Recognition through Contour Matching Alexander Toet December 5, 1994 CALMA Report CALMA.TNO.WP31.AT.95b 1 2 CONTENTS Page SUMMARY 4 SAMENVATTING 5 1 INTRODUCTION 5 1.1 Model-based Target Recognition 5 1.2 Deductive Approach 6 1.3 Inductive Approach 6 1.4 Genetic Optimization 8 2
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/tno_wp31_a.ps.gz, 19951211 Combinatorial Optimization and Image Analysis: a literature survey. Alexander Toet December 11, 1995 CALMA Report CALMA.TNO.WP31.AT.95a 1 2 CONTENTS Page SUMMARY 3 SAMENVATTING 4 1 INTRODUCTION 5 2 COMBINATORIAL OPTIMIZATION TECHNIQUES 6 2.1 Local Search 6 2.2 Simulated Annealing 6 2.3 Genetic
	ftp://ftp.win.tue.nl/pub/techreports/CALMA/tno_wp31_d.ps.gz, 19951211 The Multitarget/Multisensor Tracking Problem Alexander Toet, Huub de Waard 11 April 1995 CALMA Report CALMA.TNO.WP31.AT.95d 1 2 CONTENTS Page SUMMARY 3 SAMENVATTING 4 1 INTRODUCTION 5 2 THE MULTITARGET/MULTISENSOR TRACKING PROBLEM 5 3 THE MULTIDIMENSIONAL ASSIGNMENT FORMULATION 7 4 CONCLUDING REMARKS 11
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-40.ps, 19951218 Memorandum COSOR 95-40, 1995, Eindhoven University of Technology The Response Time Distribution in a Multi-Processor Database with Single Queue Static Locking 1 M.P. Bodlaender, S.A.E. Sassen, P.D.V. van der Stok and J. van der Wal Department of Mathematics and Computing Science Eindhoven University of
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/ashptn-fv.ps.Z, 19960108 An Algebraic Semantics for Hierarchical P/T Nets Twan Basten and Marc Voorhoeve Department of Computing Science, Eindhoven University of Technology, The Netherlands email: ftbasten,wsinmarcg@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msctutorial.ps.Z, 19960110 1 Tutorial on Message Sequence Charts Ekkart Rudolpha, Peter Graubmannb, and Jens Grabowskic aTechnical University of Munich, Institute for Informatics, Arcisstrasse 21, D-80290 M unchen, Germany, eMail: rudolphe@informatik.tu-muenchen.de bSiemens AG, ZFE T SE, Otto-Hahn-Ring 6, D-81739 M unchen,
	ftp://ftp.win.tue.nl/pub/techreports/arie/pascal.ps.gz, 19960110 Language Prototyping An Algebraic Specification Approach DRAFT!! version: January 10, 1996 Arie van Deursen Jan Heering Paul Klint (editors) All chapters are in draft status. Comments are welcome; contact arie@win.tue.nl, jan@cwi.nl, paulk@cwi.nl, dinesh@cwi.nl, emma@fwi.uva.nl, tip@watson.ibm.com,
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/formalization.ps.Z, 19960110 1 The formalization of Message Sequence Charts S. Mauwa a Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. E-mail: sjouke@win.tue.nl We discuss the state of affairs with respect to the formalization of Message Sequence
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/stability15.ps, 19960112 Rational Representations of Behaviors: Well-posedness, Stability and Stabilizability Siep Weiland Department of Electrical Engineering Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands Anton Stoorvogel Department of Mathematics and Computing Science Eindhoven University
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/minutes_april_95.ps.Z, 19960116 1 ITU - Telecommunication Standardization Sector Temporary Document STUDY GROUP 10 Original: English _________________________ Meeting: St. Petersburg 3. - 7. April 1995 Question(s): 9/10 SOURCE: Rapporteur Q9 TITLE: Minutes Question 9/10 (Grafik Posledovatelnosti Isvestij ) 2 1. Introduction A joint
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/minutes_sept_95.ps.Z, 19960116 1 ITU - Telecommunication Standardization Sector Temporary Document STUDY GROUP 10 Original: English _________________________ Meeting: Geneva 6. 14. September 1995 Question(s): 9/10 SOURCE: Rapporteur Q9 TITLE: Minutes Question 9/10 2 1. Agenda/Schedule (TD 13) Date AM=9:00-12:30 PM=14:00-17:30 7. Sep
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/minutes_internet_95.ps.Z, 19960117 1 ITU - Telecommunication Standardization Sector TD11 STUDY GROUP 10 Original: English _________________________ Meeting: MSC Internet Meeting 10. 14. July 1995 Question(s): 9/10 SOURCE: Associate Rapporteur Q9 Structural Concepts TITLE: Minutes of MSC Internet Meeting on Semantics of Conditions 2 1.
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-03.ps, 19960118 Memorandum COSOR 96-03, 1996, Eindhoven University of Technology Minimizing total weighted completion time in a proportionate flow shop Natalia Shakhlevich Academy of Sciences of Belarus Surganov Street 6, 220012 Minsk, Belarus Han Hoogeveen Department of Mathematics and Computing Science Eindhoven
	ftp://ftp.win.tue.nl/pub/techreports/tiourine/2.2.3.ps, 19960202 EUCLID CALMA COMBINATORIAL ALGORITHMS FOR MILITARY APPLICATIONS REPORT n 2.3.2 Potential Reduction Method 1 - OBJECT A lot of military decisions may be formalized like combinatorial optimization problems : for instance, weapons-targets assignments, areas to military units assignments, cargo-loadings and
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/leprotocol.ps.Z, 19960202 Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks Jacob Brunekreef Programming Research Group University of Amsterdam Kruislaan 403, 1098 SJ Amsterdam, The Netherlands jacob@fwi.uva.nl Joost-Pieter Katoen Dept. of Computing Science University of Twente P.O. Box 217, 7500 AE
	ftp://ftp.win.tue.nl/pub/techreports/tiourine/T-2.2.3.ps, 19960202 EUCLID CALMA Combinatorial Algorithms for Military Applications Report 2.2.3 Simulated Annealing ONERA-CERT-DERI EUCLID CALMA Combinatorial Algorithms for Military Applications Technical Annex Report 2.2.3 Partial Constraint Satisfaction Technique Technical Annex CHAPTER I ____________ Feasible and
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-04.ps, 19960213 Memorandum COSOR 96-04, 1996, Eindhoven University of Technology STRONG TIME-CONSISTENCY IN THE CARTEL-VERSUS-FRINGE MODEL Fons Groot Institute for Environmental Studies, Free University Amsterdam Cees Withagen Eindhoven University of Technology and Tinbergen Institute Aart de Zeeuw Department of
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/paaa.ps.Z, 19960214 Process Algebra with Autonomous Actions Marc Voorhoeve and Twan Basten Eindhoven University of Technology email:fwsinmarc,tbasteng@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/vacature.ps.Z, 19960220 A { Title, summary and requested support 1. Title Methodology and Application of Message Sequence Charts 2. Proposers Prof. dr. ir. L.M.G. Feijs and Dr. S. Mauw. Section Formal Methods, Department of Mathematics and Computing Science Eindhoven University of Technology, Postbus 513, 5600 MB Eindhoven.
	ftp://ftp.win.tue.nl/pub/techreports/dignum/ismis96.ps, 19960222 Meeting the deadline: on the formal specification of temporal deontic constraints F.Dignum1, H. Weigand and E. Verharen2 1 Fac. of Maths. & Comp. Sc., Eindhoven University of Technology, The Netherlands 2 Infolab, Tilburg University, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-05.ps, 19960227 Memorandum COSOR 96-05, 1996, Eindhoven University of Technology
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-08.ps, 19960227 Memorandum COSOR 96-08, 1996, Eindhoven University of Technology General equilibrium in infinite dimensional economies; a truncation approach Stef van Eijndhoven Jan van Geldrop Cees Withagen Mailing address: Eindhoven University of Technology Department of Mathematics and Computing Science P.O. Box 513
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-06.ps, 19960227 Memorandum COSOR 96-06, 1996, Eindhoven University of Technology Subset Selection from Type-I and Type-II Generalized Logistic Populations Mark J. van der Laan1, Paul van der Laan2 Division of Biostatistics1 University of California, Berkeley Department of Mathematics and Computer Science2 Eindhoven
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-07.ps, 19960227 Memorandum COSOR 96-07, 1996, Eindhoven University of Technology Distributional and efficiency results for subset selection Paul van der Laan Eindhoven University of Technology Department of Mathematics and Computing Science The Netherlands Summary Assume k (k >= 2) populations are given. The associated
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/bbe.ps.Z, 19960228 Branching bisimilarity is an equivalence indeed! Twan Basten Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands This note presents a detailed proof of a result in the theory of concurrency semantics that is already
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/minutes_munich_96.ps.Z, 19960304 1 Delayed Contribution Original: English ITU Telecommunication Standardization Sector (ITU-TS) Period 1993 -1996 Geneva, 10 -18 April 1996 Question: 9 (Maintenance of MSC) Study Group 10 Source: Rapporteur Contact: Ekkart Rudolph Technische Universit t M nchen Institut f r Informatik Arcisstr. 21
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/palci.ps.Z, 19960306 A Process-Algebraic Approach to Life-Cycle Inheritance Inheritance D Encapsulation C Abstraction T. Basten and W.M.P. van der Aalst Department of Mathematics and Computing Science Eindhoven University of Technology, The Netherlands email: ftbasten,wsinwag@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/tbasten/lcipn.ps.Z, 19960306 Life-Cycle Inheritance A Petri-Net-Based Approach W.M.P. van der Aalst and T. Basten Department of Mathematics and Computing Science Eindhoven University of Technology, The Netherlands email: fwsinwa,tbasteng@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/vestjens/96-11.ps.gz, 19960313 Memorandum COSOR 96-11, 1996, Eindhoven University of Technology Scheduling on identical machines: How good is lpt in an on-line setting Bo Chen Arjen P.A. Vestjens March 13, 1996
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-10.ps, 19960313 Memorandum COSOR 96-10, 1996, Eindhoven University of Technology Generalized Controlled Invariance for Nonlinear Systems H.J.C. Huijbertsy C.H. Moogz R. Andiartix November 7, 1994. Revised July 25, 1995 and March 12, 1996
	ftp://ftp.win.tue.nl/pub/techreports/cosor/95-13.ps, 19960313 Memorandum COSOR 95-13, 1995, Eindhoven University of Technology Routing Control of a Motorway Network - A Summary H.J.C. Huijberts Dept. of Math. and Comp. Sc. Eindhoven Univ. of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands hjch@win.tue.nl J.H. van Schuppen CWI P.O. Box 94079 1090 GB
	ftp://ftp.win.tue.nl/pub/techreports/wsinmarc/spne.ps.Z, 19960313 Structural Petri Net Equivalence M. Voorhoeve (email: wsinmarc@win.tue.nl) Eindhoven University of Technology
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-12.ps, 19960319 Memorandum COSOR 96-12, 1996, Eindhoven University of Technology A queueing system with two different service speeds I.J.B.F. Adan , E.A. van Doorny, J.A.C. Resing , W.R.W. Scheinhardty Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven,
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-11.ps, 19960325 Memorandum COSOR 96-11, 1996, Eindhoven University of Technology Scheduling on identical machines: How good is lpt in an on-line setting Bo Chen Arjen P.A. Vestjens March 13, 1996
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/correction-list.ps.Z, 19960330 Correction list Draft Recommendation Z.120 Errors: 1) Summary, p.1, paragraph Associated work: Replace Z.210 by X.210 2) Sect.1.2, p4, 9th paragraph: plus sign (+) should be up (like *) 3) Sect. 1.3, p.6 example on top: move arrow on the right hand side from to 4)
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-13.ps, 19960403 Memorandum COSOR 96-13, 1996, Eindhoven University of Technology Note on the approximation of distributions on ZZC by mixtures of negative binomial distributions F.W. Steutel and M.J.A. van Eenige
	ftp://ftp.win.tue.nl/pub/techreports/vaessens/jssls.ps.gz, 19960411 Job Shop Scheduling by Local Search R.J.M. Vaessens 1 E.H.L. Aarts 2;1 J.K. Lenstra 1;3 1. Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven; Email: frobv, jklg@win.tue.nl 2. Philips Research Laboratories, P.O. Box 80000, 5600 JA
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/graduate_course.ps, 19960420 Contents 1 Introduction 3 1.1 Mathematical control theory : : : : : : : : : : : : : : : : : : : : : : : : : : 3 1.2 An example: instability of the geostationary orbit : : : : : : : : : : : : : : : 5 1.3 Linear control systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 1.4 Example:
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/minutes_april_96.ps.Z, 19960422 1 Temporary Document Original: English ITU Telecommunication Standardization Sector (ITU-TS) Period 1993 -1996 Geneva, 10 - 18 April 1996 Question: 9 (Maintenance of MSC) Study Group 10 Source: Rapporteur Contact: Ekkart Rudolph Technische Universit t M nchen Institut f r Informatik Arcisstr. 21 D-80290
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-15.ps, 19960422 Memorandum COSOR 96-16, 1996, Eindhoven University of Technology CIRCULAR MARKOV CHAINS IVO ADAN AND JACQUES RESING
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-20.ps, 19960424 Memorandum COSOR 96-20, 1996, Eindhoven University of Technology THE M/M/c WITH CRITICAL JOBS IVO ADAN AND GERARD HOOGHIEMSTRAy
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-19.ps, 19960424 Existence of general equilibrium in a prototype L1 economy Jan van Geldrop Cees Withagen Eindhoven University of Technology Department of Mathematics and Computing Science P.O. Box 513 5600 MB Eindhoven The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/laan/csn96_yy.ps.gz, 19960503 A Correspondence between Nuprl and the Ramified Theory of Types Fairouz Kamareddiney Twan Laanz April 23, 1996
	ftp://ftp.win.tue.nl/pub/techreports/laan/csn96_xx.ps.gz, 19960503 Automath and Pure Type Systems Twan Laan Co-operation Centre Tilburg and Eindhoven Universities Eindhoven University of Technology P.O.Box 513, 5600 MB Eindhoven, The Netherlands e-mail laan@win.tue.nl April 26, 1996
	ftp://ftp.win.tue.nl/pub/math.prog.construction/CalcWithMathSpad.ps.Z, 19960507 Matsad Tool Support for the Calculational Method Roland Backhouse and Richard Verhoeven Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. frolandb,mathpadg@win.tue.nl May 7, 1996
	ftp://ftp.win.tue.nl/pub/techreports/severi/thesis.ps.Z, 19960508 Normalisation in Lambda Calculus and its relation to Type Inference PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Technische Universiteit Eindhoven, op gezag van de Rector Magnificus, prof.dr. J.H. van Lint, voor een commissie aangewezen door het College van Dekanen in het openbaar te
	ftp://ftp.win.tue.nl/pub/techreports/vestjens/95-39.ps.gz, 19960514 Optimal on-line algorithms for single-machine scheduling J.A. Hoogeveen A.P.A. Vestjens Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB, Eindhoven, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/wsinmarc/manstat.ps.Z, 19960528 ExSpect Language Tutorial (rel. 5.1) M.Voorhoeve Eindhoven University of Technology May 28, 1996 1 Introduction The ExSpect language and tool can be used in two ways. One way is to combine predefined building blocks (processors and subsystems) to specify a large system. This way can be learnt from doing
	ftp://ftp.win.tue.nl/pub/techreports/dennis/the.ps.gz, 19960529
	ftp://ftp.win.tue.nl/pub/techreports/dennis/stellingen.ps.gz, 19960530 STELLINGEN behorende bij het proefschrift
	ftp://ftp.win.tue.nl/pub/techreports/michelr/ComputerJournal94-vol37-nr4.ps.Z, 19960605 An Algebraic Semantics of Basic Message Sequence Charts S. Mauw and M. A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. Message Sequence Charts are a widely used technique for the visualization of the
	ftp://ftp.win.tue.nl/pub/techreports/michelr/ComputingScienceNotes94-23.ps.Z, 19960605 An algebraic semantics of Message Sequence Charts S. Mauw M.A. Reniers Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. sjouke@win.tue.nl michelr@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/michelr/SDLForum95.ps.Z, 19960605 1 Syntax Requirements of Message Sequence Charts M.A. Reniers a aDepartment of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL{5600 MB Eindhoven, The Netherlands A set of syntax requirements of MSC is discussed and formalized. The treatment is restricted to Basic
	ftp://ftp.win.tue.nl/pub/techreports/michelr/ComputingScienceReports95-12.ps.Z, 19960605 Empty Interworkings and Refinement Semantics of Interworkings Revised S. Mauw, M.A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL{5600 MB Eindhoven, The Netherlands. sjouke@win.tue.nl, michelr@win.tue.nl
	ftp://ftp.win.tue.nl/pub/math.prog.construction/redargprogcons.ps.Z, 19960606 Reductivity Arguments and Program Construction Doornbos, Henk Reductivity Arguments and Program Construction / Henk Doornbos. - Eindhoven: Eindhoven University of Technology Thesis Technische Universiteit Eindhoven. - With index, ref. - With summary in Dutch ISBN 90-386-0098-4 Subject headings: relation
	ftp://ftp.win.tue.nl/pub/techreports/michelr/CONCUR96.ps.Z, 19960607 Refinement in Interworkings S. Mauw and M.A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL{5600 MB Eindhoven, The Netherlands. sjouke@win.tue.nl , michelr@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-14.ps, 19960611 Memorandum COSOR 96-14, 1996, Eindhoven University of TechnologyMemorandum COSOR 96-14, 1996, Eindhoven University of Technology A Time-Indexed Formulation for Single-Machine Scheduling Problems: Column Generation J.M. van den Akker 1 Center for Operations Research and Econometrics Catholique University
	ftp://ftp.win.tue.nl/pub/techreports/dennis/errata.ps.gz, 19960615 Errata in Abstract Interpretation and Partition Re nement for Model Checking 15th June 1996 See http://www.win.tue.nl/win/cs/fm/Dennis.Dams/errata.html for an updated version of this list. Contributions and other comments may be sent to wsindd@win.tue.nl. ffl page viii, line -8: kew ! replace by: knew
	ftp://ftp.win.tue.nl/pub/techreports/michelr/ScienceComputerProgramming.ps.Z, 19960619 The I 2C-bus in Discrete-Time Process Algebra S.H.J. Bos and M.A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/michelr/ComputingScienceReports96-14.ps.Z, 19960619 The I 2C-bus in Discrete-Time Process Algebra S.H.J. Bos and M.A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/severi/top.ps.Z, 19960705
	ftp://ftp.win.tue.nl/pub/techreports/michelr/tent94-herkansing.ps.Z, 19960709 Tentamen Proces Algebra 2L920 24-08-1994, 9.00u 12.00u Let op: ffl Open boek, maar verder geen aantekeningen. ffl Dit tentamen bestaat uit 5 vragen, voor elke vraag zijn 20 punten te behalen. ffl Schrijf de bewijzen nauwkeurig op, bij afronding van Uw cijfer wordt hierop gelet. Vraag 1 Gegeven is dat
	ftp://ftp.win.tue.nl/pub/techreports/michelr/tent94-regulier.ps.Z, 19960709 Tentamen Proces Algebra 2L920 16-06-1994, 9.00u{12.00u Let op: ffl Open boek, maar verder geen aantekeningen. ffl Dit tentamen bestaat uit 5 vragen. ffl Voor elke vraag zijn 20 punten te behalen. ffl Vermeldt de naam van Uw instructeur. Vraag 1 Gegeven is dat (a; b) = (b; a) = c, met a, b en c
	ftp://ftp.win.tue.nl/pub/techreports/michelr/answers-13-06-1996.ps.Z, 19960709 Uitwerkingen Tentamen d.d. 13-06-1996 M.A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands michelr@win.tue.nl Draft, July 9, 1996 Vraag 1 i. a a a j b b b D fCM7g .a j b/ .a a k b b/ D fCF1g c .a a k b b/ D
	ftp://ftp.win.tue.nl/pub/techreports/michelr/tent95-herkansing.ps.Z, 19960709 Tentamen Proces Algebra 2L920 23-08-1995, 9.00u 12.00u Let op: ffl Open boek, maar verder geen aantekeningen. ffl Dit tentamen bestaat uit 5 vragen, voor elke vraag zijn 20 punten te behalen. ffl Schrijf de bewijzen nauwkeurig op, bij afronding van Uw cijfer wordt hierop gelet. Vraag 1 Gegeven is dat fl
	ftp://ftp.win.tue.nl/pub/techreports/michelr/tent96-regulier.ps.Z, 19960709 Tentamen Proces Algebra 2L920 13-06-1996, 9.00u 12.00u Let op: ffl Open boek, maar verder geen aantekeningen. ffl Dit tentamen bestaat uit 5 vragen, voor elke vraag zijn 20 punten te behalen. ffl Je hoeft alleen een bewijs te geven als daar expliciet om gevraagd wordt. ffl Schrijf de bewijzen nauwkeurig
	ftp://ftp.win.tue.nl/pub/techreports/michelr/tent95-regulier.ps.Z, 19960709 Tentamen Procesalgebra 2L920 15-06-1995, 9.00 12.00 Let op: ffl Dit tentamen is een open boek tentamen, d.w.z. dat het boek Process Algebra van J.C.M. Baeten en W.P. Weijland en de handout Discrete Time Process Algebra with Relative Timing van J.C.M. Baeten en M.A. Reniers gebruikt mogen worden.
	ftp://ftp.win.tue.nl/pub/techreports/michelr/handout.1995.ps.Z, 19960709 Discrete Time Process Algebra with Relative Timing J.C.M. Baeten and M.A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands josb@win.tue.nl, michelr@win.tue.nl Handout May 16, 1995 1 Introduction Process
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/d-h2-6.ps, 19960716 H2 Optimal Controllers with Measurement Feedback for Discrete-time Systems { Flexibility in Closed-loop Pole Placement Ali Saberi Peddapullaiah Sannuti Anton A. Stoorvogel School of Electrical Engineering Department of Electrical and Department of Mathematics and Computer Science Computer Engineering
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/Stoo_s4.ps, 19960716 Automatica Paper 94-TB-132 / 95-022 H2 optimal controllers with measurement feedback for continuous-time systems { flexibility in closed-loop pole placement Ali Saberi Peddapullaiah Sannuti Anton A. Stoorvogel School of Electrical Engineering Department of Electrical and Department of Mathematics and
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/Stoo_s3.ps, 19960716 Optimal Hankel Norm Identification of Dynamical Systems Siep Weiland Department of Electrical Engineering Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands E-mail: s.weiland@ele.tue.nl Anton A. Stoorvogely Department of Mathematics Eindhoven University of Technology P.O.
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/stability16.ps, 19960716 Rational Representations of Behaviors: Well-posedness, Stability and Stabilizability Siep Weiland Department of Electrical Engineering Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands Anton Stoorvogel Department of Mathematics and Computing Science Eindhoven University
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-25.ps, 19960806 Memorandum COSOR 96-25, 1996, Eindhoven University of Technology COMBINING TWO CLASSICAL APPROACHES FOR STATISTICAL SELECTION J.H.M. Verheijeny, F.P.A.Coolenz and P. van der Laany Correspondence address: y Eindhoven University of Technology zUniversity of Durham Dep. of Mathematics and Computing Science
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-24.ps, 19960806 Memorandum COSOR 96-24, 1996, Eindhoven University of Technology Combinatorics, computer algebra and Wilcoxon-Mann-Whitney test A. Di Bucchianico Department of Mathematics and Computing Science Eindhoven University of Technology P. O. Box 513 5600 MB Eindhoven, The Netherlands sandro@win.tue.nl URL:
	ftp://ftp.win.tue.nl/pub/techreports/michelr/ComputingScienceReports96-19.ps.Z, 19960806 Static Semantics of Message Sequence Charts M.A. Reniers Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL 5600 MB Eindhoven, The Netherlands. Chapter 1 Introduction The purpose of this document is to formally define the syntax requirements of Message
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/msc96tutorial.ps.Z, 19960816 Tutorial on Message Sequence Charts (MSC'96) Ekkart Rudolpha, Jens Grabowskib, and Peter Graubmannc aTechnical University of Munich, Institute for Informatics, Arcisstrasse 21, D-80290 M unchen, Germany, eMail: rudolphe@informatik.tu-muenchen.de bInstitute for Telematics, University of L ubeck,
	ftp://ftp.win.tue.nl/pub/techreports/tijn/thesis.ps.gz, 19960819 1 ae Coming to Terms with Modal Logic: On the interpretation of modalities in typed >=-calculus Tijn Borghuis Coming to Terms with Modal Logic: On the interpretation of modalities in typed >=-calculus Coming to Terms with Modal Logic: On the Interpretation of Modalities in Typed >=-Calculus Proefschrift
	ftp://ftp.win.tue.nl/pub/techreports/janjoris/CompletenessAndTime.ps.gz, 19960820 Completeness in Discrete-Time Process Algebra Michel A. Reniers and Jan Joris Vereijken Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands http://www.win.tue.nl/win/cs/fm/fmichelr,janjorisg/ michelr@win.tue.nl, janjoris@acm.org August
	ftp://ftp.win.tue.nl/pub/techreports/michelr/tent96-herkansing.ps.Z, 19960821 Tentamen Procesalgebra 2L920 21-08-1996, 9.00 12.00 Let op: ffl Dit tentamen is een open boek tentamen, d.w.z. dat het boek Process Algebra van J.C.M. Baeten en W.P. Weijland en de handout Discrete Time Process Algebra with Relative Timing van J.C.M. Baeten en M.A. Reniers gebruikt mogen worden.
	ftp://ftp.win.tue.nl/pub/techreports/vestjens/vector.ps.gz, 19960826 On-line and Off-line Approximation Algorithms for Vector Covering Problems Noga Alon J anos Csirik y Sergey V. Sevastianov z Arjen P.A. Vestjens x Gerhard J. Woeginger {
	ftp://ftp.win.tue.nl/pub/techreports/janjoris/DiscreteTimeEmptyProcess.ps.gz, 19960910 Discrete-Time Process Algebra with Empty Process J. C. M. Baeten and J. J. Vereijken Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands http://www.win.tue.nl/win/cs/fm/{josb,janjoris}/ josb@win.tue.nl, janjoris@acm.org September 10,
	ftp://ftp.win.tue.nl/pub/techreports/wieger/thesisWesselink.ps.gz, 19960918 Variational Modeling of Curves and Surfaces Proefschrift ter verkrijging van de graad van doctor aan de Technische Universiteit Eindhoven, op gezag van de Rector Magnificus, prof.dr. M. Rem, voor een commissie aangewezen door het College van Dekanen in het openbaar te verdedigen op donderdag 12
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-29.ps, 19960919 Memorandum COSOR 96-29, 1996, Eindhoven University of Technology Preference threshold procedure for statistical selection: Robustness against deviations from normality J.H.M. Verheijen1, F.P.A. Coolen2 and P. van der Laan1 1Eindhoven University of Technology 2 University of Durham Department of
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-27.ps, 19960919 Memorandum COSOR 96-27, 1996, Eindhoven University of Technology Minimizing total completion time in a two-machine flowshop: analysis of special cases J.A. Hoogeveen Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands email
	ftp://ftp.win.tue.nl/pub/techreports/wieger/cagd95.ps, 19960919 Interactive Design of Constrained Variational Curves Wieger Wesselinkz Remco C. Veltkampz z Technical University of Eindhoven Department of Computing Science P.O. Box 513, 5600 MB Eindhoven, The Netherlands e-mail: fwieger,remcog@win.tue.nl CWI, Department of Interactive Systems Kruislaan 413, 1098 SJ
	ftp://ftp.win.tue.nl/pub/techreports/terelst/kato.ps, 19961010 On Kato's square root problem A.F.M. ter Elst Department of Mathematics and Comp. Sc. Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands and Derek W. Robinson Centre for Mathematics and its Applications Australian National University Canberra, ACT 0200, Australia
	ftp://ftp.win.tue.nl/pub/techreports/terelst/ld.ps, 19961010 High order divergence-form elliptic operators on Lie groups A.F.M. ter Elst1 and Derek W. Robinson2
	ftp://ftp.win.tue.nl/pub/techreports/terelst/av.ps, 19961010 Analytic elements of Lie groups A.F.M. ter Elst Department of Mathematics and Comp. Sc. Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands and Derek W. Robinson Centre for Mathematics and its Applications Australian National University Canberra, ACT 0200, Australia
	ftp://ftp.win.tue.nl/pub/techreports/terelst/spro.ps, 19961010 Spectral estimates for positive Rockland operators A.F.M. ter Elst1 and Derek W. Robinson Centre for Mathematics and its Applications School of Mathematical Sciences Australian National University Canberra, ACT 0200 Australia July 1994 AMS Subject Classification: 35P20, 43A85, 22E45. Home institution:
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/dic.ps, 19961015 Contents 1 Introduction 3 1.1 Mathematical control theory : : : : : : : : : : : : : : : : : : : : : : : : : : 3 1.2 An example: instability of the geostationary orbit : : : : : : : : : : : : : : : 5 1.3 Linear control systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 1.4 Example:
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/iwsdlforum.ps.Z, 19961015 A formal semantics of synchronous interworkings S. Mauwa , M. van Wijkb and T. Winterc aDept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands bProgramming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam,
	ftp://ftp.win.tue.nl/pub/techreports/wscoas/italy-cwi.ps, 19961015 System Identification with Information Theoretic Criteria A.A. Stoorvogel Department of Mathematics and Computing Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands wscoas@win.tue.nl J.H. van Schuppen CWI P.O. Box 94079, 1090 GB Amsterdam, The Netherlands
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/tutorial-slides.ps.Z, 19961015 Message Sequence Charts FORTE/PSTV'96 Tutorial on Message Sequence Charts (MSC'96) Ekkart Rudolph Technical Un ivers it y ofMunich Inst it ute for Informatics Arcisstr.21 D-80290 M nchen Germany eMail: rudolphe@in formatik.tu-muenchen .de Jens Grabowski University of L beck Inst it ute for Telematics
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-31.ps, 19961029 Memorandum COSOR 96-31, 1996, Eindhoven University of Technology COMBINING MAKE TO ORDER AND MAKE TO STOCK IVO ADAN AND JAN VAN DER WAL
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-17.ps, 19961105 Memorandum COSOR 96-17, 1996, Eindhoven University of Technology The Response Time Distribution in a Real-Time Database with Optimistic Concurrency Control S.A.E. Sassen and J. van der Wal Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, NL-5600 MB
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-09.ps, 19961105 Memorandum COSOR 96-09, 1996, Eindhoven University of Technology Optimal control of a divergent N-echelon inventory system E.B. Diks and A.G. de Kok Department of Mathematics and Computing Science Eindhoven University of Technology
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-16.ps, 19961105 Memorandum COSOR 96-16, 1996, Eindhoven University of Technology H2 Optimal Controllers with Measurement Feedback for Discrete-time Systems { Flexibility in Closed-loop Pole Placement Ali Saberi a;1, Peddapullaiah Sannuti b Anton A. Stoorvogel c;2 aSchool of Electrical Engineering and Computer Science,
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-21.ps, 19961105 Memorandum COSOR 96-21, 1996, Eindhoven University of Technology Multi-Echelon Systems: A Service Measure Perspective E.B. Diks1, A.G. de Kok1, and A.G. Lagodimos2
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-23.ps, 19961105 Memorandum COSOR 96-23, 1996, Eindhoven University of Technology Stock allocation in general multi-echelon distribution systems with .R; S/ order-up-to-policies M.C. van der Heijden1, E.B. Diks2 and A.G. de Kok2
	ftp://ftp.win.tue.nl/pub/techreports/sjouke/msc/differences.ps.Z, 19961111 MSC 92 - MSC 96 differences 1. MSC 92 (section 2.1): Within MSC 92 does not contain the semicolon, since is used within the definition of action, and the semicolon is employed as a terminator for action. (The semicolon is contained in the definition of ). MSC 96 (section 2.1):
	ftp://ftp.win.tue.nl/pub/techreports/iadan/95-42.ps, 19961112 Memorandum COSOR 95-42, 1995, Eindhoven University of Technology Shortest expected delay routing for Erlang servers Ivo Adan and Jaap Wessels Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O.Box 513, 5600 MB - Eindhoven, The Netherlands E-mail: iadan@win.tue.nl,
	ftp://ftp.win.tue.nl/pub/techreports/iadan/93-38.ps, 19961112 Memorandum COSOR 93-38, 1993, Eindhoven University of Technology Analysing shortest expected delay routing for Erlang servers I.J.B.F. Adan1 J. Wessels1;2
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-18.ps, 19961125 Memorandum COSOR 96-18, 1996, Eindhoven University of Technology Learning to detect planning horizons with multi- layered perceptrons: a case study for lot-sizing H.P. Stehouwer 1 E.H.L. Aarts 2;1 J. Wessels 1;3 1Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O.
	ftp://ftp.win.tue.nl/pub/techreports/bloo/Edge.ps.gz, 19961129 Explicit Substitution: on the Edge of Strong Normalisation Roel Bloo bloo@win.tue.nl Herman Geuvers herman@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/bloo/PSN.ps.gz, 19961129 Preservation of Strong Normalisation for Explicit Substitution Roel Bloo bloo@win.tue.nl 1 Introduction We introduce a calculus of explicit substitutions and prove that terms that are strongly normalising with respect to -reduction are also strongly normalising with respect to explicit substitution
	ftp://ftp.win.tue.nl/pub/techreports/bloo/RTA96.ps.gz, 19961129 Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Normalisation Roel Bloo1 and Kristoffer H. Rose2 1 Eindhoven University of Technology, PO-Box 513, NL{5600 MB Eindhovenz 2 BRICS, Dept. of Computer Science, University of Aarhus, DK{8000 Arhus C x
	ftp://ftp.win.tue.nl/pub/techreports/bloo/CSN95.ps.gz, 19961129 Preservation of Strong Normalisation in Named Lambda Calculi with Explicit Substitution and Garbage Collection Roel Bloo bloo@win.tue.nl Kristoffer H. Rose kris@diku.dk y
	ftp://ftp.win.tue.nl/pub/techreports/iadan/difcourse.ps, 19961209 Difference and differential equations in Stochastic Operations Research Ivo Adan and Jan van der Wal Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands Email: iadan@win.tue.nl, wscojvdw@win.tue.nl December 9, 1996 Contents
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-35.ps, 19961218 Memorandum COSOR 96-35, 1996, Eindhoven University of Technology Cost-effective control policies for multi-echelon distribution systems E.B. Diks Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands e-mail: diks@win.tue.nl
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-34.ps, 19961218 Memorandum COSOR 96-34, 1996, Eindhoven University of Technology Two Approximations for the Steady-State Probabilities and the Sojourn-Time Distribution of the M=D=c Queue with State-Dependent Feedback Simone Sassen and Jan van der Wal
	ftp://ftp.win.tue.nl/pub/techreports/cosor/96-28.ps, 19961219 Memorandum COSOR 96-28, 1996, Eindhoven University of Technology Computational results for the control of a divergent N-echelon inventory system E.B. Diks and A.G. de Kok Department of Mathematics and Computing Science Eindhoven University of Technology
	ftp://ftp.win.tue.nl/pub/techreports/janjoris/Boekenlijst.ps.gz, 19970102 Boeken Jan Joris Vereijken 2 januari 1997 C. J. Aarts en M. C. van Etten, samenstellers. Domweg gelukkig in de Dapperstraat. Bert Bakker, 14e druk, 1996. E. H. L. Aarts et al., samenstellers. Simplex sigillum veri. Technische Universiteit Eindhoven, 1e druk, 1995. E. A. Abbott. Flatland.