Subject: IEEE-CS TC-RTS Newsletter for Fri May 07, 1993 _______________________________________________________________________________ __ _ __ ___ ___ __ __ I E E E Technical Committee |\ | |_ | | (_' | |_ | | |_ |_) C S on Real-Time Systems | \| |__ |/\| ,_) |__ |__ | | |__ | \ _______________________________________________________________________________ Table of Contents Line ----------------- ---- 1. son@bbibbi.cs.virginia.edu (145 lines) RTOSS final program................................................ 4 2. Rob van Glabbeek (73 lines) Two new papers..................................................... 147 3. best@cs.bu.edu (Azer Bestavros) (44 lines) Kluwer ftp server now available ................................... 221 4. Bengt Jonsson (58 lines) VISITING RESEARCH POSITION at UPPSALA.............................. 264 5. best@cs.bu.edu (Azer Bestavros) (11 lines) Advertise your abstracts on the Newsletter......................... 322 ------------------------------------------------------------------------------ <<<<<<<<<<<<<<<<<<* START OF THE IEEE-CS TC-RTS NEWSLETTER *>>>>>>>>>>>>>>>>>> ------------------------------------------------------------------------------ Message 1; Postmarked Mon Apr 19 08:16:37 1993 From: son@bbibbi.cs.virginia.edu Sender: best@cs.bu.edu Subject: RTOSS final program IEEE Workshop ON Real-Time Operating Systems and Software May 13-14, 1993 Ramada Hotel, New York, New York Final Program * * * May 13 (Thursday) 7:30 Registration and coffee 8:15 Opening Remarks 8:30 Session I: Scheduling (Chair: Ragunathan Rajkumar, Carnegie Mellon U.) How to integrate precedence constraints and shared resources in real-time scheduling M. Spuri and J. Stankovic, Scuola Superiore S.Anna Scheduling with relative timing constraints M. Saksena, R. Gerber, A. Agrawala, University of Maryland Issues in the static allocation and scheduling of complex periodic tasks K. Ramamritham, G. Fohler and J. Adan, University of Massachusetts A general search framework for dynamic scheduling of real-time tasks B. Hamidzadeh and S. Shekhar, University of Minnesota 10:15 Break 10:45 Panel: Semantics of timing constrainst: Where do they come from and where do they go? Chair: Karsten Schwan (Georgia Tech) A. Stoyenko (New Jersey Inst. Tech.), T. Bihari (Adaptive Machine), K. Shin (U. Michigan), K. Ramamritham (U. Mass) 12:00 Lunch 1:30 Session II: Operating Systems (Chair: Hide Tokuda, Carnegie Mellon U.) Engineering and analysis of real-time operating systems J. Strosnider and D. Katcher, Carnegie Mellon University Scheduling support in a real-time multimedia storage service K. Ramakrishnan, L. Vaitzblit, D. Ting, P. Tzelnic, DEC Performance evaluation of real/ix, a real-time UNIX operating system B. Furht, Florida Atlantic University Cooperative resource management in R-Shell S. Natarajan and Wei Zhao, Texas A & M University 3:15 NSF Real-Time AI Workshop Report (A. Agrawala, U. Maryland) 3:40 Break 4:00 Session III: Real-Time Databases (Chair: Krithi Ramamritham, U. Mass.) Real time data management M. Graham, Carnegie Mellon University A model for real-time object-oriented databases V. Wolfe, L. Cingiser, J. Peckham and J. Prichard, University of Rhode Island A design methodology for real-time database systems H. Nakazato and K. Lin, University of Illinois Real-time concurrency control with analytic worst-case latency guarantees M. Young and L. Shu, Purdue University 6:30 Reception May 14 (Friday) 7:30 Registration and coffee 8.30 Session IV: Real-Time Software and Tools (Chair: Al Mok, U. Texas) Using an applicative language for computer system specification with real-time constraints S. Habib and T. Jin, City University of New York Scheduling with compiler transformations: the TCEL approach S. Hong and R. Gerber, University of Maryland Incremental analysis for reuse and change in a software development environment for hard-real-time systems T. Marlowe, A. Stoyenko, L. Welch, P. Laplante, New Jersey Institute of Technology Timing refinement in real-time systems H. Ben-Abdallah and I. Lee, University of Pennsylvania 10:15 Break 10:45 Panel: RT OS and Tools: Why can't we share? Chair: Kang Shin (U. Michigan) D. Locke (IBM), K.-J. Lin (U. Illinois), C. Heitmeyer (Naval Res. Lab) F. Jahanian (IBM), A. Mok (U. Texas) 12:00 Lunch 1:30 Session V: Specification, Verification, and Analysis (Chair: Insup Lee) A generalized approach to real-time schedulability analysis R. Cleaveland and A. Fredette, North Carolina State University Real-time architecture specification and analysis P. Binns and S. Vestal, Honeywell On modularity and tightness of real-time verification J. Krone and M. Sitaraman, Denison University 2:45 Break 3:15 Session VI: Pot Pourri (Chair: Azer Bestavros, Boston University) A reactive and reflective model for meta-state machines M. Champlain and J. Houle, College militaire royal de Saint-Jean A benchmark for comparing different approaches for specifying and verifying real-time systems C. Heitmeyer, R. Jeffords, and B. Labaw, Naval Research Laboratory On scheduling real-time tasks with nondeterministic synchronization behavior J. Huang, S. Hwang, and P. Patiath, Honeywell 4:30 Closing Remarks ------------------------------------------------------------------------------ Message 2; Postmarked Mon Apr 19 09:56:37 1993 Subject: Two new papers From: Rob van Glabbeek Dear Colleagues, for those interested, two new papers by me can be ftp'ed from Boole.stanford.edu Rob van Glabbeek --------------------------------------------------------------------------- The linear time - branching time spectrum II; the semantics of sequential systems with silent moves This paper studies semantic equivalences and preorders for sequential systems with silent moves, restricting attention to the ones that abstract from successful termination, stochastic and real-time aspects of the investigated systems, and the structure of the visible actions systems can perform. It provides a parameterized definition of a such a preorder, such that most such preorders and equivalences found in the literature are obtained by a suitable instantiation of the parameters. Other instantiations yield preorders that combine properties from various semantics. Moreover, the approach shows several ways in which preorders that were originally only considered for systems without silent moves, most notably the ready simulation, can be generalized to an abstract setting. All preorders come with---or rather as---a modal characterization, and when possible also a relational characterization. Moreover they are motivated by means of an (also parameterized) testing scenario, phrased in terms of `button pushing experiments' on generative and reactive machines. The testing scenarios for branching bisimulation, eta-bisimulation and coupled simulation and the corresponding modal characterizations are especially new. A complete axiomatization for branching bisimulation congruence of finite-state behaviours This paper offers a complete inference system for branching bisimulation congruence on a basic sublanguage of CCS for representing regular processes with silent moves. Moreover, complete axiomatizations are provided for the guarded expressions in this language, representing the divergence- free processes, and for the recursion-free expressions, representing the finite processes. Furthermore it is argued that in abstract interleaving semantics (at least for finite processes) branching bisimulation congruence is the finest reasonable congruence possible. The argument is that for closed recursion-free process expressions, in the presence of some standard process algebra operations like partially synchronous parallel composition and relabelling, branching bisimulation congruence is completely axiomatized by the usual axioms for strong congruence together with Milner's first tau-law. For a current listing of my papers - with abstracts and references - do: finger rvg@boole.stanford.edu | more ==============================Instructions================================= FTP LOGIN. Give the following commands. ftp boole.stanford.edu Login: anonymous (if you don't have an account on boole) Paswd: user@host (your usual email address) bin (if you are retrieving a .Z file) prompt off (if you want no ? prompts from mget) ls -ltr (see what's there, most recent last) mget filename-1 ... filename-n (e.g. mget complete.tex spectrum.A4.ps.Z) quit (exit from FTP) uncompress spectrum.A4.ps (to obtain spectrum.A4.ps) ------------------------------------------------------------------------------ Message 3; Postmarked Thu Apr 22 10:45:35 1993 From: best@cs.bu.edu (Azer Bestavros) Subject: Kluwer ftp server now available Announcing a new ftp server Kluwer Academic Publishers Group Journals on Electrical Engineering/Computer Science THE KLUWER FTP SERVER The new Kluwer ftp server offers you comprehensive information on Kluwer's Electrical Engineering & Computer Science journals. The ftp server enables you to retrieve the complete table of contents, dating back to issue 1/1 and including those of forthcoming issues not yet published. You can also retrieve the Aims & Scope, Instruction for Authors and Ordering information per journal title. Besides information on journals, the ftp server also contains LaTeX style files for authors wishing to submit manuscripts. In the near future, Kluwer Academic Publishers plans to extend this service to include book previews (offering preface and table of contents). You can reach the Kluwer ftp server at the following address: ftp world.std.com login: anonymous directory Kluwer/journals This service can also be reached using gopher. If you encounter any difficulties or if you have any questions, please do not hesitate to contact one of our help desks. You can reach them at the following email addresses: for North-America: for outside North-America: Eric Maki Martin van der Linden emkluwer@world.std.com vanderlinden@wkap.nl ------------------------------------------------------------------------------ Message 4; Postmarked Thu Apr 29 13:38:22 1993 Subject: VISITING RESEARCH POSITION at UPPSALA From: Bengt Jonsson VISITING RESEARCH POSITION at the UNIVERSITY of UPPSALA, Sweden The department of Computer Systems at Uppsala University offers a position as visiting researcher starting sometime in Autumn 1993. Uppsala is located 70 km north of Stockholm. The departments of computer systems, computing science, mathematics, numerical analysis, and automatic control, have been located together on a newly renovated campus. Resarch at the department of Computer Systems is focussed on - formal methods and tools for design and analysis of distributed systems, real-time systems, and hardware circuits. We have been active in the areas of automatic verification, process algebra (especially with respect to extensions for performance), semantics, and transformational program development. - implementation support for the development of distributed real-time systems. (work is conducted in an Ada-based programming environment) - Neural networks (applications of neural networks for control in high speed networks, and hardware designs of neural networks) - techniques for implementation of efficient communication protocols Researchers at the department inlude Parosh Abdulla, Lars Asplund, Ivan Christoff, Hans Hansson, Bengt Jonsson, Joachim Parrow, Wang Yi, and a number of Ph.D. students. Besides conducting research in the areas above, the department is planning to expand its research in the area of real-time systems. The neighbouring department of Computing Science is conducting research mainly in the area of logic programming. The duration of the position is flexible, 6 - 24 months. We seek an applicant with a PhD and a research record in area(s) that are relevant to the research at the department. Areas that would be welcome are: - Formal program development and semantics for distributed and real-time systems - Real-time systems - Neural networks Financing of the position will be via external funds. Presently, there is certain funding for the formal methods area. We strongly believe that there will be funding also for the other areas with a decision expected in early June. Interested? Please send CV and state your interests and requirements. Bengt Jonsson Uppsala University Dept of Computer Systems Box 325 S - 751 05 Uppsala, Sweden, fax: +46 - 18 - 55 02 25 e-mail: bengt@docs.uu.se ------------------------------------------------------------------------------ Message 5; Postmarked Fri May 16 13:38:22 1993 Subject: Advertise your abstracts on the Newsletter From: best@cs.bu.edu (Azer Bestavros) This is to remind our readership that they can distribute abstracts of their papers and/or technical reports through the IEEE-CS TC-RTS Newseltter. Please send an ASCII version of your abstract to for inclusion in future issues of this Newsletter. --Azer ------------------------------------------------------------------------------ <<<<<<<<<<<<<<<<<<<* END OF THE IEEE-CS TC-RTS NEWSLETTER *>>>>>>>>>>>>>>>>>>> ------------------------------------------------------------------------------ The TC-RTS repository is maintained by Azer Bestavros at Boston University Internet address for anonymous FTP to the TC-RTS repository is: cs.bu.edu Contributions to this forum should be sent via E-mail to: IEEE-RTTC@cs.bu.edu Requests / inquiries should be sent via E-mail to: IEEE-RTTC-request@cs.bu.edu ------------------------------------------------------------------------------