Books G. v. BochmannConcepts for distributed systems designSpringer Verlag, Berlin, 1983 (259 pages). Note: Two chapters represent original unpublished research work (1986 translated into japanese by T.Mizuno).1983Bochkw-obyes G. v. BochmannLangages formelsPresses de la Librairie de l'Universite de Montreal, (1973) 131 pages.1973Bochkw-obyes G. v. BochmannThe architecture of distributed computer systemsLecture Notes in Computer Science, Vol. 77, Springer Verlag, Heidelberg, 1979 (translated into japanese, 1982). Note: Two chapters represent original unpublished research results.1979Bochkw-ob kw-pubyes

Books Edited M.G. Ferguson, G. v. Bochmann (editors)Communications architectures and protocolsProc. ACM SIGCOMM Symposium, June 1984, Montreal1984Bochkw-ob B. Sarikaya, G. v. Bochmann (editors)Protocol Specification, Testing and VerificationProc. IFIP Workshop, Gray Rocks, June 1986, North Holland Publ. Comp.1986Bochkw-ob G. v. Bochmann and D.K. Probst (Eds.)Computer Aided VerificationProceedings of the Fourth Int. Workshop on CAV (1992), Springer Verlag, LNCS 663 (1993), 422 pages.1993Bochkw-ob kw-ch G. v. Bochmann, J. d. Meer and A. Vogel (Eds.)Multimedia Applications and QoS VerificationProceedings of the Workshop on Multimedia Applications and QoS Verification, Montreal, May 31 - June 1, 19941994Bochkw-or G. v. Bochmann, R. Dssouli and A. Das (Eds.)Protocol Test SystemsProceedings of the Int. Workshop on Protocol Test Systems (IWPTS'92), North-Holland Publ., 19931993Bochkw-ch kw-ob kw-RDb kw-ADb G. v. Bochmann, R. Dssouli and O. Rafiq(Eds.)Formal Description Techniques for Distributed Systems and Communications ProtocolsProceedings of IFIP FORTE'95 conference, Chapman Publ., 19951995Bochkw-ob kw-RDb R. Dssouli, G. v. Bochmann and Y. Lahav (Eds.)SDL'99 - The Next MillenniumProc. of the Ninth SDL Forum, Montreal, June 1999, Elsevier Publ., 1999 (489 pages).1999Dssokw-ob S. V. Raghavan, G. v. Bochmann and G. Pujolle (Eds.)Computer Networks, Architectures and ApplicationsProceedings of the IFIP Working Conference NETWORKS'92, Trivandrum, India, North-Holland Publ., 19931993Raghkw-ob kw-ch H. Ural, R. L. Probert and G. v. B. (Eds.)Testing of Communicating Systems - Tools and TechniquesProc. IFIP 13rd Intern. Conf. on Testing of Communicating Systems (TestCom 2000), Kluwer Academic Publ. (322 pages)2000

Articles in Refereed JournalsAnch> E. Dincturk, G. v. Bochmann, G. V. Jourdan and V. OnutA model-based approach for crawling Rich Internet ApplicationsACM Transactions on the Web, Volume 8 Issue 3, June 2014, pp. 19:1--19:392014Dinckw-ojryes J. Zhou, G. v. Bochmann and Z. ShiSupporting decentralized SPARQL queries in an ad-hoc Semantic Web data sharing systemIntern. Journal of Networking and Computing, Vol. 4, No. 1, 2014, pp. 88 - 110.2014Zhoukw-ojryes S. Choudhary, E. Dincturk, S. Mirtaheri, G. v. Bochmann, G. V. Jourdan and V. OnutModel-based Rich Internet Applications crawling - Menu and Probability modelsJournal of Web Engineering, 13(3 and 4), pp. 243 - 262, 2014.2013Choukw-ojryes J.Y.Zhang, J. Wu and G. v. BochmannA proof of wavelength conversion not improving Lagrangian bounds of the sliding scheduled RWA problemComputer Communications, Vol. 36 (2013), pp. 600-606.2013Zhankw-ojrExtensive previous studies confirmed that wavelength conversion may only marginally improve the solutions to the static Routing and Wavelength Assignment (RWA) problem. This means that, for the static RWA problem, certain RWA schemes that do not use wavelength conversion can achieve a performance almost as good as the one from the best RWA scheme. Previous research work on sliding scheduled RWA problems, where a given set of lightpath demands are allowed to slide within their time windows, has also indicated in limited simulation results that the benefit of using wavelength conversion is marginal. However, the observation cannot be conclusive without the solid mathematical proof. We are thus motivated to investigate whether schedule sliding really requires wavelength conversion to achieve a better performance. In this paper, we prove that wavelength conversion does not improve the Lagrangian bound of the sliding scheduled RWA problem. In most test cases, this bound is very close to the best achieved objective function value. Our proof implies that, for those cases, the improvements achieved by making use of wavelength conversion are very marginal.yes G. v. BochmannMultiple exits from a loop without the gotoComm. ACM. 16, pp. 443-444 (1973)1973Bochkw-ojryes J. Bailey et al.Precise measurement of the anomalous magnetic moment of the muonIl Nuovo Cimento 9A, pp. 369-432, (1972)1972Bailkw-ojryes J. Bailey et al.Precision measurement of the anomalous magnetic moment of the muonPhysics Letters 28B, pp. 287-290, (1968)1968Bailkw-ojryes G. v. BochmannSpecifications of a simplified Transport protocol using different formal description techniquesComputer Networks and ISDN Systems, Vol. 18, no.5, June 1990, pp. 335-3771990Bochkw-ojr, kw-pub, kw-chyes A. Ball, G. v. Bochmann and J. GecseiVideotex NetworksIEEE Computer, Vol. 13, No. 12 (December 1980), pp. 8-141980Ballkw-ojr kw-pubyes A. ElIraki, G. Lapalme and G. v. BochmannExperience with Ada for the design and the implementation of interactive systemsJournal of Pascal, Ada and Modula-2, May/June 1990, pp. 24-321990ElIrkw-ojr A. Ghedamsi, G. v. Bochmann and R. DssouliDiagnosing distributed systems modeled by communicating finite state machinesRevue Réseaux et Informatique Répartie, Vol.3, No.4, 1993, Editions Hermes, pp.343-3631993Ghedkw-ch kw-pub kw-ojr kw-RDjr -submitted to 11th Symp. on Reliable Distributed Systems, Houston, 5th to 7th October 1992 (rejected) -shorter version [Ghed 92i] accepted in the 12th IEEE IPCCC, Scottsdale, USA (march 93) under title: "Diagnostic Tests for Communicating Finite States Machines" -extended version submitted to ICDCS'93 (13th Int. Conf. on Distributed Computing Systems), Pittsburg, USA, May'93. (accepted -> [Ghed 93a]) -submitted to "Réseaux et informatique répartie" [22 oct. 92] (accepted with minor changes) earlier version Ghed 92cWe propose a diagnostic algorithm for the case where a distributed system specification (implementation) is given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptoms and which permit the location of the detected fault. The algorithm guarantees the correct diagnosis of any single (output or transfer) fault in a system of communicating FSMs. A simple example is used to demonstrate the functioning of the different steps of the proposed diagnostic algorithm. yes A. Hafid and G. v. BochmannAn approach to QoS management in distributed MM applications - Design and an implementationJournal on Multimedia Tools and Applications, Vol. 9 (1999), pp.167-191.1999Hafikw-look kw-ojr kw--citr Submitted for publication to ??? (Jan 97)Most work related to quality of service (QOS) is concerned with individual system components, such as the operating system or the network. Howevec, to support multimedia applications, the entire distributed system must participate in providing the guaranteed performance levels. In recognition of this, a number of QoS architectures have been proposed to provide QoS guarantees. The mechanisms and schemes proposed by those architectures are used in a rather static manner since the involved entities, e.g. the network, sender and receiver, are known before the connection (call) set-up phase. In contrast to those architectures, we propose a general QoS management framework which supports the dynamic choice of a configuration of system components to support the QoS requirements for the user of a specific application. We consider different possible system configurations and select the most appropriate on depending on the desired QoS and the available resources. In this paper we present an overview of this general framework; especially, we concentrate on QoS negotication and adaptation mechanisms. To show the feasability of this approach, we designed and implemented a QoS manager for distributed multimedia presentational applications, such as news-on-demand. The negotiation and adaptation mechanisms which are supported by the QoS manager are specializations of the general framework. The proposed framework allows to improve the utilization of system resources, and thus to increase the system availability; it also allows to recover automatically, if this is possible, from QoS degradations. Furthermore, it provides the flexibility to incorporate different resource reservation schemes and scheduling policies, and to accomodate new system component technologies. yes A. Hafid and G. v. BochmannQuality of service adaptation in distributed multimedia applicationsMultimedia Systems Journal, Vol. 6, No. 5 (1998), pp. 299-315.1998Hafikw-ojr kw-citr kw-pub kw-ftp Request for CITR publication requested by mail on June 26, 96 Approved by CITR by fax on Aug 16, 96 submitted to Multimedia Systems Journal in June 96 accepted for publication Jan 97 ALSO KNOWN UNDER NUMBER 96iHigh-speed networks and powerful end-systems enable new types of applications, such as video-on-demand and teleconferencing. Such applications are very demanding on quality of service (QoS) because of the isochronous nature of media they are using. To support these applications, QoS guarantees are required. However, even with service guarantees, violations may occur because of resources shortage, e.g., network congestion. In this paper we propose a new adaptation approach which allows to recover automatically, if possible, from QoS violations (1) by identifying a new configuration of system components which might support the initially agreed QoS and by performing a user-transparent transition from the original configuration to the new one, (2) by redistributing the levels of QoS that should be supported, in the future, by the components, or (3) by redistributing the levels of QoS that should be supported immediately to meet end-to-end requirements based on the principle that (local) QoS violation at one component may be recovered immediately by the other components participating in the support of the requested service. The proposed approach, together with suitable negotiation mechanisms, allows (1) to reduce the probability of QoS violations which may be noticed by the user, and thus, to increase the user confidence in the service provider, and (2) to make optimal utilization of the system resources, and thus to increase the system availability. yes A. Hafid, G. v. Bochmann and R. DssouliDistributed multimedia applications and quality of service - a reviewElectronic Journal on Network and Distributed Processing, No. 6 (Febr. 1998), pp. 1-50 (note, this journal is not on-line any more) 1998Hafikw-pubn kw-ftp kw-citr kw-ojrDistributed multimedia (MM) applications are very sensitive to the quality of service (QoS) provided by their computing and communication environment. This paper surveys the QoS issues behind distributed MM applications. MM applications characteristics and requirements are identified; QoS notions are defined. The role of all system components, namely transport protocols, networks, operating systems, file servers, multimedia databases, and user interfaces, in the provisioning of QoS is described. The need for QoS management to support distributed MM applications is motivated. The different QoS management functions are defined and examples of realizations are presented. Finally some representative QoS architectures are presented, their limitations are identified, and the requirements of an "ideal QoS architecture" are presented. yes A. Hafid, G. v. Bochmann and R. DssouliA quality of service negotiation approach with future reservations (NAFUR) - a detailed studyComputer Networks and ISDN Systems, volume 30, issue 8, 1998, pp. 777-7941998Hafikw-ojrDistributed multimedia (MM) applications such as video-on-demand and teleconferencing provide services with different quality of service (QoS) requirements. Hence, the user should be able to negotiate the desired QoS depending on his/her needs, the end-system characteristics and his/her financial capacity. In response to the user service request with a desired QoS, most QoS negotiation approaches return an acceptance or a simple rejection of the request. More specifically, they provide the user only with the QoS that can be supported at the time the request is made and assume that the service is requested for indefinite duration. The paper describes work on a new QoS negotiation approach with future reservations (NAFUR) that decouples the starting time of the service from the time the service request is made and requires that the duration of the requested service must be specified. NAFUR allows to compute the QoS that can be supported for the time the service request is made, and at certain later times carefully chosen. As an example, if the requested QoS cannot be supported for the time the service request is made, the proposed approach allows to compute the earliest time, when the user can start the service with the desired QoS. NAFUR will help to increase (a) the flexibility of the system by providing the user with more choices, and (b) the system resource utilization, and the availability of the system, by encouraging the sharing of the resources, e.g. multicast for video-on-demand systems. Furthermore, it provides the flexibility to incorporate (a) a range of resource reservation schemes and scheduling policies, and (b) a range of new system component technologies. yes A. Khoumsi, G. v. Bochmann and R. DssouliDérivation de spécifications de protocole à partir de spécifications de service avec des contraintes temps-réelRevue Réseaux et Informatique Répartie, Volume 4, No.1, 1994, pp. 7-291994Khoukw-ch kw-ojr kw-RDjrthe copy is from CFIP 1993yes A. Maach, G. v. Bochmann and H. MouftahCongestion control and contention elimination in optical burst switchingTelecommunication Systems Journal, Vol. 27, No. 2 (October, 2004), pp 115-1312004Maackw-ojrOptical burst switching (OBS) is a proposed new communications technology that seeks to expand the use of optical technology in switching systems. However, many challenging issues have to be solved in order to pave the way for an effective implementation of OBS. Contention, which may occur when two or more bursts compete for the same wavelength on the same link, is a critical issue. Many contention resolution methods have been proposed in the literature but many of them are very vulnerable to network load and may suffer severe loss in case of heavy traffic. Basically, this problem is due to the lack of information at the nodes and the absence of global coordination between the edge routers. In this work, we propose another approach to avoid contention and decrease the loss. In this scheme, the intermediate nodes report the loss observed to the edge nodes so that they can adjust the traffic at the sources to meet an optimal network load. Furthermore, we propose a combination of contention reduction through congestion control and bursts retransmission to eliminate completely bursts loss. This new approach achieves fairness among all the edge nodes and enhances the robustness of the network. We also show through simulation that the proposed protocol is a viable solution for effectively reducing the conflict and increasing the bandwidth utilization for optical burst switching. yes A. P. Contogouris, J. P. Lebrun and G. v. BochmannRegge cuts and neutral pion photoproductionNuclear Physics B13, pp. 246-254 (1969)1969Contkw-ojryes A. Petrenko, G. v. Bochmann and M. YaoOn fault coverage of tests for finite state specificationsin Computer Networks and ISDN Systems, special issue on Protocol Testing, Vol. 29, 1996, pp.81-1061996Petrkw-ojr -accepted in December 95Testing is a trade-off between increased confidence in the correctness of the implementation under test and constraints on the amount of time and effort that can be spent in testing. Therefore, the coverage, or adequacy of the test suite, becomes a very important issue. In this paper, we analyze basic ideas underlying the techniques for fault coverage analysis and assurance mainly developed in the context of protocol conformance testing based on finite state models. Special attention is paid to parameters which determine the testability of a given specification and influence the length of a test suite which guarantees complete fault coverage. We also point out certain issues which need further study. yes A. Petrenko, N. Yevtushenko, G. v. Bochmann and R. DssouliTesting in context - framework and test derivationComputer Communications Journal, Special issue on Protocol engineering, Vol. 19, 1996, pp.1236-12491996Petrkw-pub kw-ftp kw-ojr kw-RDjryes A. Vogel, B. Kerherve, G. v. Bochmann and J. GecseiDistributed multimedia applications and quality of service - A surveyIEEE Multimedia, Vol. 2, No. 2 (ISSN 1070-986X), Summer 1995, p.10-19. A reduced version was published in Proc. CASCON (IBM Toronto), Oct. 19941995Vogekw-ojr kw-citryes B. Sarikaya and G. v. BochmannSynchronization and specification issues in protocol testingIEEE Trans. on Comm., COM-32, No.4 (April 1984), pp. 389-395; russian translation: Express Information (overview of western publications), Information Transfer, 1985, no. 281984Sarikw-ojr kw-pubyes B. Sarikaya, G. v. Bochmann and E. CernyA Test Design Methodology for Protocol TestingIEEE Trans. on Soft. Eng., Vol.13, no.5, May 1987, pp. 518-5311987Sarikw-ojryes B. Sarikaya, V. Kouloulidis and G. v. BochmannMethod of analysing extended finite-state machine specificationsComputer Communications, vol. 13 no. 2, March 1990, pp. 83-921990Sarikw-ojr, kw-chyes C. A. Vissers, G. v. Bochmann and R. L. TenneyFormal description techniquesProceedings of the IEEE, vol. 71, 12, pp. 1356-1364, Dec. 1983; translated into russian1983Visskw-ojryes C. Jard and G. v. BochmannAn approach to testing specificationsJournal of Systems and Software, Vol.3, 4(Dec. 1983), pp. 315-3231983Jardkw-ojryes C. Kant, T. Higashino and G. v. BochmannDeriving protocol specifications from service specifications written in LOTOSDistributed Computing, Vol. 10, No. 1, 1996, pp.29-471996Kantkw-pub kw-ojr kw-ftp -submitted to IFIP Sym. PSTV 1991 (refused) -submitted to FORTE '91 (refused) -submitted to Distributed Computing (Jan. 92) to be resubmitted to PSTV 93 ! (refused) slightly modified version of Kant 93 which is publication #805 earlier version Kant 91yes F. Khendek and G. v. BochmannMerging behavior specificationsin Journal of Formal Methods in System Design, Vol. 6, No. 3, pp. 259-293, June 19951995Khenkw-citr kw-ojr kw-pub -submitted to ICALP'93 (Int. Conf. for Automata, Language and Programming) [nov92] under the title: "Merging specification behaviors" -submitted to Journal of Formal Methods in System Design [Jan.93] (accepted)yes F. W. Tompa, J. Gecsei and G. v. BochmannData structuring facilities for interactive videotex systemsIEEE Computer, Vol.14, No.8, August 1981, pp.72-811981Tompkw-ojr kw-pubyes G. Luo, A. Das and G. v. BochmannSoftware testing based on SDL specifications with SAVEIEEE Tr. on Software Eng., Vol.20, 1 (Jan. 1994), pp. 72-781994Luokw-ojr kw-ch kw-ADjr -submitted to Comp. Networks and ISDN -submitted to IEEE Tr. on Software Eng., march 92. (accepted) -shorter version under the title "Generating tests for control portion of SDL specifications with SAVE" submitted to: 13th Int. Conf. on Distributed Computing Systems, may 25-28, 93, Pittsburgh, USA. [Sept.92] earlier version Luo 93gThe signal SAVE construct is one of the features distinguishing SDL from traditional high-level specification and programming languages. However, this feature increases the difficulties of testing SDL-specified software. We present a testing approach consisting of the following three phases: SDL specifications are first abstracted into finite state machines with save constructs, called SDL-machines; the resulting SDL-machines are then transformed into equivalent finite state machines without save constructs if this is possible; finally test cases are selected from the resulting finite state machines. Since there are many existing methods for the first and third phases, we mainly concentrate in this paper upon the second phase and come up with a method of transforming SDL-machines into equivalent finite state machines, which preserve the same input/output relationship as in the original SDL-machines. The transformation method is useful not only for testing, but also for verifying SDL-specified software. yes G. Luo, G. v. Bochmann and A. PetrenkoTest selection based on communicating nondeterministic finite-state machines using a generalized Wp-methodIEEE Trans. on Software Engineering 20, 2 (Febr. 1994), pp. 149-1621994Luokw-ch kw-ojr -submitted to IEEE Trans. on SE, on Sept. 92. NB. This paper is an extention of [Luo 92f] earlier version Luo 93hWe present a method of generating test sequences for concurrent programs and communication protocols that are modeled as communicating nondeterministic finite state machines (CNFSMs). A conformance relation, called trace-equivalence, is defined within this model, serving as a guide to test generation. A test generation method for a single nondeterministic finite state machine (NFSM) is developed, which is an improved and generalized version of the Wp-method that generates test sequences only for deterministic finite state machines. It is applicable to both nondeterministic and deterministic finite state machines. When applied to deterministic finite state machines, it yields usually smaller test suites with full fault coverage than the existing methods that also provide full fault coverage, when the numbers of states in implementation NFSMs are bounded by a known integer. For a system of CNFSMs, the test sequences are generated in the following manner: A system of CNFSMs is first reduced into a single NFSM by reachability analysis; then the test sequences are generated from the resulting NFSM using the generalized Wp-method. yes G. Luo, G. v. Bochmann, A. Das and C. WuFailure-equivalent transformation of transition systems to avoid internal actionsInformation Processing Letters, Vol.44, No.6, North-Holland, 1992, pp. 333-3431992Luokw-ojr, kw-pub, kw-ch, kw-ADjr -submitted to IPL (2nd version, may 92) accepted Oct. 92yes G. Luo, R. Dssouli, G. v. Bochmann, P. Ventakaram and A. GhedamsiTest generation with respect to distributed interfacesComputer Standards and Interfaces 16 (1994), pp.119-1321993Luokw-ch kw-ojr kw-RDjryes G. v. Bochmann and A. HafidSome principles for quality of service managementDistributed Systems Engineering Journal 4 (1997), pp. 16-27.1997Bochkw-ojr revised version of [Boch 96b]yes G. v. Bochmann and B. MargolisIncoherent Production of mensons from nuclei and vector dominancePhysical Review Letters 23, pp. 939-941, (1969)1969Bochkw-ojryes G. v. Bochmann and B. MargolisMulti-step contributions to particle production in nucleiNuclear Physics B14, pp. 609-618 (1969)1969Bochkw-ojryes G. v. Bochmann and C. A. SunshineFormal methods in communication protocol design(invited paper) IEEE Tr. COM-28, No. 4 (April 1980), pp. 624-631, reprinted in "Communication Protocol Modeling", edited by C. Sunshine, Artech House Publ., 19811980Bochkw-ojr kw-obyes G. v. Bochmann and J. P. VerjusSome comments on Transition-Oriented vs Structured specification of distributed algorithms and protocolsIEEE Trans. on SE Vol SE-13, No 4, April 1987, pp. 501-5051987Bochkw-ojr kw-pubyes G. v. Bochmann and J. TankoanoDevelopment and structure of an X.25 implementationIEEE Tr. SE-5, No. 5 (Sept. 1979), pp. 429-439, reprinted in "Communication Protocol Modeling", edited by C. Sunshine, Artech House Publ., 19811979Bochkw-ojr kw-ob kw-pubyes G. v. Bochmann and M. RaynalStructured specification of communicating systemsIEEE Trans. Computers C-32, 2(Febr. 1983), pp. 120-1331983Bochkw-ojr kw-pubyes G. v. Bochmann and P. Mondain-MonvalDesign principles for communication gatewaysIEEE Tr. on Selected Areas in Communications, Vol.8, 1 (Jan. 1990), pp. 12-21; russian translation: Express Information (overview of western publications), Information Transfer, 19911990Bochkw-ojr, kw-pub, kw-chyes G. v. Bochmann and P. WardCompiler writing system for attribute grammarsComputer Journal 21, No.2 (1978), pp. 144-1481978Bochkw-ojryes G. v. Bochmann, B. Margolis and C. L. TangEffect of correlations on coherent and incoherent processes in nucleiPhysics Letters 30B, pp. 254-256 (1969)1969Bochkw-ojryes G. v. Bochmann, B. Margolis and C. L. TangPhoton cross sections and vector dominancePhysical Review Letters 24, pp. 483-487, (1970)1970Bochkw-ojryes G. v. Bochmann, D. Ouimet and J. VaucherPerformance simulation of communication protocols based on formal specificationsTransactions of the Society for Computer Simulation, Vol.9, No.4, December 1992, pp.201-2251992Bochkw-pub, kw-ch, kw-ojr -submitted to The Society for Computer Simulation (1990) refused -submitted to Transactions of the Society for Computer Simulation (accepted)yes G. v. Bochmann, D. Rayner and C. H. WestSome notes on the history of protocol engineeringComputer Networks journal, 54 (2010), pp 3197–3209.2010Bochkw-ojrDuring the 1970ies and '80ies, the first computer communication networks were designed and implemented in the research and commercial sectors. Many of the protocols developed during that time are still in use today. This paper starts by giving an overview of these developments. Then it concentrates on the development of protocol engineering, that is, the methods for the specification of communication protocols and services, the verification of protocols and their implementation and testing. After personal views of the developments in the 1970ies, the basic concepts developed at that time are explained. The standardization of Formal Description Techniques in the 1980ies is discussed in the following section, as well as the standardization of conformance testing. The purpose of the paper is to show the long way we have come and to suggest that many of the basic concepts have not changed too much during these years, although more detailed aspects have evolved and given rise to new technological developments. yes G. v. Bochmann, E. Cerny, M. Gagne, C. Jard, A. Leveille, C. Lacaille, M. Maksud, K. S. Raghunathan and B. SarikayaExperience with Formal Specifications Using an Extended State Transition ModelIEEE Trans. COM-30, No.12 (Dec. l982), pp. 2506-25131982Bochkw-ojr kw-pubyes G. v. Bochmann, G. Gerber and J.-M. SerreSemiautomatic implementation of communication protocolsIEEE Tr. on SE, Vol. SE-13, No. 9, September 1987, pp. 989-1000, (reprinted in "Automatic Implementation and Conformance Testing of OSI Protocols", IEEE, edited by D.P.Sidhu, 1989)1987Bochkw-ojr kw-ob kw-pubyes G. v. Bochmann, J. W. Wong, T. C. Lau, D. Bourne, D. Evans, B. Kerhervé, M. V. Salem and H. YeScalability of Web-based electronic commerce systemsIEEE Communications Magazine, July 2003, Vol. 41, No. 7, pp. 110-115.2003Bochkw-ojryes G. v. Bochmann, O. Kofoed-Hansen and B. MargolisHigh energy neutron-nucleus total cross-sectionPhysics Letters 33B, pp. 222-224, (1970)1970Bochkw-ojryes G. v. Bochmann, R. Dssouli and J. R. ZhaoTrace analysis for conformance and arbitration testingIEEE Tr. on Soft. Eng., Vol.15, no.11, Nov. 1989, pp.1347-13561989Bochkw-ojr kw-RDjr kw-pubyes G. v. Bochmann, S. Poirier and P. Mondain-MonvalObject-oriented design for distributed systems - The OSI directory exampleComputer Networks and ISDN Systems 27 (1995) pp 571-5901995Bochkw-ch kw-rel-crim kw-ojr submitted to Computer Networks and ISDN Systems, [May 91] (accepted, 1993)For an object-oriented design methodology to be effective, it is important to provide methods and tools for validating the design specification before going into the implementation phase. The paper proposes a design methodology and a related object-oriented specification language which allows the validation of specifications through simulated execution, or through automatic exhaustive simulation for a certain subset of the language. The paper also discusses the relation of this design methodology and language to other design methodologies which are in wide use, such as the entity-relationship model for databases, the ASN.1 notation used for Open Systems Interconnection (OSI) communication protocols, as well as methodologies used in the standardization committees for the elaboration and description of various kinds of distributed systems standards. It is shown how these different approaches can be integrated into a single methodology and language, using the OSI Directory System as an example, which is explained in certain detail. yes G. v. BochmannA General Transition Model for Protocols and Communication ServicesIEEE Trans. Comm., COM-28, 4 (April 1980), pp. 643-650, reprinted in "Communication Protocol Modeling", edited by C. Sunshine, Artech House Publ., 19811980Bochkw-ojr kw-ob kw-pubyes G. v. BochmannComments on monitor definition and implementationInformation Processing Letters, 5, pp. 116-117, 19761976Bochkw-ojryes G. v. BochmannCompile time memory allocation for parallel processesIEEE Tr. SE-4, No. 6, (Nov. 1978), pp. 517-5201978Bochkw-ojryes G. v. BochmannDelay-independent design for distributed systemsIEEE Tr. on Software Engineering, Vol. 14 No. 8, Aug. 1988, pp.1229-12371988Bochkw-ojr, kw-pubyes G. v. BochmannDeriving protocol converters for communication gatewaysIEEE Trans. on Comm., Vol. 38, 9 (Sept. 1990), pp. 1298-13001990Bochkw-ojr, kw-pub, kw-chyes G. v. BochmannDistributed synchronization and regularityComputer Networks 3 (1979), pp. 36-431979Bochkw-ojryes G. v. BochmannFinite State Description of Communication ProtocolsComputer Networks, Vol. 2 (1978), pp. 361-3721978Bochkw-ojryes G. v. BochmannHardware specification with temporal logic - An exampleIEEE Trans. Computers C-31, No.3 (March 1982), pp.223-2311982Bochkw-ojryes G. v. BochmannHigh-level design for user and component interfacesKnowledge-Based Systems (Journal, Elsevier), Volume 17, Issues 7-8 (2004), pp. 303-310.2004Bochkw-ojrComponent-based software architecture is very important for current software engineering practice because (a) it is the basis for re-use of software at the component level, and (b), in distributed systems, the physical distribution of an application over separate computers represents a decomposition of the application. Typical e-commerce applications consist of various components sometimes belonging to different organizations, and presenting different user interfaces to various categories of users. We review in this paper the current trend in standards for inter-component communication in distributed systems, including various forms of remote procedure calls (RPC) and message passing, and paradigms for describing and implementing user interfaces in the Web environment. We discuss whether the user interface can also be described, at an abstract level, by RPC primitives. In the second part of the paper, we discuss the importance of indicating which party is responsible for making certain decisions for selecting control flow alternatives and certain parameter values. This leads to some guidelines for describing system behavior scenarios at the requirements level. We also discuss how this approach can be integrated with screen-oriented behavior definitions. yes G. v. BochmannMultiple-step production model for coherent reactions on nucleiPhysical Review D6, pp. 1938-1942 (1972)1972Bochkw-ojryes G. v. BochmannPhotoreactions on nuclei and vector meson dominance breakingPhysical Review D5, pp. 266-268, (1972)1972Bochkw-ojryes G. v. BochmannProtocol Engineering - An Historical PerspectiveIEEE Canadian Review (Magazine of IEEE-Canada), Oct. 2011 (invited paper), pp.2011Bochkw-ojrDuring the 1970ies and '80ies, the first computer communication networks were designed and implemented in the research and commercial sectors. Many of the protocols developed during that time are still in use today. This paper starts by giving an overview of these developments. Then it concentrates on the development of protocol engineering, that is, the methods for the specification of communication protocols and services, the verification of protocols and their implementation and testing. After personal views of the developments in the 1970ies, the basic concepts developed at that time are explained. The standardization of Formal Description Techniques in the 1980ies is discussed in the following section. The purpose of the paper is to show the long way we have come and to suggest that many of the basic concepts have not changed too much during these years, although more detailed aspects have evolved and given rise to new technological developments. yes G. v. BochmannProtocol specification for OSIComputer Networks and ISDN Systems 18 (April 1990), pp.167-1841990Bochkw-ojr, kw-pub, kw-styes G. v. BochmannRecent development in protocol specification, validation and testing(invited paper), Journal of China Institute of Communications, Vol 7, 4 (July 1986), pp.76-881986Bochkw-ojr G. v. BochmannSemantic equivalence of covering attribute grammarsInt. J. Comp. Inf. Sc. 8, No. 6 (Dec. 1979), pp. 523-5391979Bochkw-ojryes G. v. BochmannSemantic evaluation from left to rightComm. ACM 19, pp. 55-62 (1976)1976Bochkw-ojryes G. v. BochmannSemi-automatic implementation of Transport and Session protocolsComputer Standards and Interfaces, Vol. 5, no. 4, 1986, pp. 343-3491986Bochkw-ojryes G. v. BochmannStandard issues in data communicationsTelecommunications Policy 1, 5 (Dec. 1977), pp. 381-3881977Bochkw-ojryes G. v. BochmannUsing logic to solve the submodule construction problemJournal on Discrete Event Dynamic Systems, Vol. 23 (1), Springer, March 2013, pp. 27-59.2013Bochkw-ojrSubmodule construction is the problem of finding a new submodule which, together with a given submodule, provides a behavior that conforms to a given desired global behavior. A new formulation of this problem and its solution in first-order logic is presented, and it is shown how the known solutions to this problem in the context of various communication paradigms and specification formalisms can be derived. Communication paradigms are: synchronous rendezvous at several interfaces; interleaved rendezvous; input/output automata with complete or partial behavior specifications and with synchronous or interleaved communication. A new algorithm for deriving a progressive solution is also presented. yes G. v. BochmannVirtual-photon total cross sections on nuclei and the phases between two-body amplitudesPhysical Review D6, pp. 2715-2717, (1972).1972Bochkw-ojryes H. N. Castejòn, G. v. Bochmann and R. BraekOn the realizability of collaborative servicesJournal of Software and Systems Modeling, Vol. 10 (12 October 2011), pp. 1-21.2011Castekw-ojryes H. Yamaguchi, K. El-Fakih, G. v. Bochmann and T. HigashinoProtocol synthesis and re-synthesis with optimal allocation of resources based on extended Petri netsDistributed Computing, Vol. 16, 1 (March 2003), pp. 21-36.2003Yamakw-ojrProtocol synthesis is used to derive a specification of a distributed system called a protocol specification (a set of programs of cooperative computers) from a specification of services (called a service specification) to be provided by the distributed system to its users. It reduces design costs and errors in specifying communications between computers in the protocol specification. In general, maintaining such a distributed system involves applying frequent minor modifications to the service specification due to changes in the user requirements. Deriving a protocol specification after each modification using the existing synthesis methods is considered expensive and time consuming. Moreover, we cannot identify what changes we should make to the protocol specification for the modification to the service specification. In order to reduce the maintenance cost of such asystem, we present a new synthesis method to re-synthesize only the corresponding part of the current protocol specification after modifications to the service specification. The method consists of a set of simple rules that are applied to the protocol specification written in an extended Petri net model. An application example is given along with some experimental results. yes H. Yamaguchi, K. El-Fakih, G. v. Bochmann and T. HigashinoPetri net protocol synthesis with minimum communication costsJournal of the Franklin Institute: Engineering and applied mathematics, Elsevier, 2006, vol. 343, no 4-5 (28 ref.), pp. 501-5202006Yamakw-ojrProtocol synthesis is used to derive a protocol specification, that is, the specification of a set of application components running in a distributed system of networked computers, from a specification of services (called the service specification) to be provided by the distributed application to its users. Protocol synthesis reduces design costs and errors by specifying the message exchanges between the application components, as defined by the protocol specifications. In this paper, we propose a new synthesis method that generates optimized protocol specification. Both service and protocol specifications are described using extended Petri nets. Particularly, we propose an integer linear programming model that derives distributed applications with minimum communication costs. The model determines an optimal allocation of resources that minimizes communication costs. Our model can treat several reasonable cost criteria that could be used in various related application areas. Particularly, we have considered the following cost criteria: (a) the number of messages exchanged between different distributed applications, (b) the size of messages, (c) the number of messages based on frequency of execution, (d) communication channel costs, and (e) resource placement costs. An application example is given along with some experimental results. yes H. Yamaguchi, K. El-Fakih, G. v. Bochmann and T. HigashinoDeriving protocol specifications from service specifications written as Predicate/Transition-NetsComputer Networks, 2007, vol. 51, no1, pp. 258-2842007Yamakw-ojrIn this paper, we propose a new algorithm for the derivation of a protocol specification in Predicate/Transition-nets (Pr/T-nets), which is the specification of N communicating entities (N is given), from a given service specification given in the form of a Pr/T-net and an allocation of the places of the service specification to the N entities. Our algorithm decomposes each transition of the service specification into a set of communicating Pr/T-subnets running on the N entities. Moreover, for the efficient controlling the conflict for shared resources, we present a timestamp-based contention control algorithm and incorporate it into the derivation algorithm. A tool has been developed that implements our algorithm and works together with the existing tools for the representation of the service and derived protocol specifications. Two application examples are provided. yes H. Ye, B. Kerhervé and G. v. BochmannQoS-based distributed query processingISI (Ingénierie des Systèmes d'Information), Special Issue on Information System Quality, VOL 9/5-6 (2004), pp. 205-234.2004Yekw-ojrAmong the essential functionalities supported by distributed multimedia systems, quality of service (QoS) is of prime interest and requires the involvement of different system components. This function aims to control and guarantee the level of quality that the system is able to offer to the user. The QoS requirements may concern system performance, the quality of the information, as well as the costs of the service provision. In this paper, we propose a general framework for integrating QoS requirements into a distributed query processing environment. This framework is based on user classes, cost models, utility functions, and policy-based management. We explain how we push QoS requirements and information into the different steps of global query optimization. We present the prototype we have developed as well as the experimentation we have conducted to validate our approach. J. H. Wu, J. Y. Zhang, G. v. Bochmann and M. SavoieForward-looking WDM network reconfiguration with per-link congestion controlJournal of Network and Systems Management, Special Issue on "Advances in Optical Networks Control and Management" (21 Oct. 2011).2011Wukw-ojryes J. M. Zhang, J. Wu, G. v. Bochmann and M. SavoieGrade-of-service differentiated static resource allocation schemes in WDM networksJournal of Optical Switching and Networking (Elsevier), Vol. 5 (2008), pp. 107–122.2008Zhankw-ojryes J. P. Favreau, G. v. Bochmann and P. Mondain-MonvalOpen issues in OSI protocol developmentRéseaux et Informatique Répartie, Vol 1, No. 2 (1991), pp. 209-2261991Favrkw-ojr, kw-ch J. Tessier, R. K. Keller and G. v. BochmannA pattern system for network management interfacesCommunications of the ACM, 41 (9), pp. 86-93, 1998.1998Tesskw-ojryes J. Vaucher, G. v. Bochmann, B. Lefebvre, S. Desmarais and P. GamacheLe projet MMS - L'informatique intelligente appliquee à l'implantation et au test de logiciels industrielsIntelligence Artificielle et Sciences Cognitives au Québec, Vol.3, No.3, pp.45-581991Vauckw-ojr kw-crim kw-pubyes J. W. Wong, K. A. Lyons, D. Evans, R.J.Velthuys, G. v. Bochmann, A. Hafid and e. al.Enabling technology for distributed multimedia applicationsIBM Systems Journal, Vol. 36 No. 4 (1997), pp. 489-507.1997Wongkw-ojr Submitted for publication to IBM Systems Journal (Jan 97)This paper summarizes the results of the CITR Broadband Services major project. The goal of this major project is to investigate the software technologies required for the development of distributed multimedia applications. Of particular interest are "presentational" applications where multimedia documents, stored in database servers, are retrieved by remote users over a broadband network. Emphasis is placed on efficiency and service flexibility. By efficiency, we mean the ability to support many users and many multimedia documents. As to service flexibility, we mean the application is able to support a range of quality of service requirements from the users, adapt to changing network conditions, and support many types of multimedia document. The research program consists of six constituent projects: multimedia data management, distributed multimedia file service, quality of service negotiation and adaptation, scalable video encoding, synchronization of multimedia data, and project integration. These projects are investigated by a multi-disciplinary team from eight institutions across Canada. A multimedia news application has been defined and the results from the various projects have been integrated into a multimedia news prototype. In this paper, the system architecture, research results, as well as the prototyping effort, are discussed. yes J. Wu, J. M. Savoie, S. Campbell, H. Zhang, G. v. Bochmann and B. St.ArnaudCustomer-managed end-to-end lightpath provisioningInternational Journal of Network Management, Vol. 15, pp. 349-362 (2005).2005Wukw-ojryes J. Y. Zhang, J. Wu, G. v. Bochmann and M. SavoieResource criticality analysis of static resource allocations and its applications in WDM network planningJournal of Optical Communication and Networking, Vol. 1, No. 4, pp. 294-306, Sept. 2009.2009Zhankw-ojryes J. Y. Zhang, J. Wu, G. v. Bochmann and M. SavoieA computation method for scenario studies in WDM network planningJournal for Computation and Mathematics in Electrical and Electronic Engineering, Vol. 28, No. 6, 2009, pp. 1632-1646.2009Zhankw-ojryes K. El-Fakih, N. Yevtushenko and G. v. BochmannFSM-based incremental conformance testing methodsIEEE Trans. on SE, Vol. 30, 7 (July 2004), pp. 425-436.2004ElFakw-ojrThe selection of appropriate test cases is an important issue in software engineering. A number of methods are known for the selection of a test suite based on the specification and an implementation under test given in the form of a finite state machine. In realistic applications, this specification evolves incrementally throughout incorporating frequent modifications. In this paper, we adapt four well-known test derivation methods, namely the W, Wp, UIOv and HIS methods, for generating tests that would test only the modified parts of the evolving specification. Application examples and experimental results are provided. The results show significant gains in using incremental testing in comparison to complete testing especially when the modified part consists of up to 50% of the whole specification. yes K. El-Fakih, N. Yevtushenko, S. Buffalov and G. v. BochmannProgressive solutions to a parallel automata equationTheoretical Computer Science, 2006, vol. 362, no 1-3, pp. 17-32.2006ElFakw-ojrIn this paper, we consider the problem of deriving a component X of a system knowing the behavior of the whole system C and the other components A. The component X is derived by solving the parallel automata equation A X C. We present an algorithm for deriving a largest progressive solution to the equation that combined with A does not block any possible action in C and we establish conditions that allow us to characterize all progressive solutions. yes K. El-Fakih, R. Dorofeeva, N. Yevtushenko and G. v. BochmannFSM-based testing from user defined faults adapted to incremental and mutation testingProgramming and Computer Software, 38(4), pp.201-209 (2012).2012ElFakw-ojrWe study the problem of deriving a test suite with guaranteed fault coverage from a given finite state machine specification with respect to some given user defined faults. We consider the case when an implementation under test can have more states than its specification while user defined faults are implemented in an arbitrary way. We show that our approach can be used for FSM-based incremental and mutation testing and correspondingly we investigate cases that can be used for reducing length of obtained test suites. In some cases, worst-case length of obtained test suite becomes polynomial. Experiments show significant gains is using our approach in comparison to testing the whole specification. yes K. El-Khatib, E. Zhang and G. v. BochmannSupport for personal and service mobility in ubiquitous computing environmentsJournal of Wireless Communications and Mobile Computing, V. 4, pp. 595-607, 2004.2004ElKhkw-ojrUbiquitous computing environment is defined by the shift of computing technology from the desktop to the background. One of its most notable attributes is its potential to extend the scope of service and personal mobility. This paper describes an agent-based architecture that brings personal and service mobility to the ubiquitous computing environment. A software agent, running on a portable device carried by the user, leverages the existing service discovery protocols to learn about all services available in the vicinity of the user. Short-range wireless technology such as Bluetooth can be used to build a personal area network connecting only devices that are close enough to the user. Acting on behalf of the user and based on a number of aspects, the software agent runs a QoS negotiation and selection algorithm to select the most appropriate available service(s) to be used for a given communication session. The software agent selects as well the configuration parameters for each service. The proposed architecture supports also service hand-off to recompense for service volatility during user movement. yes M. Barbeau, P. d. Saqui-Sannes and G. v. BochmannConception et spécification par objets du contrôle centralisé d'un système de transmissionRéseaux et informatique répartie, Vol. 2, no. 1 (1992), pp. 7-201992Barbkw-ojr, kw-crim, kw-citryes M. Erradi, R. Dssouli and G. v. BochmannA framework for dynamic evolution of distributed systems specificationsRéseaux et Informatique Répartie, Vol. 3, No. 1 (1993), pp. 37-601993Errakw-ojr kw-RDjr kw-citr -submitted to Revue réseau et informatique répartie, avril 1992 (extended version of [Erra 92d]) (accepted Sept. 92) Erra 92g seems also to be an earlier version (G.v.B, 1999)Recently, object-oriented specifications of distributed systems has gained more attention. The object-oriented approach is known by its flexibility for system construction. However, one of the major challenges is to provide facilities for the dynamic modifications of such specifications during the development and maintenance process. Yet, current work has not addressed the dynamic modifications of specifications of distributed systems. In this paper, we are concerned with formal description techniques that allow for the development and the dynamic modification of executable specifications. A two-level model for the evolution of large object-oriented specifications is introduced. The first level deals with the dynamic modification of types (classes), while the second level deals with the modification of modules. We have defined a set of structural and behavioral constraints to ensure the specification consistency after its modification at both levels. To allow for dynamic modification of types and modules, we have developed a reflective object-oriented specification language which uses meta-objects to support the modification operations. In this language, types and modules are objects. yes M. Guiagoussou, R. Boutaba and G. v. BochmannA framework for alarm correlation and fault diagnosisNetworking and Information Systems Journal, Vol. 2, No. 4 (1999), pp. 459-482.1999Guiakw-ojrThis paper explores the use of structural and co-operation relations between network components for fault management, particularly during the alarm correlation and fault diagnosis phases. Aggregation, connectivity and use-of-service relations are defined as basic units for building more complex relations. Relations' utilisation policies are defined to help during the alarm correlation and fault diagnosis processes. An example of a mobile wireless network is presented to illustrate the benefits of the relation based alarms correlation. M. Marcotty, H. F. Ledgard and G. v. BochmannA sampler of formal definitionsComputing Surveys, No.8, pp.191-276, 19761976Marckw-ojryes P. Merlin and G. v. BochmannOn the Construction of Submodule Specifications and Communication ProtocolsACM Trans. on Programming Languages and Systems, Vol. 5, No. 1 (Jan. 1983), pp. 1-251983Merlkw-ojryes R. Fournier and G. v. BochmannThe equivalence in the DCP modelTheoretical Computer Science, Vol.87, No.1, September 1991, pp.97-1141991Fourkw-ojr, kw-chyes R. Gotzhein and G. v. BochmannDeriving protocol specifications from service specifications including parametersACM Transactions on Computer Systems, Vol.8, No.4, 1990, pp.255-2831990Gotzkw-ojr, kw-pubyes S. Asaduzzaman, Y. Qiao and G. v. BochmannCliqueStream: Creating an efficient and resilient transport overlay for peer-to-peer live streaming using a clustered DHTJournal on Peer-to-Peer Networking and Applications, Vol. 3, Issue 2 (2010), pp. 100-113 (published on-line, June 2009)2009Asadkw-ojryes S. Fujiwara, G. v. Bochmann, F. Khendek, M. Amalou and A. GhedamsiTest selection based on finite state modelsIEEE Transactions on Software Engineering, Vol.17, no.6, June 1991, pp. 591-6031991Fujikw-ojr, kw-pub, kw-ch -soumis à Infocom 90-07 (refused), -submitted to IFIP Symposium on Protocol Specification, Testing and Verification, 1990 (refused) -soumis IEEE Transactions March 1990The selection of appropriate test cases is an important issue for conformance testing of protocol implementations as well as in software engineering. A number of methods are known for the selection of a test suite based on the specification of the implementation under test, assumed to be given in the form of a finite state machine. This paper presents a new method which provides a logical link between several of the known methods. Called "partial W method", it has general applicability, full fault detection power, and yields shorter test suites than the W method. The second part of the paper discusses various other issues which have an impact on the selection of a suitable test suite. This includes the consideration of interaction parameters, various test architectures for protocol testing, and the fact that many specifications do not satisfy the assumptions made by most test selection methods, such as complete definition, a correctly implemented reset function, a limited number of states in the implementation, and determinism. yes S. Yu, J. Wu, J. Y. Zhang and G. v. BochmannCorrections to "Lightpath (Wavelength) Routing in Large WDM Networks" and "Dynamic Routing and Assignment of Wavelength Algorithms in Multifiber Wavelength Division Multiplexing Networks"IEEE Tr. on Communications, Vol. 28 (9), pp. 1502-1503, 2010.2010Yukw-ojryes T. Higashino and G. v. BochmannAutomatic analysis and test case derivation for a restricted class of LOTOS expressions with data parametersIEEE Tr. on Software Eng., Vol 20, 1 (Jan. 1994), pp. 29-421994Higakw-ch kw-ojr kw-pub -submitted to FORTE '91 (refused) -alternate version published in IWPTS 92 as Higa 92a -submitted to IEEE Tr. on SE, [Dec. 1992] (accepted) earlier version Higa 93byes W. W. Armstrong and G. v. BochmannProperties of Boolean functions with a tree decompositionBIT, 14 (1974), pp. 1-131974Armskw-ojryes Y. Qiao and G. v. BochmannApplying a diffusive load balancing schemes in clustered peer-to-peer systemsStudia Informatica Universalis, Ed. Hermann, Vol 8, No. 3, 2010, pp. 99 - 128.2010Qiaokw-ojryes Y. Qiao and G. v. BochmannLoad balancing in peer-to-peer systems using a diffusive approachComputing Journal, Springer, Vol. 94, 8 (2012), pp. 649-678 (doi:10.1007/s00607-012-0196-x)2012Qiaokw-ojrWe developed a diffusive load balancing technique for P2P systems. This technique uses the overlay network of a P2P system and results in the nodes of the network having similar available capacities; therefore the services hosted on these nodes are expected to have similar mean response times. In this paper, the technique is presented, including the policies, stages of operation, and decision algorithms. The convergence of the available capacities to the global average is demonstrated. The convergence speed depends on the decision algorithm, the neighborhood structure of the underlying overlay network, and the workload distribution. When used in a system with churn, the technique keeps the standard deviation of available capacities in the system within a bound. This bound depends on the amount of churn and the frequency of the load balancing operations, as well as on the distribution of node capacities. However, the sizes of services have little impact on this bound. The paper presents the results of analytical analysis and simulation studies. yes Y. Zhang, J. Wu, G. v. Bochmann and M. SavoieA proof of wavelength conversion not improving the Lagrangian bound of the static RWA problemIEEE Communications Letters, Vol 6, No. 5 (May 2009), pp. 1-3.2009Zhankw-ojrThe fact that wavelength conversion hardly improves the performance of static routing and wavelength assignment (RWA) in Wavelength Division Multiplexing (WDM) networks has been observed in many previous studies. However, other than simulation results, until now there was no formal proof of such fact. In this paper, we formally prove that wavelength conversion does not improve the Lagrangian bound of the static RWA problem. yes Z. Tao, G. v. Bochmann and R. DssouliA formal method for synthesizing optimized protocol converters and its application to mobile data networksMobile Networks and Applications, vol.2, no.3, 1997, pp.259-69. Publisher: Baltzer; ACM Press, Netherlands.1997Taokw-ojrAs mobile information networks are expanding rapidly, we expect to integrate voice, paging, electronic mail and other wireless information services. Interworking units that perform protocol conversion at the boundaries of different networks will play an important role. In this paper, we propose an efficient algorithm for constructing optimized protocol converters to achieve interoperability between heterogeneous data networks. This algorithm first derives constraints from two given protocols, and applies the constraints to channel specifications, thus removing message sequences that do not contribute to system progress. Then, an optimized converter is generated from a given service specification, the two protocol specifications and the modified channel specifications. A reduction relation is used to compare the service specification and the constructed internetworking system in order to deal with the problem of nondeterministic services. Compared with related works, our method has two advantages: (1) it generates an optimized converter; (2) it can be applied to the case that the service specification is nondeterministic. The application of the method to mobile networks is given by an example. (22 References). yes

Book ChaptersAnch> J. A. Chandler, K. El-Khatib, M. Benyoucef, G. v. Bochmann and C. AdamsLegal challenges of online reputation systemschapter in "Trust in E-services: Technologies, Practices and Challenges", R. Song et al. (eds), Idea Group Inc., 2006.2006Chankw-ocbOnline reputation systems have become important tools for supporting commercial as well as non-commercial online interactions. But as online users become more and more reliant on these systems, the question of whether the operators of online reputation systems may be legally liable for problems with these systems becomes both interesting and important. Indeed, lawsuits against the operators of online reputation systems have already emerged in the United States. In this chapter, we will take the example of eBay's Feedback Forum to review the potential legal liabilities facing the operators of online reputation systems. In particular, the applicability of the Canadian law of negligent misrepresentation and of defamation will be covered. Similar issues may be expected to arise in the other common law jurisdictions. G. v. BochmannSpecification and Verification of Computer Communication Protocolschap. 5 in "Advances in Data Communications Management", ed. T.A. Rullo, Heyden Publ., 19801980Bochkw-ob kw-pub F. W. Tompa, J. Gecsei and G. v. BochmannAlternative database strategies for videotexchap. 8.5 in "The Telidon book" ed. D. Godfrey and E. Chang, Press Porcepic Ltd, Toronto, 1981. Note: This represent original unpublished research results.1981Tompkw-ob G. v. Bochmann and E. ZhangA secure authentication infrastructure for mobile usersin Advances in Security and Payment Methods for Mobile Commerce, edited by Wen-Chen Hu, Chung-wei Lee, Weidong Kou, Idea Group Publishing, 20042004Bochkw-obyes G. v. Bochmann, B. Kerhervé and M. Mohamed-SalemService management issues in electronic commerce applicationsin Electronic Commerce Technology Trends: Challenges and Opportunities, W.Kou and Y. Yesha (eds), IBM Press, 2000, pp. 227-238.1999Bochkw-obQuality of service issues have first been discussed in relation with the performance of communication networks. However, for understanding end-to-end performance of a distributed system, it is important to also consider the performance at the application level, of the different components of the distributed application, as well as the quality of service view of the user. Most work on quality of service management at the application level has been done for applications involving access to distributed multimedia databases, such as video-on-demand. The same QoS issues apply also to electronic commerce when users access a catalog which may include multimedia information in addition to the hard-core data elements, such as name and price of the product. In this paper, we identify various issues related to quality of service management for electronic commerce applications, and concentrate on one of these, namely the selection of a server from a pool of servers in order to optimize the overall cost-performance of the system and the user's satisfaction. The paper is organized as follows. Section 2 reviews QoS specification, its categories and dimensions in distributed systems. In section 3 we look at the QoS issues (QoS specification and provision) in the specific context of electronic commerce. Section 4 describes a scalable architecture for QoS management for the electronic commerce applications. yes G. v. BochmannProtocol Engineeringcontribution to Concise Encyclopedia of Software Engineering, Derrick Morris and Boris Tamm eds., Pergamon Press, 1992, pp. 266-2711992Bochkw-ob, kw-ch Gregor a envoyé une copie également à IEEE le 27-06-90 (voir lettre envoyée à Dr. Liu le 27 juin 92 dans dossier Articles soumis).yes G. v. BochmannSpecification in Distributed Systemschap. 15 in Local Area Networks: An Advanced Course (Hutchison et al., eds), LNCS 184, Springer-Verlag, 1985, pp. 470-497; russion translation: Express Information (overview of western publications), Information Transfer, 1988, No. 33.1985Bochkw-ob K. El-Khatib, G. v. Bochmann and A. El-SaddikOn the use of Web Services in content adaptationin Services and Business Computing Solutions with XML; Applications for Quality Management and Best Practices, P.C.K. Hung (ed.), IGI Global (formerly Idea Group), 2009, pp. 121 - 135.2009ElKhkw-ob Y. Qiao, S. Asaduzzaman and G. v. BochmannPeer-to-peer platforms for high-quality web services: the case for load-balanced clustered peer-to-peer systemsbook chapter in Developing Advanced Web Services through P2P Computing and Autonomous Agents: Trends and Innovation, K. Ragab (editor), IGI-Global , USA, 2009.2009Qiaokw-obThis chapter presents a clustered peer-to-peer system as a resource organization structure for webservice hosting platforms where service quality such as response time and service availability are provided with assurance. The peer-to-peer organization allows integration of autonomous resources into a single platform in a scalable manner. In clustered peer-to-peer systems, nodes are organized into clusters based on some proximity metric, and a distributed hash table overlay is created among the clusters. This organization enables lightweight techniques for load balancing among different clusters, which is found to be essential for providing response time guarantees. Service availability is provided by replicating a service instance in multiple nodes in a cluster. A decentralized load balancing technique called diffusive load balancing is presented in the context of clustered peer-to-peer systems and evaluated for effectiveness and performance. yes

Articles in Proceedings of Refereed ConferencesAnch> A. Moosavi, S. Hooshmand, S. Baghbanzadeh, G.-V. Jourdan, G. v. Bochmann and I. V. OnutIndexing Rich Internet Applications using components-based crawlingProceedings of the ICWE 2014, Toulouse, France, July 2014. 18 pages2014Mooskw-ocryes S. Baghbanzadeh, S. Hooshmand, G.v.Bochmann, G.-V. Jourdan, S. Mirtaheri, M. Faheem and V.OnutForenRIA: The reconstruction of user-interactions from HTTP traces for Rich Internet ApplicationsProc. Twelfth Annual IFIP WG 11.9 International Conference on Digital Forensics, New Dehli, India, Jan. 2016.2016Baghkw-ocryes K. B. Hafaiedh, G. v. Bochmann, G. V. Jourdan and I. V. OnutA scalable P2P RIA crawling system with partial knowledgein Proceedings of the NETYS, Marrakech, Morocco, May 2014.2014Hafakw-ocryes S. M. Mirtaheri, G. v. Bochmann, G. V. Jourdan and I. V. OnutGDist-RIA Crawler - A greedy distributed crawler for Rich Internet Applicationsin Proceedings of NETYS 2014, Marrakech, Morocco, May 2014.2014Mirtkw-ocryes S. M. Mirtaheri, G. v. Bochmann, G. V. Jourdan and I. V. OnutPDist-RIA Crawler - A peer-to-peer distributed crawler for Rich Internet Applicationsin Proceedings of the WISE conference, October 2014.2014Mirtkw-ocryes G. v. BochmannAssociativity between weak and strict sequencingin Proc. SAM Symposium, Sept. 2014, Valencia (Spain), Springer LNCS2014Bochkw-ocryes G. v. Bochmann, M. Hilscher, S. Linker and E. R. OlderogSynthesizing controllers for multi-lane traffic maneuversProc. Symposium on Dependable Software Engineering: Theories, Tools and Applications, Nanjing, China, November 4-6, 2015, Springer LNCS.2015Bochkw-ocryes S.M. Mirtaheri, M.E. Dincturk, S. Hooshmand, G.v. Bochmann, G.V. Jourdan, I.V. OnutA brief history of Web crawlersin Proc. of CASCON 2013, Toronto, Nov. 2013. 15 pages.2013kw-ocryes S.M. Mirtaheri, D. Zou, G.v. Bochmann, G.V. Jourdan, I.V. OnutDist-RIA Crawler - A distributed crawler for Rich Internet Applicationsin Proc. of 8th Intern. Conf. on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC 2013), Compiegne, France, October 2013. 8 pages.2013kw-ocryes T. Israr, G.v. BochmannStochastic performance analysis of distributed activitiesProc. of 5th Intern. Workshop on Non-functional Properties in Modeling: Analysis, Languages and Processes co-located with 16th Intern. Conf. on Model Driven Engineering Languages and Systems, Miami, USA, September 29, 2013 (8 pages).2013kw-ocryes T. Israr, G.v. BochmannPerformance modeling of distributed collaboration services with independent inputs-outputsProc. of 5th Intern. Workshop on Non-functional Properties in Modeling: Analysis, Languages and Processes co-located with 16th Intern. Conf. on Model Driven Engineering Languages and Systems, Miami, USA, September 29, 2013 (8 pages).2013kw-ocryes J. Zhou, G. v. Bochmann and Z. ShiDistributed query processing in an ad-hoc semantic web data sharing systemProc. 15th Workshop on Advances in Parallel and Distributed Computational Models (in conjunction with IPDPS'13), Boston, May 2013.2013Zhoukw-ocrSharing the Semantic Web data in proprietary datasets in which data is encoded in RDF triples in a decentralized environment calls for efficient support from distributed computing technologies. The highly dynamic ad-hoc settings that would be pervasive for Semantic Web data sharing among personal users in the future, however, pose even more demanding challenges for the enabling technologies. We extend previous work on a hybrid P2P architecture for an ad-hoc Semantic Web data sharing system which better models the data sharing scenario by allowing data to be maintained by its own providers and exhibits satisfactory scalability owing to the adoption of a two-level distributed index and hashing techniques. Additionally, we propose efficient distributed processing of SPARQL queries in such a context and explore optimization techniques that build upon distributed query processing for database systems and relational algebra optimization. We anticipate that our work will become an indispensable, complementary approach to making the Semantic Web a reality by delivering efficient data sharing and reusing in an ad-hoc environment.yes G. v. Bochmann and S. AsaduzzamanDistributed B-tree with weak consistencyProc. Int. Conf. on Networked Systems (NETYS'13), Marrakech, Morocco, Springer LNCS 7853, pp. 159-174.2013Bochkw-ocrB-tree is a widely used data-structure indexing data for efficient Retrieval. We consider a decentralized B-tree, were parts of the structure are distributed among different processors and some parts are replicated, thus providing a decentralized indexing structure and parallel operations as desired by modern-day cloud computing platforms. To accommodate the dynamic changes due to data insertion/deletion and changes of the retrieval load, the state of the B-tree is updated by splitting and merging tree-nodes. The traditional update algorithms maintain strong consistency among the replicated states and possibly involve very many tree-nodes. We show in this paper that data retrieval and update can be performed correctly with much weaker consistency criteria. This allows to decompose the necessary updates into smaller update operations that involve only a limited number of tree-nodes, each. We show by analytical models and simulations that with weak consistency the average number of treenodes that require updating is reduced compared to the traditional B-tree update algorithms.yes S. Choudhary, M. E. Dincturk, S. M. Mirtaheri, G. V. Jourdan, G. v. Bochmann and I. V. OnutBuilding Rich Internet Applications models - Example of a better strategyProc. 13th Intern. Conf. on Web Engineering (ICWE 2013), Aalborg, North Denmark, Springer LNCS 7977, pp. 291-304.2013Choukw-ocryes S. Choudhary, M. E. Dincturk, S. M. Mirtaheri, A. Mousavi, G. v. Bochmann, G. V. Jourdan and I. V. OnutCrawling Rich Internet Applications - The state of the artProc. of the CASCON 2012, Toronto, Nov. 2012. 15 pages.2012Choukw-ocryes T. Israr and G. v. BochmannPerformance modeling of distributed collaboration servicesProc. 2nd joint WOSP/SIPEW Int. Conf. on Performance Engineering (ICPE '11), pp. 475-480 2011Israyes M. Barbeau and G. v. BochmannExtension of the Karp and Miller procedure to Lotos specificationsComputer Aided Verification '90, ACM/AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, 1991 pp. 103-1191990Barbkw-crim, kw-obyes A. Agusti-Torra, G. v. Bochmann and C. Cervello-PastorRetransmission schemes for optical burst switching over star networksProc. 2nd IFIP Intern. Conf. on Wireless and Optical Communications Networks (WOCN), March 2005, Dubai, United Arab Emirates2005Aguskw-ocrIn this work we propose an Optical Burst Switching retransmission scheme without any loss of bursts for star topology networks that exploits the entire network capacity. The basic idea is to allow the core node to resolve contentions by itself; balancing the intelligence of the network between edge and core nodes, losing neither the advantages of optical burst switching nor the simplicity of the core switch architecture. To achieve this objective, two retransmissions schemes are defined. The former confines the average number of retransmissions per burst below 2. The later exploits the whole network capacity. yes A. ElIraki, G. Lapalme and G. v. BochmannA specification method for interactive system designProc. COMPINT'85, IEEE, Montreal, Sept. 1985, pp. 760-7641985ElIrkw-ocr A. ElIraki, G. Lapalme and G. v. BochmannAda as a specification language for interactive systemsin Proc. Convention Informatique SICOB, Paris (Sept. 1985), Tome B, pp. 157-1621985ElIrkw-ocr A. ElIraki, G. Lapalme and G. v. BochmannUsing ADA as a Specification and an Implementation Language for Interactive SystemsInternational Computer Symposium ICS'88, Tamkang University, Taipei, China, Dec. 19881988ElIrkw-ocr A. Ghedamsi and G. v. BochmannTest result analysis and diagnostics for finite state machines12th International Conference on Distributed Computing Systems, Yokohama, Japan, June 1992, pp.244-2511992Ghedkw-ch kw-ocr -submitted to Distr. Computing conference, Japan paper tracking code DCS 176, accepted (Short version of P#807)yes A. Ghedamsi, G. v. Bochmann and R. DssouliDiagnosis for single transition faults in communicating finite state machinesIEEE International Conference on Distributed Computing Systems (ICDCS'93), Pittsburgh, USA, May 1993; a shorter version is also included in the proceedings of IEEE Int. Phoenix Conf. on Computer Communications, March 931993Ghedkw-ch kw-ocr kw-RDcr (extended version of P#819)In this paper, we propose a diagnostic algorithm for the case where distributed system specifications (implementations) are given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptoms and which permit the location of the detected faults. The algorithm guarantees the correct diagnosis of any single transition (output and/or transfer) faults in a system of communicating FSMs. A simple example is used to demonstrate the functioning of the different steps of the proposed diagnostic algorithm. yes A. Ghedamsi, G. v. Bochmann and R. DssouliMultiple fault diagnostics for finite state machinesProc. IEEE INFOCOM'93, San Francisco, USA, March 931993Ghedkw-ch kw-ocr kw-RDcr -submitted to the IEEE INFOCOM'93, San Francisco, USA, March 93 (accepted)yes A. Ghedamsi, R. Dssouli and G. v. BochmannDiagnostic tests for single transition faults in non-deterministic finite state machines5th Int. Workshop on Protocol Test Systems, Montréal, Canada, September 1992, pp.77-881992Ghedkw-pub kw-ch kw-ocr kw-RDcr kw-ftp -submitted to the 5th IWPTS 92, 28-30 September 1992, Montréal, Canada (accepted)We propose a generalized diagnostic algorithm for the case where more than one fault (output or transfer) may be present in one of the transitions of a non-deterministic system. Such an algorithm localizes the faulty transition in the system, once a fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptoms and which permit the location of the detected faults. The algorithm guarantees the correct diagnosis of any single or double faults (output and/or transfer) in at most one of the transitions of a system which is represented by an observably non-deterministic finite state machine (ONFSM). A simple example is used to demonstrate the different steps of the algorithm. yes A. Hafid and G. v. BochmannAn approach to quality of service management for distributed multimedia applicationsin proceedings of 3rd Intl Conference on Open Distributed Processing (ICODP95), Brisbane Australia1995Hafikw-ocr kw-citr A. Hafid and G. v. BochmannQuality of service negotiation in News-on-Demand systems: an implementationin proceedings of PROMS96 (Protocols for Multimedioa Systems), Madrid, Spain, 19961996Hafikw-ocr kw-look Request for CITR publication requested by mail on June 4, 96 Submitted to PROMS96 (Protocols for Multimedioa Systems), Madrid, Spain, in June 1996 A. Hafid, G. v. Bochmann and B. KerhervéA quality of service negotiation procedure for distributed multimedia presentational applicationsin the proceedings of the Fifth International Symposium of High Performance of Distributed Processing (HPDC-5), Syracuse, New York, 1996, pp.330-3391996Hafikw-ftp kw-ocr kw-look Request for CITR publication requested by fax and mail on May 6, 96 Approved by CITR by e-mail (1 week later)yes A. Hafid, G. v. Bochmann and R. DssouliModels for quality of service negotiation in distributed multimedia applicationsproceedings of the Second Workshop on Protocols for Multimedia Systems (PROMS95), Salzburg, Austria, 19951995Hafikw-ocr kw-citr requested approval 12 june 95- approved 3 july 95 A. Hafid, G. v. Bochmann and R. DssouliA quality of service negotiation approach with future reservations (NAFUR)in proceedings of the Fourth International Workshop on Quality of Service (IWQoS96), Paris, March 1996, pp.271-2821996Hafikw-citr kw-ocr requested citr approval on 29 march 95 approved on April 21, 95 submitted to ACM Multimedia, San Francisco (june 95) accepted to IWQoS96, notified by Hafid in Feb 96 was [Hafi 95e] A. Khoumsi and G. v. BochmannProtocol synthesis using basic LOTOS and global variablesin Proc. of Intern. Conference on Network Protocols (ICNP), 19951995Khoukw-ocryes A. Khoumsi, G. v. Bochmann and R. DssouliDérivation de spécifications de protocoles à partir de spécifications de services avec contraintes de tempsin Proc. Colloque Francophone sur l'Ingénierie de Protocoles (CFIP'93), Montréal, Canada, 1993, pp.493-5071993Khoukw-ch kw-ocr kw-RDcryes A. Khoumsi, G. v. Bochmann and R. DssouliOn specifying services and synthesising protocols for real-time applicationsIFIP Symp. on Protocol Specification, Testing and Verification, Vancouver, 1994. pp 177-192.1994Khoukw-ocr kw-pub kw-RDcr - submitted to PSTV'94 (June, Vancouver) ACCEPTED A. Khoumsi, G. v. Bochmann and R. DssouliPrise en compte de la commandabilité et de l'observabilité pour le contrôle et l'extension des systèmes à événements discrets totalement ou partiellement observablesProc. Third Maghrevian Conf. on Software Eng. and Art. Intelligence, Rabat, April 1994, pp. 461-4701994Khoukw-ocr kw-RDcr kw-pub - soumis a MIPS'94 (Maghrebian ...) NB. la publication départementale est plus complète.yes A. Khoumsi, G. v. Bochmann and R. DssouliProtocol synthesis for real-time applicationsProc. Intern. Conferences on Protocol Specification, Testing and Verification (PSTV) and FORmal descriptionTechniques (FORTE), Beijing, China, October 1999.1999Khoukw-ocryes A. Maach and G. v. BochmannA hybrid architecture using both optical burst switching and routed wavelengthProc. of IASTED Conf. on Communications and Computer Networks, Cambridge, USA, Nov. 2002, pp. 263-268.2002Maackw-ocrThe development of wavelength division multiplexing opens a new horizon in optical networks and promises to be one of the best solutions for the high demand of the bandwidth. However, with this technology, many problems arise, especially those related to the architecture to be used in optical networks to take advantage of the huge potential of this technique. Many approaches and architectures have been proposed in literatures to carry information in optical domain. Among them, optical burst switching and wavelength routed network seems to be the most successful. In this work we present a brief description of these two techniques, we discuss the advantages and disadvantages of each scheme, and we furthermore propose a new architecture that uses both methods in order to overcome the limitations imposed by each approach. yes A. Maach and G. v. BochmannSegmented burst switching: Enhancement of optical burst switching to decrease loss rate and support quality of serviceProc. of IFIP/IEEE Workshop on Next Generation Optical Network Design and Modeling (ONDM 2002), Torino, Feb. 2002, pp. 69-84.2002Maackw-ocrWith the growing demand of bandwidth and the development being made in the optical components technology, the IP over DWDM using optical burst switching seems to be the best solution to take advantage of the huge capacity of the fiber and accommodate high traffic of information. In this architecture the optical network is seen as an optical cloud with intelligent edges capable to interpret the IP address and store the information in electronic domains as well as checking and correcting errors. Optical burst switching [1,3] achieves better bandwidth exploitation because all the fiber wavelengths are shared among the bursts without resource pre-allocation and the whole wavelength capacity can be used by a burst. However with higher load, contention increases, and hence the number of dropped burst increases leading to a big lost of performance. Several methods can be used to lower the burst-dropping probability such as wavelength conversion [5] and the use of buffers [6], but these solutions are still not there due to the high cost and the immaturity of technology. In this paper we will propose another method where the burst is segmented into several parts of equal length and in case of contention only the parts at the beginning, causing the conflict, will be discarded. We will analyze and compare this method with other practical methods: delayed burst, deflection routing. The segments of burst can be used to carry different class of service since the dropping probability of each segment depends on its position in the burst. The parts at the end have the smallest probability to be dropped. We prove trough analysis and simulation that the segmented burst improves the performance and is more suitable for traffic with several class of service. yes A. Maach, A. Hafid and G. v. BochmannAn incremental restoration approach in routed wavelength networksProc. Intern. Conf. on Communication and Computer Networks (I3CN’2004), USA, 20042004Maackw-ocryes A. Maach, A. Hamid and G. v. BochmannAn incremental restoration approach in routed wavelength networks: A detailed studyConf. on Communication and Computer Networks, Cambridge (MA, USA), Nov. 2004.2004Maackw-ocrOptical networks deploying wavelength division multiplexing and wavelength routing is a promising solution to face the increasing demand of bandwidth. However, in this context the failure of a physical link may cause the simultaneous failure of several light-paths making it very difficult or even infeasible to restore the failed paths. A simple solution consists of reconfiguring the whole network and constructs a new virtual topology, over the physical one, to accommodate the failed and ongoing traffic; however, the reconfiguration of the whole network may disrupt the ongoing traffic (i.e., rerouting of non-affected paths). We propose an approach, called incremental restoration, to restore only the failed traffic without affecting/rerouting the ongoing traffic. In this paper we present a detailed study of the impact, on the overall network performance, of the incremental approach when exclusively used for restoration. A. Maach, G. v. Bochmann and H. MouftahContention avoidance in optical burst switchingProc. 3rd IEEE Intern. Conf. on Networking (ICN'04 ), February 29 - March 4, 2004 (7 pages).2004Maackw-ocryes A. Maach, G. v. Bochmann and H. MouftahRobust optical burst switchingin Proc. of 11th IEEE Inter. Telecommunications Network Strategy and Planning Symposium, June 2004, pp. 447-452.2004Maackw-ocrContention is inherent to optical burst switching; this may lead to some burst loss, which could be fatal for some kind of applications. In this paper we propose a combination of contention reduction through congestion control and bursts retransmission to eliminate completely bursts loss. The simulation results indicate that this scheme can transform an optical burst switching to a robust burst forwarder. Simulation results also show that the retransmission technique is particularly suitable for metropolitan or local area network where the additional delay incurred by the retransmission is negligible. yes A. Maach, G. v. Bochmann and H. MouftahShared protection for time-slotted optical networksProc. of IEEE NCA Symposium, 2004 (4 pages).2004Maackw-ocrShared protection aims to provide the same level of protection, against failure, as the dedicated one while using less network resources. In this paper we present the issue of survivability in a time slotted optical networks deploying DWDM. To guarantee the recovery, sufficient resource needs to be available at the setup time of the protection. However it is possible to optimize the protection capacity. Indeed the primary traffic is composed of a set of flows, which may be going through different paths. Therefore a protection could be found using just enough resources by sharing the backup among many flows. We propose here a technique to identify and provision the protection using the minimum necessary resources. We prove through simulation results that this shared mesh protection scheme can significantly reduce the required network protection capacity. yes A. Maach, H. Zeineddine and G. v. BochmannA bandwidth allocation scheme in optical TDM networksin Proc. of IEEE/IEE Intern. Conference on High Speed Networks and Multimedia Communications (HSNMC), Toulouse, July 2004, Springer LNCS, pp. 801-812.2004Maackw-ocrWavelength Routing (WR) and Optical Burst Switching (OBS) are two optical network techniques that have received enormous attention over the last decade. However, the two techniques are plagued with many problems. The main concern with WR is the inefficient bandwidth utilization. On the other hand, the problem with OBS is resource contention and burst dropping. In this paper, we propose a new scheme to share network resources using Time Division Multiplexing (TDM) instead of the statistical multiplexing employed in optical burst switching. To avoid contention and improve bandwidth utilization, we resort to a simple reservation scheme that guarantees timeslot deliveries. In addition, we propose the deployment of a new device that we call Sequencer, a simplified form of Optical Time Slot Interchangers (OTSIs), to assist in mapping incoming timeslots to some available outgoing ones. Our goal is to achieve a contention free network, and improve performance. yes A. Petrenko, G. v. Bochmann and R. DssouliConformance relations and test derivation(invited paper), Proc. Int. Workshop on Protocol Test Systems (IFIP), O. Rafiq (ed.), North Holland Publ. 1993, pp.157-1781993Petrkw-ch kw-ocr kw-RDcryes A. Petrenko, N. Yevtushenko and G. v. BochmannTesting deterministic implementations from nondeterministic FSM specificationsin Proc. of 9th International Workshop on Testing of Communicating Systems (IWTCS'96), pp.125-1401996Petrkw-ocr kw-look -accepted in May 96yes A. Petrenko, N. Yevtushenko and G. v. BochmannFault models for testing in contextin Proc. IFIP symposium FORTE-PSTV'96, Formal Description Techniques IX, R. Gotzhein and J. Bredereke, Chapman and Hall, 1996, pp. 163-178.1996Petrkw-ocr A. Vogel, B. Kerhervé and G. v. BochmannA quality-of-service driven approach to architecture and components for distributed multimedia presentational applicationsProceedings of Conference on Distributed Multimedia Systems and Applications, International Society for Mini and Microcomputers, Honolulu, Aug. 1994, pp. 101-1041994Vogekw-citr kw-ocr A. Vogel, G. v. Bochmann, P. Dini and A. PolzeConfiguration in the framework of open distributed processingProc. 2nd Int. Workshop on Configurable Distributed Systems, Pittsburgh, IEEE Computer Society Press, March 1994, pp. 106-1111994Vogekw-citr kw-ocr kw-ftpyes B. Daou and G. v. BochmannGeneralizing the Submodule Construction Techniques for Extended State Machine ModelsProc. IFIP Intern. Conf. on Formal Techniques for Networked and Distributed Systems - FORTE 2005, Springer LNCS 4229, Paris, 2006, pp. 191-195.2006Daoukw-ocryes B. Daou and G. v. BochmannSubmodule construction for extended state machine modelsProc. IFIP Intern. Conf. on Formal Techniques for Networked and Distributed Systems - FORTE 2005, Taiwan, 2005, Springer LNCS 3731, 2005, pp. 396-410.2005Daoukw-ocrIn this paper, we consider the problem of extending existing submodule construction techniques that have been developed for finite state models into more expressive and compact behavioral models that handle data through parameterized interactions, state variables and simple guards. We provide a be-havioral model based on extended Input-Output Automata and describe an algo-rithm that provides the solution to the submodule construction problem in the context of this extended behavioral model. This algorithm is based on abstract-ing variable configurations using the concept of variable partitions, and splitting of states obtained from the finite state machine model in order to satisfy the constraints imposed by the values of exchanged interaction parameters. yes B. Kerhervé, A. Pons, G. v. Bochmann and A. HafidMetadata modelling for quality of service management in distributed multimedia systemsin Proceedings of IEEE Metadata Conference, Silver Spring, Maryland, April 16-18, 19961996Kerhkw-look kw-ocr Requested approval on Feb 14, 1996 (by B.Kerhervé). Approved by fax to B.Kerhervé on March 11, 96yes B. Kerhervé, A. Vogel, G. v. Bochmann, R. Dssouli, J. Gecsei and A. HafidFunctional requirements for a generic distributed multimedia presentational applicationin Proceedings of ICCCN 94, San Francisco, September, 1994, pp.242-2471994Kerhkw-citr kw-ocr kw-RDcryes B. Kerhervé, A. Vogel, G. v. Bochmann, R. Dssouli, J. Gecsei and A. HafidOn distributed multimedia presentational applications - functional and computational architecture and QoS negotiationin G. Neufeld, R.Ito (eds.), Proceedings of the International IFIP Workshop on Protocols for High-Speed Networking, Vancouver, Aug. 1994. A preliminary version of this paper also appeared in the Workshop on Multimedia Applications and QoS verification, G.v. Bochmann, J. de Meer, and A. Vogel (eds.) Montreal, May 19941994Kerhkw-citr kw-ocr kw-RDcryes B. Sarikaya and G. v. BochmannSome experience with test sequence generation for protocolsProc. 2-nd Int. Workshop on Protocol Specification, Testing and Verification, North Holland, 1982, pp. 555-5671982Sarikw-ocr B. Sarikaya and G. v. BochmannSynchronization issues in protocol testingProc. ACM SIGCOMM Symposium, Austin, 1983, pp.121-1281983Sarikw-ocryes B. Sarikaya and G. v. BochmannObtaining normal form specifications for protocolsProc. COMNET'85, IFIP, Computer Network Usage: Recent Experiences, North Holland, 1985, pp. 601-6131985Sarikw-ocr B. Sarikaya, G. v. Bochmann and E. CernyA Test Design Methodology for Protocol TestingProc. 18-th Hawai Int. Conf. on Systems Sciences, Jan. 1985, 710-7211985Sarikw-ocr kw-pub B. Sarikaya, G. v. Bochmann, M. Maksud and J. M. SerreFormal specification based conformance testingProc. ACM SIGCOMM Symposium, Aug. 1986, pp. 236-2401986Sarikw-ocryes B. Wan, G. v. Bochmann and G. V. JourdanImproved usage model for Web applications reliability testingProc. 23th IFIP Int. Conf. on Testing Software and Systems (ICTSS'11), Paris, Nov . 2011, Springer LNCS 7019, pp. 15-31.2011Wankw-ocryes B. Wan, G. v. Bochmann and G. V. JourdanEvaluating reliability-testing usage modelsProc. IEEE Computer Software and Applications Conference (COMPSAC 2012), pp. 129 – 1372012Wankw-ocrTesting the reliability of an application usually requires a good usage model that accurately captures the likely sequences of inputs that the application will receive from the environment. Markov usage models and their variations have been found to be well suited for generating test cases that are statistically close to what the application is expected to receive when in production. In this article, we study the specific case of web applications. We present an evaluation method for estimating the accuracy of various reliability-testing usage models. The method is based on comparison between observed users’ traces and traces inferred from the usage model. Our method gauges the accuracy of the reliability-testing usage model by calculating the sum of goodness-of-fit values of each traces and scaling the result between 0 and 1. yes B. Zhou, P. He and G. v. BochmannBlocking analysis for time-space switched all-optical networksProc. of 4th IASTED Intern. Multi-Conference on Wireless and Optical Communication (WOC 2004), July 8-10, 2004, Banff, Canada, pp. 756-761.2004Zhoukw-ocrOptical time division multiplexing (OTDM) allows multiple traffic streams to share the bandwidth of a wavelength efficiently. In this paper, we present a new analytical model, based on the inclusion-exclusion principle from combinatorics, for evaluating the blocking performance of time-space switched optical networks with fixed routing and random wavelength/timeslot assignment. This model can be used to analyze networks with arbitrary topologies and traffic patterns. The accuracy of the proposed analytical model is validated through simulations. yes C. Jard and G. v. BochmannAn approach to testing specificationsProc. ACM Software Engineering Symposium on High-Level Debugging, March 1983, pp. 53-591983Jardkw-ocr kw-pubyes C. Kant, T. Higashino and G. v. BochmannDeriving protocol specifications from service specifications written in LOTOSProc.12th IEEE Int. Phoenix Conf. on Computer Communications, Scottsdale, USA, March 931993Kantkw-ch, kw-pub kw-ocr kw-ftp -submitted to IFIP Sym. PSTV 1991 (refused) -submitted to FORTE '91 (refused) -submitted to Distributed Computing (Jan. 92) to be resubmitted to PSTV 93 ! (refused)A complete communication system is broken down into a number of protocol layers each of which providing services to the layer above it and using services provided by the underlying layer. A service specification defines a particular ordering of the operations that a given layer provides to the layer above it. The active elements in each layer are called entities and they use a protocol in order to implement their service definition. Based on this relation between the service and protocol concepts we have developed algorithms for deriving protocol entity specifications from formal service specification. The derived protocol entities ensure the correct ordering of the service primitives by exchanging synchronization messages through an underlying communication medium. This paper presents a new version our derivation algorithms; it is an extension of the method to a more comprehensive specification language. This version of the algorithm can handle now all operators and unrestricted process invocation and recursion as defined by basic LOTOS. The correctness of the derivation algorithm is formally proved. The paper presents also an application of the method to a simplified Transport layer: the service and the derived transport protocol entities are given in Annexes. C. Kawa and G. v. BochmannHierarchical Multi-Network Interconnection Using Public Data NetworksProc. IEEE INFOCOM '87 Conference, San Francisco, 1987, pp. 426-435. Reprinted in Network Interconnection and Protocol Conversion, P.E.Green (ed.), IEEE Press, 1988, pp. 284-2931987Kawakw-ocr kw-ob kw-pub C. Kawa, A. Jacques and G. v. BochmannComputer networks interconnection at the Network and Transport layersProc. Symposium on Communications, Queen's University, Kingston, Ont., June 1986, pp. C.3.1-C.3.41986Kawakw-ocr C. Peng, G. v. Bochmann and T. J. HallQuick Birkhoff-von-Neumann decomposition algorithm for agile all-photonic network coresaccepted by 2006 IEEE International Conference on Communications (ICC 2006).2006Pengkw-ocryes C. Peng, P. He, G. v. Bochmann and T. J. HallDelay performance analysis for an agile all-photonic star network2006 IFIP International Conference on Networking (IFIP Networking 2006), to be published.2006Pengkw-ocryes C. Peng, P. He, G. v. Bochmann and T. J. HallDelay performance analysis for an agile all-photonic star network with PONsProc. Canadian Conference on Electrical and Computer Engineering (CCECE), 2006.2006Pengkw-ocr C. Peng, S. A. Paredes, T. J. Hall and G. v. BochmannConstructing service matrices for agile all-optical coresProc. Symposium on Computers and Communications (ISCC 2006), IEEE, (Best Student Paper Award).2006Pengkw-ocryes C. Wu and G. v. BochmannAn execution model for LOTOS specificationsIEEE Global Telecommunications Conference (Globecom), December 19901990Wukw-ocr, kw-pub, kw-chyes C. Wu and G. v. BochmannFairness in LOTOSin the proceedings of the International Conference on Formal Description Techniques (FORTE'91), K.R. Parker and G.A. Rose eds, North-Holland, Sydney, Australia, 1991, pp.543-5581991Wukw-ocr, kw-pub, kw-ch -submitted to IFIP Symposium June 1991 -submitted to FORTE'91, Sydney, Australia (accepted) -refused in Acta InformaticaFairness is an important concept related to specification languages which are based on concurrent and non-deterministic computation models; it is related to liveness. In this paper we formally introduce fairness to the LOTOS specification language by employing the standard LOTOS semantics together with a formalism which states restrictions on fair infinite execution sequences. We extend three fairness concepts of CSP, namely process, guard and channel fairness, to LOTOS. Certain features of LOTOS, such as the dynamic creation of processes, the dynamic relation between gates and processes, and related membership in multi-way rendezvous, not present in CSP, make the definition of fairness difficult. We introduce the concept of "transition groups", which leads to a general notion of fairness, and use LOTOS action indexes to define the concepts of process, alternative and channel for LOTOS. We explain how a fair execution model for LOTOS can be obtained, and demonstrate the use of these concepts by showing how fairness assumptions can be used to prove liveness properties for a given LOTOS specification. yes C. Wu, G. v. Bochmann and M. YaoFairness of N-party synchronization and its implementation in a distributed environmentProc. Int. Workshop on Distributed Algorithms (WDAG'93), LNCS 725, Springer Verlag, 1993, pp. 279-2931993Wukw-ch, kw-pub kw-ocr -Submitted in Oct. 91 to Distributed Computing Systems Conf. in Japan -submitted to Concur'92 (rejected) -submitted to 7th Int. Workshop on Distributed Algorithms, Lausanne, Switzerland, Sept.27-29, 1993 [Avril 93]Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At implementation level, the question becomes how to implement the underlying fairness which is assumed to be true at the specification level. In this paper, we study four types of fairness, the so-called w-fairness, s-fairness, u-fairness and su-fairness, in the context of the design of N-party synchronization algorithms. Within an abstract model for distributed systems, we formally introduce the four fairness concepts. We formally present, in the form of extended finite state machines, several distributed N-party synchronization algorithms which satisfy different fairness properties. The algorithms given in this paper are abstract in a sense that they are not optimized. The abstraction makes the construction of the algorithm and its proof of correctness easier. yes D. Desbiens, G. v. Bochmann, A. Das and J. DarghamModeling and formal specification of the personal communication serviceProc. IEEE INFOCOM'93, San Francisco, CA, March 19931993Desbkw-ocr kw-citr kw-ADcryes D. Ramazani and G. v. BochmannSpecification of composite objects based on the ODP reference modelin Proc. First IFIP Workshop on Formal Methods for Open Object-based Distributed Systems (FMOODS), Paris, France, 1996, pp.207-221.1996Ramakw-ocrIn this paper, we describe our experience in using the RM-ODP to specify composite objects. The concept of a composite object as defined in RM-ODP does not take into account its dynamic structure as well as the classification of its properties into inherent, aggregate and emergent properties. To make this possible, we have to complement the description of composite objects with explicit contracts involving the composite object and its components. This interpretation of composite objects in terms of ODP concepts is technically sound. It allows a clean definition of the structure, the inherent and aggregate properties of the composite object. However, this approach is conceptually questionable since its guiding philosophy is based on ignoring the distinction between composition and interconnection of objects. This observation is grounded on the usage of contracts for defining significant aspects of object composition. We come out with the same conclusion when experimenting the description of composite objects using Darwin. What these experiments show is that we still have to rely on the concept of interconnection of objects to define the semantics of composition of objects. yes D. Ramazani and G. v. BochmannExtending OMT for the Specification of Composite Objectsin Proc. 20th Intern. Conf. on Technology of Object-Oriented Languages and Systems (TOOLS-USA'96), August 1996.1996Ramakw-ocrIn engineering and telecommunication applications, it is common to have composite objects. Existing object-oriented methods propose many approaches for modeling these objects. However, these approaches fail to capture the linkage between the structure and the behavior of composite objects. In [Ramazani 95a], a conceptual framework for the description of composite objects prescribes how this linkage can be established by means of a set of fundamental concepts. In order to make this framework more usable in practice, this paper shows how OMT can be adapted and extended to describe composite objects according to this framework. A great deal of these adaptations and extensions require only minor notational and semantic changes to the method. This work also shows how more requirements in connection with composite objects can be captured, made explicit, and precisely stated using an extended OMT. yes D. Ramazani and G. v. BochmannApproaches to the specification of object associationsin Proc. IFIP Workshop on Formal Methods for Open Object-based Distributed Systems (FMOODS), Canterbury, UK, (H.Bowman, J. Derrick, eds.), Chapman-Hall, 1997, pp. 231-246.1997Ramakw-ocrMany practitioners agree on the key role of object associations during the requirements specification and analysis phases of application development, since they contribute to the definition of the semantics of applications. However, the literature shows that there are multiple semantics for associations, and confusion about how they should be represented. As a matter of fact, various interpretations of the concept of association exist, leading to a multiplicity of representations. The contribution of this paper is an exposition of four practical approaches to the formal specification of associations. It also introduces a conceptual model for associations which is used as a baseline for comparing the four approaches to formal specification of associations. These four approaches are based on different constructs of the specification language Object-Z which can be used for formally describing associations. The way these approaches capture the requirements represented by associations is central to selecting the approach to be used for the application development. yes D. Ramazani and G. v. BochmannObject composition: a case studyProc. IFIP Workshop on Formal Methods for Open Object-based Distributed Systems (FMOODS), Italy, 1999,1999Ramakw-ocryes D. Ramazani, P. Flocchini and G. v. BochmannDistributed objects with sense of directionin Proc. First Int. Workshop on Distributed Data and Structures, Orlando (US), March 30, 1998 (publ. by Carleton Scientific, 1999), pp. 1 - 12.1998Ramakw-ocryes E. Cerny and G. v. BochmannTesting Implementations of an Application-Level Communication Protocol: Inter-Library LoanProc. FTCS '85, IEEE1985Cernkw-ocr kw-pub E. Cerny, G. v. Bochmann, M. Maksud, A. Leveille and J. M. SerreExperiments in testing communication protocol implementationsProc. Fault-Tolerant Comp. Sym. '84, IEEE, pp. 204-2091984Cernkw-ocr kw-pub E. Htite, R. Dssouli and G. v. BochmannSélection des tests à partir de spécifications orientées objetsProc. Third Maghrevian Conf. on Software Eng. and Art. Intelligence, Rabat, April 1994, pp. 525-5341993Htitkw-ocr kw-RDcr kw-pub kw-citr kw-ftpyes E. Madja, A. Hafid, R. Dssouli, G. v. Bochmann and J. GecseiMeta-data modelling for quality of service management in the World Wide Webin Proc. of Int. Conf. on Multimedia Modeling, Lausanne, Switzerland, 19981998Madjkw-ocryes E. Madja, G. v. Bochmann, R. Dssouli and J. GesceiHTML extensions for Multimedia Documents and Quality of Service management on the WebProc. NOTERE'97, Pau, France, Oct. 1997.1997Madjkw-ocrThe purpose of this paper is to describe an extension of HTML which supports the description of multimedia documents, including text, image, audio and video, and which includes necessary meta information for quality of service negotiation. Based on the general structure of multimedia documents and associated QoS parameters, which where developed under an ongoing CITR project, we propose an HTML extension which uses the recently defined OBJECT and RESOURCE elements. An ongoing implementation of a user agent for QoS negotiation using these extensions is also described. This implementation intends to allow the concurrent use of presentation protocols which are currently in use over the Internet for the presentation of real-time audio and video. yes F. Dankar and G. v. BochmannRemoving Timed Delays in Stochastic AutomataProc. 7th Intern. Workshop on Performability Modeling of Computer and Communication Systems (PMCCS), Torino, Sept. 2005.2005Dankkw-ocrWe present a method to remove timed delays (timed internal actions) from a subset of stochastic automata. After removing the internal actions, the steady state probability of a subset of the states of the automata is preserved. The stochastic automata considered in this paper have the property of being Markov regenerative processes. yes F. K. Dankar and G. v. BochmannMarkovian component modelingProc. MATHMOD Conference, Vienna, Austria, Febr. 2003.2003Dankkw-ocrWe consider the following problem: For a real-time probabilistic system S consisting of two submodules M1 and M2, the specification of the global system S is given, as well as part of the specification of M1 and part of the specification of M2 (the possible traces are known but not their probabilities nor their timing delays). We need to fully determine of M1 and M2 in a way to “best approximate” the composition M1´M2 to S. In this paper, a solution of this problem in the context of continuous time Markov chains (CTMC) is given. yes F. Khendek and G. v. BochmannFormalization of the CORDS process model using MondelIBM Center for Advanced Studies Conference (CasCon'92), Toronto, Canada, November 1992, pp.351-3601992Khenkw-ocr kw-ibm - submitted to IBM-CASCON'92, accepted F. Khendek and G. v. BochmannFormal specifications design, evolution and reuseProc. of CASCON'93, Toronto, Canada, October 1993, pp. 184-1931993Khenkw-ocr kw-ibm F. Khendek and G. v. BochmannIncremental construction approach for distributed system specificationsProc. of the sixth Int. Conf. on Formal Description Techniques (FORTE'93), Boston, Massachussets, October 1993, pp.89-1041993Khenkw-citr kw-pub kw-ocr -submitted to FORTE'92, Lannion, France, 13-16 Oct.92. sous le titre: "Incremental construction of LOTOS specifications with internal structure" (refused) -submitted to TAPSOFT'93, Orsay, France, 13-17 avril 93. [15/10/92] (refused) -submitted to PSTV'93, Liege, Belgique (May 93) [Dec.92] (refused) -submitted to FORTE'93 (accepted)In this paper, we propose an incremental construction approach for distributed system specifications. These specifications are structured as a parallel composition of subsystem specifications. The approach consists of merging two specifications Sold and Sadded into a new specification Snew, such that Snew extends Sold and Snew extends Sadded. Moreover, in the case of cyclic behaviors, Snew offers a choice between behaviors of Sold and behaviors of Sadded, in a recursive manner. The derived specification Snew has the same internal structure as Sold. Our approach is described in terms of Labelled Transition Systems, and it is applicable for many specification languages. yes F. Khendek, G. v. Bochmann and C. KantNew results on deriving protocol specifications from services specificationsProc. SIGCOMM'89, July 1989, in Computer Communications Review Vol.19 no.4, pp. 136-1451989Khenkw-pub, kw-ocryes G. Luo, A. Das and G. v. BochmannTest selection based on SDL specifications with SAVESDL'91: Evolving methods, Ove Færgrmand, Rick Reed editors, Noth-Holland Publ., pp.313-324, (5th SDL Forum (CCITT), September 1991, Glasgow, UK)1991Luokw-ocr, kw-ADcr, kw-pub, kw-chyes G. Luo, A. Das and G. v. BochmannGenerating tests for control portion of SDL specificationsIFIP sixth International Workshop on Protocol Test Systems, Pau, France, September 1993, pp. 51-661993Luokw-ocr kw-ADcr kw-chyes G. Luo, A. Petrenko and G. v. BochmannSelecting test sequences for partially-specified nondeterministic finite state machinesProc. of the International Workshop on Protocol Test Systems (IWPTS'94), Tokyo, Japan, Nov. 1994, pp.95-1101994Luokw-ch kw-ocr kw-pub kw-ftp -submitted to IEEE Transactions on Computers [Dec.92]. -shorter version submitted to PSTV'93 [Dec.92] under the title: "Selecting conformance tests for partially-specified nondeterministic protocol machines".yes G. Luo, G. v. Bochmann, B. Sarikaya and M. BoyerControl-flow based testing for Prolog programsThird International Symposium on Software Reliability Engineering, Oct. 92, IEEE Computer Society Press, pp.104-1131992Luokw-ch kw-ocr kw-pub -submitted 10th Annual Software Reliability Symp. Denver, CO, refused -submitted to third international symposium on software reliability Engineering, acceptedyes G. Luo, R. Dssouli, G. v. Bochmann, P. Ventakaram and A. GhedamsiGenerating synchronizable test sequences based on finite state machines with distributed portsProceedings of the IFIP Sixth International Workshop on Protocol Test Systems, Pau, France, September 1993, pp. 53-681993Luokw-ocr kw-RDcr kw-chyes G. Luo, R. Dssouli, G. v. Bochmann, P. Ventakaram and A. GhedamsiTest generation for the distributed test architectureSingapore International Conference on Networks, Singapore, September 1993, pp. 670-6741993Luokw-ocr kw-RDcr kw-chyes G. v. Bochmann and A. FinkelImpact of Queued Interaction on Protocol Specification and VerificationProc. Intern. Symp. Interoperable Inf. Systems (ISIIS), Nov. 1988, Tokyo, pp. 371-3821988Bochkw-ocr, kw-pub G. v. Bochmann and A. HafidSome principles for quality of service managementin proceedings of the Fourth International Workshop on Quality of Service (invited paper), Paris, France, March 6-8, 1996. Revised version published in the Distributed Systems Engineering Journal, Vol. 4, 1997, pp. 16-271996Bochkw-look kw-citr kw-ocr revised version submitted for publication in Distributed System Engineering Journal, 1996yes G. v. Bochmann and A. JacquesGateways for the OSI Transport ServiceProc. IEEE INFOCOM'87 Conference, San Francisco, 19871987Bochkw-ocr kw-pub G. v. Bochmann and A. PetrenkoProtocol testing - Review of methods and relevance for software testingACM International Symposium on Software Testing and Analysis (ISSTA'94) - inivited paper, Seattle, USA, 1994, pp 109-1241994Bochkw-ch kw-ocr kw-pub kw-ftpCommunication protocols are the rules that govern the communication between the different components within a distributed computer system. Since protocols are implemented in software and/or hardware, the question arises whether the existing hardware and software testing methods would be adequate for the testing of communication protocols. The purpose of this paper is to explain in which way the problem of testing protocol implementations is different from the usual problem of software testing. We review the major results in the area of protocol testing and discuss in which way these methods may also be relevant in the more general context of software testing. yesyes G. v. Bochmann and C. S. HeFerry Approaches to Protocol Testing and Service InterfacesProc. Intern. Symp. Interoperable Inf. Systems (ISIIS), Nov. 1988, Tokyo, pp. 303-3091988Bochkw-ocr, kw-pub G. v. Bochmann and D. OuimetOSI specifications using ASN.1 and other formal description techniquesProc . 9-th Brasilian Symposium on Computer Networks, Florianopolis, May 1991, Bresil (invited paper)1991Bochkw-ocr kw-ch kw-lookyes G. v. Bochmann and G. V. JourdanAn overview of content distribution and content access in peer-to-peer systems(invited paper)Proc. NOTERE Conference, Marakech (Maroco), June 2007.2007Bochkw-ocryes G. v. Bochmann and J. GecseiA unified method for the specification and verification of protocolsProc. IFIP Congress 1977, pp. 229-2341977Bochkw-ocryes G. v. Bochmann and J. GecseiTowards Videotex StandardsViewdata 80, London, mars 1980, pp. 420-4271980Bochkw-ocr kw-pub G. v. Bochmann and J. PickensA methodology for the specification of a message transport systemProc. Int. Symp. on Computer Message Systems (IFIP TC-6), North Holland, (1981), pp. 221-2321981Bochkw-ocr G. v. Bochmann and J. VaucherAdding Performance Aspects to Specification LanguagesIFIP Symposium on Protocol Specification, Testing and Verification, Atlantic City, June 1988, pp.19-311988Bochkw-ocr, kw-pubIn the area of communication protocol design, so-called Formal Description Techniques (FDTs) are used to describe the behavior of the system components executing the communication protocol. Such formal specifications can be executed in a simulated mode in order to detect any remaining logical errors in the specification. If a specification language is extended with performance primitives which allow the description of such performance aspects as time delays, resource usage and stochastic behaviour, then simulation can be the basis for the performance evaluation of a complete system. The paper discusses this combination of logical and performance aspects in a single specification, and the choice of appropriate language elements for expressing the performance aspects. Such language elements are presented for several FDTs, namely Estelle, SDL and Lotos. Emphasis is placed on the justification of the chosen language elements and their relation with other well-known performance models, such Markov models, queuing networks, timed Petri nets and simulation. yes G. v. Bochmann and M. DeslauriersCombining ASN1 support with the LOTOS languageProc. IFIP Symp. on Protocol Specification, Testing and Verification IX, June 1989, North Holland Publ., pp.175-1861989Bochkw-ocr, kw-pub G. v. Bochmann and O. B. BellalTest result analysis with respect to formal specificationsProc. 2-nd Int. Workshop on Protocol Test Systems, Berlin, Oct. 1989, pp.272-2941989Bochkw-ocr, kw-pubThere are two aspects to testing: (1) the selection of appropriate test inputs and (2) the analysis of the observed interactions of the implementation under test (IUT) in order to determine whether they conform to the IUT's specification. The paper considers the second aspect with particular attention to the testing of OSificommunication protocol implementations. A system is described which analyses an observed test trace of interactions with respect to a reference specification which is assumed to be written in LOTOS. In the case that an error is detected, the system also provides some diagnostic information for locating the "error" in the analyzed trace. The practical use of such a trace analysis system is discussed, as well as the possibility of using a similar approach for the validation of the verdicts which are included in the standardized OSificonformance test cases. yes G. v. Bochmann and P. M. MerlinOn the construction of communication protocolsICCC, 1980, pp.371-378, reprinted in "Communication Protocol Modeling", edited by C. Sunshine, Artech House Publ., 1981; russian translation: Problems of Intern. Center for Science and Techn. Information, Moscow, 1981, no. 2, pp. 146-1551980Bochkw-ocr kw-ob G. v. Bochmann and R. GotzheinDeriving protocol specifications from service specificationsProc. ACM SIGCOMM Symposium, 1986, pp. 148-1561986Bochkw-ocr, kw-pubyes G. v. Bochmann and R. J. ChungA Formalized Specification of HDLC Classes of Procedures(invited paper) National Telecomm. Conf., Dec. 1977, proc. pp. 03A..2-1 to 2-11. Reprinted in Advances in Computer Comm. and Networking, ed. W. Chu, Artech, 791977Bochkw-ocr kw-ob kw-pub G. v. Bochmann and Z. YangQuality of service management for teleteaching applications using the MPEG-4/DMIFProc. of Intern. Workshop on Interactive Distr. Multimedia Systems and Telecom. Services, Toulouse, Oct. 1999, Springer Verlag, LNCS 1718, pp.133-146.1999Bochkw-ocrIn the context of distributed multimedia applications involving multicast to a large number of users, a single quality of service level may not be appropriate for all participants. It is necessary to distribute part of the QoS management process and allow each user process to make certain QoS decisions based on its local context. In order to allow for different QoS options, we assume that each source provides, for each logical multimedia stream, several different stream variants, representing different choices of user-level QoS parameters. The paper presents the design of a teleteaching system which uses this paradigm for QoS negotiation, and explains how the Delivery Multimedia Integration Framework (DMIF) of MPEG-4 can be adapted as a session protocol for such an application. In fact, it appears that this DMIF protocol, which is now being extended by ISO (DMIF Version 2) to the context of multicasting, provides some general session management functions which are quite useful for distributed multimedia applications using broadcasting. yes G. v. Bochmann, A. Das, R. Dssouli, M. Dubuc, A. Ghedamsi and G. LuoFault models in testingProc. IFIP Intern. Workshop on Protocol Test Systems, Netherlands, Oct. 1991 (invited paper), pp. (II-17)-(II-32)1991Bochkw-ocr kw-RDcr kw-ADcr kw-pub kw-ch G. v. Bochmann, A. Petrenko and M. YaoFault coverage of tests based on finite state models(invited paper) IFIP Intl Workshop on Protocol Test Systems (IWPTS'94), Tokyo 1994, Chapman and Hall, pp.55-761994Bochkw-ch kw-ocryes G. v. Bochmann, A. Petrenko, O. Bellal and S. MaguiragaAutomating the process of test derivation from SDL specificationsin Proc. eighth SDL Forum, INT in Evry, Sept. 22-26, 19971997Bochkw-look kw-ocr submitted for publication in SDL Forum 1997 in Feb. 97 Acceptance notified March 97In this paper, we present a set of automated tools for the development of conformance tests following a methodology based on a partial unfolding of a given SDL specification, describing the behavior of the system under test. The methodology relies on FSM-based test derivation methods which focus on the fault coverage aspect of testing. The tool kit offers to the test designer a number of options for achieving different levels of fault coverage. In particular, it provides support for partial specifications, grouped transitions and timers. The tests, which are generated in SDL or in TTCN must be completed by hand concerning certain aspects related to signal parameters, however, most of these adjustments are relatively straightforward and certain parts of the original SDL specification can be reused without change. We also report on our experience of using the tool kit for the development of a test suite for the ATM PNNI signalling protocol. yes G. v. Bochmann, B. Kerherve, A. Hafid, P. Dini and A. PonsArchitectural design of adaptive multimedia systemsproceedings of IEEE Workshop on Multimedia Software Development, Berlin, Germany, March 25-26, 19961996Boch kw-citr kw-ocr(accepted, Dec1995, e-mail from B. Kerherve) (accepté par CITR le 10 nov.95)yes G. v. Bochmann, B. Kerhervé, H. Lutfiyya, M. Salem and H. YeIntroducing QoS into electronic commerce applicationsProc. of Second International Symposium on Electronic Commerce, April 2001, Hong Kong, China, published as "Electronic Commerce Technologies", LNCS 2004, Springer Verlag, pp. 138-147.2001Bochkw-ocrBusiness to consumer is expected to be one of the fastest growing segments of electronic commerce. One important and challenging problem in such context, is the satisfaction of user expectations about the Quality of Service (QoS) provided when applications are deployed on a large scale. In this paper, we will examine the use of dynamic QoS management techniques in combination with replication at the various architectural levels of an electronic commerce application. yes G. v. Bochmann, C. He and D. OuimetProtocol testing using automatic trace analysisCanadian Conf. on Electrical and Computer Engineering, Montréal, Sept. 1989, pp. 814-8201989Bochkw-ocr, kw-pub G. v. Bochmann, D. Desbiens, M. Dubuc, D. Ouimet and F. SabaTest result analysis and validation of test verdictsProc. Workshop on Protocol Test Systems (IFIP),1990, North-Holland1990Bochkw-ocr, kw-chao, kw-pub McLean, Virginia, US, Oct. 90Formal description techniques (FDT's) are useful in the protocol development cycle, particulary in the conformance testing area. In this paper, we present TETRA, a test and trace analysis tool based on the LOTOS FDT which can be used to automatically compare the specified verdicts of a conformance test case with a protocol specification, or to analyse results of a test run with the reference specification. We also describe our experience with this tool for the validation of a X.25 TTCN test suite and for the testing of an ACSE implementation. yes G. v. Bochmann, D. Ouimet and G. NeufeldASN.1 and Estelle implementation support toolsProc. Third Int. Conf. on Formal Description Techniques, IFIP (FORTE'90), Nov. 1990, Madrid, pp.531-5341990Bochkw-ocr, kw-stFormal specifications are a well-known technique for improving software development. In the context of OSificommunication protocol standards, Formal Description Techniques (FDT's) have been developed for the description of communication protocols and services. In addition, a notation called ASN.1 is used for the descriptions of the data structures of protocol data units exchanges between communicating entities at the application layer. Existing FDT's, such as Estelle, LOTOS and SDL, do not include facilities to directly manipulate data structures defined in ASN.1. This makes using FDT's for distributed applications difficult. This paper deals with the integration of ASN.1 with Estelle and the issues involved with the integration of corresponding implementation tools. It is shown how the encoding and decoding routines automatically generated from the ASN.1 definitions can be combined with implementation code semi-automatically generated from the Estelle specification of the protocol. An application for a simple protocol is given. yes G. v. Bochmann, E. Cerny, G. Gerber, R. Dssouli, M. Maksud, B. H. Phan, B. Sarikaya and J. M. SerreUse of formal specifications for protocol design, implementation and testingProc. IFIP Workshop on Protocol Specification, Testing and Verification, Sky Top, NY, USA, 1984, Y. Yemini et al. eds., North Holland, pp.137-1461984Bochkw-ocr kw-RDcr G. v. Bochmann, E. Cerny, M. Gagne, C. Jard, A. Leveille, C. Lacaille, M. Maksud, K. S. Raghunathan and B. SarikayaExperience with formal specificationsProc. 2-nd Int. Workshop on Protocol Specification, Testing and Verification (IFIP WG6.1), North Holland1982Bochkw-ocr G. v. Bochmann, E. Cerny, M. Maksud and B. SarikayaTesting of Transport Protocol ImplementationsProc. CIPS Conference, Ottawa, 1983, pp.123-1291983Bochkw-ocr kw-pub G. v. Bochmann, J. Gecsei and E. LinKeyword access in Telidon: An experimentProc. Videotex 82, New York, June 19821982Bochkw-ocr G. v. Bochmann, J. M. Serre and G. GerberObtaining protocol implementations from formal specificationsProc. CIPS Congress '85, pp.187-1931985Bochkw-ocr G. v. Bochmann, L. Lecomte and P. Mondain-MonvalFormal description of network management issuesProc. Int. Symp. on Integrated Network Management (IFIP), Arlington, US, April 1991, North Holland Publ., pp. 77-941991Bochkw-pub, kw-ocr, kw-crimyes G. v. Bochmann, L. Logrippo and B. SarikayaFormal specifications for protocols - issues and experiencesin Proc. IFIP Conf. on Computer Networking COMNET '90, Budapest, L.Scaba et al. (eds.), North Holland Publ. (1990), pp. 3-21 (invited paper)1990Bochkw-pub, kw-ocr, kw-styes G. v. Bochmann, M. Deslauriers and S. BessetteApplication Layer Protocol Testing and ASN1 Support ToolsProc. IEEE GLOBECOM Conf., Houston, Dec. 1986, pp. 767-7711986Bochkw-ocr kw-pub G. v. Bochmann, M. J. Coates, T. Hall, L. Mason, R. Vickers and O. YangThe Agile All-Photonic Network: An architectural outlineProc. of 22nd Biennial Symposium on Communications, Queen's University, Kingston, Canada, May 2004, pp. 217-218.2004Bochkw-ocrIn this paper, we outline the architecture of an agile all-photonic network (AAPN), focusing primarily on topology aspects, switching mechanisms, and resource allocation. Our design assumes that optical switching technologies will mature to the point where rapidly-reconfigurable, medium/high port-count, all-optical spaceswitches are deployable in the network core. Our architectural paradigm features: (i) agility - the ability to perform time domain multiplexing to dynamically allocate bandwidth to traffic flows as the demand varies; and (ii) the concentration of control and routing functionality at the electronic edge switches that surround the photonic core. yes G. v. Bochmann, P. Desjardins, J. Gecsei, J. L. Landry and A. PerrasA Framework for Developing Distributed Computer SystemsCIPS Congress 1979, Québec, pp. 73-781979Bochkw-ocr kw-pub G. v. Bochmann, Q. Gao and C. WuOn the distributed implementation of LOTOSFORTE'89 (IFIP), Vancouver, in "Formal Descriptions Techniques II", North-Holland, S.T.Vuong editor,1989, pp.133-1461989Bochkw-ocr, kw-pubThis paper presents an approach to the distributed implementation of multiple rendezvous, including dynamic process creation, as defined by the specification language LOTOS. The approach is based on a so-called activity tree which reflects the dynamic relationships between the active processes within the system, and a virtual ring algorithm for the distributed implementation of a set of rendezvous, which was originally developed for a static set of processes. A new dynamic ring establishment algorithm is presented which serves as a bridge between the activity tree and the virtual ring algorithm. When growing the activity tree, the algorithm establishes for each LOTOS gate a virtual ring over which the virtual ring algorithm is applied. yes G. v. Bochmann, R. Dssouli and B. SarikayaMéthodes de test de protocoles: Architectures et sélection de tests(invited paper), Proc. Colloque Francophone sur l'Ingenierie des Protocoles (AFCET), Bordeaux, Sept. 1988, pp. 337-3631988Bochkw-ocr kw-RDcr kw-pub G. v. Bochmann, R. Dssouli and J. R. ZhaoAutomatic Test Result Analysis and Impact of Testing ArchitectureFirst Intern. Workshop on Protocol Test Systems, Vancouver, Oct. 1988 (invited paper)1988Bochkw-ocr kw-RDcr G. v. Bochmann, R. Dssouli, W. L. d. Souza, B. Sarikaya and H. UralUse of Prolog for Building Protocol Design ToolsProc. 5th IFIP Workshop on Protocol Specification, Verification and Testing, Toulouse, June 1985, North-Holland Publ., pp. 131-1471985Bochkw-ocr kw-RDcr kw-pub G. v. Bochmann, S. Haar, C. Jard and G. V. JourdanTesting systems specified as partial-order inputoutput automataProc. IFIP Testcom/FATES Workshop, Tokyo, June 2008, LNCS.2008Bochkw-ocrAn Input/Output Automaton is an automaton with a finite number of states where each transition is associated with a single input or output interaction. In [1], we introduced a new formalism, in which each transition is associated with a bipartite partially ordered set made of concurrent inputs followed by concurrent outputs. In this paper, we generalize this model to Partial Order Input/Output Automata (POIOA), in which each transition is associated with an almost arbitrary partially ordered set of inputs and outputs. This formalism can be seen as High-Level Messages Sequence Charts with inputs and outputs and allows for the specification of concurrency between inputs and outputs in a very general, direct and concise way. We give a formal definition of this framework, and define several conformance relations for comparing system specifications expressed in this formalism. Then we show how to derive a test suite that guarantees to detect faults defined by a POIOA-specific fault model: missing output faults, unspecified output faults, weaker precondition faults, stronger precondition faults and transfer faults. yes G. v. Bochmann, S. Poirier and P. Mondain-MonvalObject-oriented design for ODPProc. IFIP Workshop on Open Distributed Processing, Berlin, Oct. 1991 (position paper), North Holland Publ., pp. 435-4391991Bochkw-ocr, kw-ch, kw-rel-crim G. v. Bochmann, S. Poirier and P. Mondain-MonvalObject-oriented design for distributed systems and OSI standardsProc. of IFIP Int. Conf. on Upper Layer Protocols, Architectures and Applications, Vancouver, May 1992, G. Neufeld and B. Plattner (Eds.), North-Holland Pub., pp. 265-280. A shorter version is also included in the proceedings of the Int. Workshop on ODP, Berlin, Oct. 19911992Bochkw-ocr kw-rel-crim kw-ch -submitted to IFIP Workshop in Quebec City (refused) -submitted to Globecom 92 -submitted to Infocom'92 à Florence (refused) -submitted to IWODP, Berlin October 1991 (accepted, shorter version) -submitted at IFIP'92, Vancouver (shorter version) accepted G. v. BochmannAn experience with individualized instruction and learning objectivesProceedings of the Canadian Mathematical Congress Meeting on Curriculum Alternatives, Regina, June 19751975Bochkw-ocr G. v. BochmannCombining assertions and states for the validation of process commmunicationIFIP Working Conference on Constructing Quality Software, Proc. ed. by P.G. Hibbard and S.A. Shuman, North Holland, 1978. Translated into russian1978Bochkw-ocr G. v. BochmannCommunication protocols and error recovery proceduresProceedings ACM Symposium on Interprocess Communication, SIGOPS Review, 9, No.3, 45-50 (1975)1975Bochkw-ocryes G. v. BochmannComparaison des modèles d'automates à entrée-sortie et à rendez-vous pour le développement de systèmes distribuésInvited paper at the Colloque sur l'Ingénierie des Protocoles (CFIP'96), Rabat, Maroc, October 14-17, 1996, p. 185.1996Bochkw-ocr G. v. BochmannDeriving component designs from global requirements In: Baelen, S.V., Graf, S., Filali, M., Weigert, T., Gerard, S. (eds.) Proceedings of the First International Workshop on Model Based Architecting and Construction of Embedded Systems (ACES-MB 2008), Toulouse. CEUR Workshop Proceedings, vol. 503, pp. 55-69 (2008) 2008Bochkw-ocrThis paper is concerned with the early development phases of distributed applications, service compositions and workflow systems. It deals with the transformation of a global requirements model, which makes abstraction from the physical distribution of the different system functions, into a system design that identifies a certain number of distributed components. At this design level, some of the global activities may be seen as collaborations among several components. The temporal constraints of the global requirements on the execution of the different activities imply certain coordination messages between the different system components. The paper presents a transformation algorithm that derives, from a given global behavior, the local behaviors for each of the system components including the exchange of coordination messages for the global synchronization of the activities. The global behavior is defined in terms of standard sequencing operators that correspond to the concepts found in UML Activity Diagrams and similar formalisms; for sequential execution, weak and strong sequencing is distinguished. The derived component behaviors ensure that their joint execution satisfies the ordering constraints of the global requirements model, they avoid any possible race conditions, and introduce a relatively small number of coordination messages. In many cases, these messages are required anyway for carrying the dataflow which underlies the global requirements model. yes G. v. BochmannDesign of an agile all-photonic networkProc. Int. Conf. on Network Architectures, Management, and Applications (SPIE), Wuhan, Nov. 2007.2007Bochkw-ocr"Agile All-Photonic Networks" (AAPN) is the theme of a Canadian research collaboration. An AAPN is a wavelength-division-multiplexed network that consists of several overlaid stars formed by edge nodes that aggregate traffic, interconnected by bufferless optical core nodes that perform fast switching in order to provide bandwidth allocation in sub-wavelength granularity. Specific issues addressed in this context are (a) efficient bandwidth allocation, (b) routing of MPLS flows over the AAPN, (c) allocation of protection paths, and (d) development of a demonstration prototype. This paper high-light research results and design choices related to these issues. yes G. v. BochmannFinite State Description of Communication ProtocolsComputer Network Protocols Symposium (Université de Liège), Febr. 1978, pp. F3-1 to F3-111978Bochkw-ocr kw-pub G. v. BochmannFormal Description Techniques for OSI: An ExampleProc. of INFOCOM '84, San Francisco, April 1984, pp. 312-317; also publ. in Proc. Second Int. conf. on Introduction of Open Systems Interconnection Standards, DOC, Ottawa, 19841984Bochkw-ocr kw-pub G. v. BochmannFormal methods for describing distributed systems - A discussion of the experience in OSI standardizationDecentralized Systems (Proc. IFIP WG 10.3 Working Conf. , Lyon, Dec. 1989), M.Cosnard, C.Girault (eds.), North Holland Publ., 1990, pp. 29-39 (invited paper)1989Bochkw-ocr, kw-pubyes G. v. BochmannHierarchical inter-domain management for networks with condo-switchesProc. IASTED Int. Conf. on Communication Systems and Applications, Banff, Canada, July 2005, Acta Press, pp. 190-196.2005Bochkw-ocrThis paper presents a hierarchical approach to inter-domain routing and network management, especially intended for user-controlled lightpath provisioning (UCLP). The structuring of networks into subnetworks at several levels of the hierarchy provides an architecture for distributed processing of network management functions that is very scalable. Each network, as well as each subnetwork, represents an autonomous domain that communicates with its peer, child and parent networks through standard interfaces. A special feature of the architecture is the natural integration of condo-switches, that are switches with ports that belong to different networks, i.e. to different administrative domains. The paper gives the definition of the hierarchical inter-domain architecture with condo-switches and discusses procedures for routing and connection establishment within this structure. It is important to note that the internal structure of a given network (in terms of the interconnections between the internal subnetworks or the point-to-point links) remains hidden; only the list of subnetworks is normally available. yes G. v. BochmannHierarchical language definitionProc. ACM SIGPLAN-SIGOPS Interface Meeting, Savannah, SIGPLAN Notices, 8, no.9, 50-51, (1973)1973Bochkw-ocryes G. v. BochmannLogical verification and implementation of protocolsProc. 4th Data Communication Symposium (ACM-IEEE), pp. 7-15 to 7-20, Oct. 1975, reprinted in "Communication Protocol Modeling", edited by C. Sunshine, Artech House Publ., 19811975Bochkw-ocryes G. v. BochmannMethods and tools for the design and validation of protocol specifications and implementationsProc. CIPS Edmonton '87 Conference (invited paper), pp. 185-199 (1987) (translated into chinese by Yi Lee, Research Institute of Data Comm. Beijing, China)1987Bochkw-ocr G. v. BochmannObject-oriented modelling and development for distributed systems(invited paper), Proc. Third Maghrebian Conf. on Software Eng. and Art. Intelligence, Rabat, April 1994, pp. 11-24; also presented at ACFAS workshop on "Object Orientation in Databases and Software Engineering", Montreal, May 1994, pp. 139-155. Reprinted in book "Object-Oriented Technology for Database and Software Systems", editors V.S. Alagar and R. Missaoui, World Scientific Publishing Co., 1995, pp. 90-1131994Bochkw-ocr kw-crim kw-obyes G. v. BochmannRecent Developments in Protocol Specification, Validation and TestingProc. Computer Communications Conf., Recife, Brazil, 1986, pp. 354-3681986Bochkw-ocr kw-pub G. v. BochmannSome considerations on interfaces for users and system componentsin New Trends in Software Methodologies, Tools and Techniques (Proc. of 2nd Intern. Conf. on Lyee Methodology), IOS Press, 2003, pp. 167-179.2003Bochkw-ocr G. v. BochmannSpecification languages for communication protocolsProc. of CHDL-93 (Computer Hardware Description Languages and Their Applications, eds. D. Agnew et al.), invited paper, Ottawa, April 1993, North Holland Publ., IFIP Transactions A-32, 1993, pp. 379-3961993Bochkw-ch kw-ocr kw-pubyes G. v. BochmannStorage allocation for parallel processes in minicomputers1976Bochkw-ocr G. v. BochmannSubmodule construction and supervisory control - a generalizationin Proc. of Int. Conf. on Implementation and Applications of Automata, Aug. 2001 (invited paper), Springer LNCS 2494, pp. 27-39.2001Bochkw-ocrWe consider the following problem: For a system consisting of two submodules, the behavior of one submodule is known as well as the desired behavior S of the global system. What should be the behavior of the second submodule such that the behavior of the composition of the two submodules conforms to S ? - This problem has also been called "equation solving", and in the context of supervisory control, it is the problem of designing a suitable controller (second submodule) which controls a given system to be controlled (first submodule). Solutions to this problem have been described by different authors for various assumptions about the underlying communication mechanisms and conformance relations. We present a generalization of this problem and its solution using concepts from relational database theory. We also show that several of the existing solutions are special cases of our general formulation. yes G. v. BochmannSubmodule construction for specifications with input assumptions and output guaranteesin Proc. FORTE'02 (22st IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems), Chapman and Hall, 2002, pp.2002Bochkw-ocryes G. v. BochmannSynchronization in Distributed System Modules3rd Berkeley Workshop (LBL and DOE of U.S.), Aug. 1978, Proc. pp. 332-3391978Bochkw-ocr kw-pub G. v. BochmannThe use of formal description techniques for OSI protocolsProc. National Telecom. Conf., New Orleans, (1981), pp. F8.6.1 to F8.6.61981Bochkw-ocr G. v. BochmannUsage of protocol development tools: the results of a survey(invited paper), Protocol Specification, Testing and Verification VII, H. Rudin and C. West (eds.), North Holland Publ. (1987), pp.139-1611987Bochkw-ocr G. v. BochmannUsing first-order logic to reason about submodule constructionProc. IFIP Intern. Conf. on Formal Techniques for Distributed Systems, Lisbon, Portugal, June 2009, Springer Verlag, LNCS 5522.2009Bochkw-ocrWe consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the behavior of the second component such that the behavior of the composition of the two conforms to the desired behavior ? - This problem has been called "submodule construction" or "equation solving". Solutions to this problem have been described in the context of various specification formalisms and various conformance relations. This paper presents a new formulation of this problem and its solution in first-order logic. It is also shown how the solutions for submodule construction in various specification formalisms can be derived from the solution in logic. The simple proof of correctness for the logic solution is then used to justify the particular forms of solutions in the different specification formalisms, such as (a) synchronous rendezvous at several interfaces, and (b) interleaved rendezvous (labeled transition systems). yes H. Li, M. Benyoucef and G. v. BochmannTowards a global online reputationProc. ACM Conf. on Management of Emergent Digital EcoSystems (MEDES'09), Lyon (France), Oct. 2009.2009Likw-ocrToday's online reputation systems lack one important feature: globality. Users build a reputation within one community, and sometimes several reputations within several communities, but each reputation is only valid within the corresponding community. Moreover, such reputation is usually aggregated by the online platform's provider, giving the inquiring agent no say in the process. This paper proposes one way of dealing with this problem. We introduce an online reputation centralizer that collects raw reputation data about users from several online communities and allows for it to be aggregated according to the inquiring agent's requirements, using a stochastic trust model, and taking into account factors that qualify a user's reputation. yes H. N. Castejon, G. v. Bochmann and R. BraekRealizability of Collaboration-based Service SpecificationsProc. Asia-Pacific Software Engineering Conference (APSEC), Nagoya, Japan, Nov. 2007.2007Castkw-ocrThis paper is concerned with compositional specification of services using UML 2 collaborations, activity and interaction diagrams. It addresses the problem of realizability: given a global specification, can we construct a set of communicating state machines whose joint behavior is precisely the specified one? We approach the problem by looking at how collaboration behaviors may be composed using UML activity diagrams. We classify realizability problems from the point of view of each composition operator, and discuss their nature and possible solutions. This brings a new look at already known problems: we show that given some conditions, some problems can already be detected at an abstract collaboration level, without needing to look into detailed interactions. yes H. Yamaguchi, G. v. Bochmann and T. HigashinoDecomposing service definitions in predicate-transition nets for designing distributed systemsProc. of FORTE intern. conference (IFIP), Berlin, Oct. 2003, LNCS 2767, Springer Verlag, pp. 399-414.2003Yamakw-ocrIn this paper, we propose a new algorithm for the derivation of a protocol speci.cation in Pr/T-nets, which is the speci.cation of communicating N entities (N can be given), from a given service speci.cation in Pr/T-nets and an allocation of the places of the service speci.cation to the N entities. Our algorithm decomposes each transition of the service speci.cation into a set of communicating Pr/T-subnets running on the N entities, preserving the properties of Pr/T-nets of the service speci.cation such as liveness and boundedness. Moreover, for the e.cient control of con.ict of shared resources, we present a mutual exclusion algorithm based on timestamp and incorporate it into the derivation algorithm. The method is applied to an example speci.cation of a distributed database management system to show the applicability of our algorithm to practical applications. yes H. Yamaguchi, K. El-Fakih, G. v. Bochmann and T. HigashinoA Petri net based method for deriving distributed specifications with optimal allocation of resourcesProc. of Int. Conf. on Software Eng. Applied to Networking and Parallel/Distr. Computing (SNPD'00), May 2000, Reims, France, pp.19-26.2000Yamakw-ocrIn this paper, we present a method for the synthesis of ex-tended Petri net based distributed specification. Although a lot of synthesis methods have been proposed, only a few syn-thesis methods have treated resources (computational data) such as databases and files. In contrast to previous meth-ods that assume some fixed resource allocation, our method finds an optimal resource allocation that optimizes the de-rived distributed specification, based on some reasonable communication cost criteria. The method starts by identi-fying the set of rules for deriving a protocol specification from a given service specification. Based on these rules, an optimal resource allocation problem is formulated using an integer linear programming model. An example application is discussed. yes H. Ye, B. Kerhervé and G. v. BochmannQuality of service aware distributed query processingDEXA Workshop on Query Processing in Multimedia Information Systems (QPMIDS), 10th Intern. Workshop on Database and Expert Systems Applications, Florence, Italy, 1-3 Sept. 1999, Proc. published by IEEE Computer Society, 19991999Yekw-ocrIn the environment of wide-area networks such as the Internet, distributed query processing becomes problematic due to the changing coming from both underlying networks and user's requirements. In this new context, conventional query processing strategies with the homogeneous assumption will not work well, because they are unable to adapt to unexpected changes in the performance of the communication networks. In this paper, we address the issue of how to make distributed query processing be aware of these changes. We introduce the idea of integration distributed query processing with Quality of Service (QoS) management and accordingly illustrate our view of QoS-aware distributed query processing. yes H. Ye, B. Kerhervé and G. v. BochmannIntegrating Quality of Service into Database SystemsProc. to the 14th International Conference on Database and Expert Systems Applications (DEXA2003), Prague, Czech Republic, 1-5 September 2003.2003Yekw-ocryes H. Ye, B. Kerhervé and G. v. BochmannRevisiting Join Site Selection in Distributed Database SystemsProc. the International Conference on Parallel and Distributed Computing, 26th - 29th August 2003 in Klagenfurt, Austria2003Yekw-ocryes H. Ye, B. Kerhervé, G. v. Bochmann and D. BourneData distribution strategies for providing database scalability in e-commerce applicationsin Proc. of the 3rd In. Workshop on Advanced Issues of E-Commerce and Web-based Information Systems, San Jose, USA, 21-22 June, 2001, IEEE Computer Society Press.2001Yekw-ocrThe number of users of e-commerce applications is increasing, and users are becoming more and more sensitive to the quality of the offered services. This paper discusses performance and scalability issues for back-end parallel or distributed database servers used in e-commerce applications. We argue that database scalability cannot be achieved without considering efficient data placement. In particular data distribution strategies should consider the specifics of e-commerce applications and user expectations in terms of quality of service. We propose a generic data distribution strategy integrating user class information. yes H. Ye, B. Kerhervé, G. v. Bochmann and D. BourneTowards Database Scalability through Efficient Data Distribution in E-commerce Environmentsin Proc. Third International Symposium on Electronic Commerce, Research Triangle Park, USA, October 18-19, 2002.2002Yekw-ocryes H. Ye, B. Kerhervé, G. v. Bochmann and V. OriaPushing Quality of Service Information and Requirements into Global Query OptimizationProc. Intern. Database Engineering and Applications Symposium (IDEAS), Honk Kong, July 2003. Published by IEEE2003Yekw-ocryes H. Zeineddine and G. v. BochmannLeast constrained slot allocation in optical TDM networksProc. Wireless and Optical Communications Networks (IFIP), WOCN '07, Sinagpore, July 2007, pp. 1-5.2007Zeinkw-ocrIn this paper, we propose a timeslot allocation scheme in all-optical TDM networks with no traffic buffering. The purpose of the new scheme is to take the blocking rate to an optimal level close to what have been achieved with the use of buffers. Previous works considered the first fit and least loaded approaches to reserve timeslots in networks that include buffers and multi-fibers. Our proposed scheme applies to more basic networks having single unidirectional fibers and no buffers. yes H. Zeineddine and G. v. BochmannA distributed algorithm for least constraining slot allocation in MPLS optical TDM networksto be presented at IEEE ICC, Dresden, Germany, 20092009Zeinkw-ocrIn this paper, we propose a distributed approach for the least constrained slot allocation scheme in all-optical TDM networks (LC) that was introduced in a previous work. The driving force behind our proposal is the employment of the LC scheme in a GMPLS context. After describing the basic data model and messaging parameters, we focus on defining an efficient LC resource state update scheme, which is essential to achieve compatibility with GMPLS' periodic link state update standards. Basically, we reduce the rate of link state notifications from once per call to once per few calls. We rely on the blocking probability as a metric to measure the effect of rate reduction on the network performance. yes H. Zeineddine, P. He and G. v. BochmannOptimization analysis of optical time slot interchangers in all-optical networksProc. Intern. Conf. on Optical Communication Systems and Networks (IASTED ), Banff, Canada, 2006.2006Zeinkw-ocryes H. Zhang, M. Savoie, J. Wu, S. Campbell, G. v. Bochmann and W. St.ArnaudService-oriented Layer 1 virtual private networks for Grid applicationsProc. Intern. Conf. on Grid Computing and Applications (GCA), June 20-23, 2005, Las Vegas, USA2005Zhankw-ocryes H. Zhang, M. Savoie, S. Campbell, S. Figuerola, G. v. Bochmann and B. St.ArnaudService-oriented virtual private networks for Grid applicationsProc. (IEEE) Intern. Conf. on Web Services (ICWS'07), Salt Lake City, July 2007.2007Zhankw-ocrEmerging Grid applications desire not only high bandwidth but also the ability to control the topology and traffic engineering of the underlying networks, through web service interfaces. To achieve that goal, we present an advanced User Controlled Lightpath Provisioning (UCLP) system, where network resources and Grid resources are both modeled as web services and are seamlessly integrated into workflows. yes I. Dupré-la-Tour, G. v. Bochmann and J. Y. ChouinardA secure authentication infrastructure for mobile communication services over the Internetin Communications and Multimedia Security Issues of the New Century (Proc. IFIP Working Conf. CMS'01, Darmstadt), R. Steinmetz et al. (Eds.), Kluwer Academic Publ. 2001, pp. 405 - 416.2001Duprkw-ocrMobile communication on the Internet sets more security concerns than traditional mobile networks such as GSM.The network infrastructure registration process should give credentials to the user to let him or her being identi .ed by any service provider in order to preven fraudulen use.In addition,a user should be able to communicate with privacy and to sign a message (e.g.a paymen order)so that billing is possible. Users should be able to connect from everywhere,with various ypes of terminals,possibly mobile.In this paper,we propose to secure an infrastructure providing telecommunication services on the Internet for a mobile user.We establish a trust relationship be ween any pair of the parties with a password-based user access.As for user-to-user communication,both signaling and media data can be secured.We illustrate the use of this infrastructure to provide secure IP-Telephony. yes J. Barchanski, G. v. Bochmann, J. Gecsei and P. DesjardinsAccessing videotex through the ISO File Access protocolProc. IFIP Conference COMNET'85, Budapest, Oct. 19851985Barckw-ocr J. Drissi and G. v. BochmannSubmodule construction toolin Proc. Int. Conf. on Computational Intelligence for Modelling, Control and Automation, Vienne, Febr. 1999, (M. Mohammadian, Ed.), IOS Press, pp. 319-324.1999Driskw-ocrUsing the programming language Java, we developed the Submodule Construction Tool, which implements algorithms for the submodule construction problem. The submodule construction problem (SCP) is to construct the specification of a submodule X when the specification of the system and all submodules but X are given. This problem is encountered in the hierarchical design of complex systems, in the synthesis of controllers and in the reuse of components. The tool requires a number of files as input and produces a file containing the result. For the input/output Finite State Machine model, we can obtain the generic solution, the minimal solution with respect to the number of states, we can check if a given FSM is a solution and we can find the minimal reduction of a given observable nondeterministic FSM. For the I/O automata model, we can find the generic solution for the safe realization relation and the subtype relation, we can check if a given I/O automaton is a safe realization or a subtype of another I/O automaton, we can compose I/O automata, we can find the resulting I/O automaton after hiding a subset of the alphabet and finally we can obtain the minimal trace equivalent I/O automaton. yes J. M. Serre, E. Cerny and G. v. BochmannA Methodology for Implementing High-Level Communication ProtocolsProc. 19-th Hawaii Int. Conf. on Systems Sciences, Jan. 1986, pp. 710-7211986Serrkw-ocr kw-pub J. P. Favreau, G. v. Bochmann and P. Mondain-MonvalOpen issues in OSI protocol development and conformance testingProc. COMPUTER NETWORKS '91, Wroclow, Poland (June 1991), (invited paper)1991Favrkw-ocr, kw-ch J. R. Zhao and G. v. BochmannReduced reachability analysis of communication protocols: A new approachProc. IFIP Workshop on Protocol Specification, Testing and Verification, North-Holland Publ., 1986, pp. 234-2541986Zhaokw-ocr kw-pub J. Shi, G. v. Bochmann and C. AdamsA trust model with statistic foundationProc. IFIP Workshop on Formal Aspects in Security and Trust, Toulouse (Aug. 2004), Edited by T. Dimitrakos and F. Martinelli, Springer, 2005, pp. 145-158.2004Shikw-ocrThe widespread use of the Internet signals the need for a better understanding of trust as a basis for secure on-line interaction. In the face of increasing uncertainty and risk, users and machines must be allowed to reason effectively about the trustworthiness of other entities. In this paper, we propose a trust model that assists users and machines with decision-making in online interactions by using past behavior as a predictor of likely future behavior. We develop a general method to automatically compute trust based on self-experience and the recommendations of others. Furthermore, we apply our trust model to several utility models to increase the accuracy of decision-making in different contexts of Web Services. yes J. Shi, G. v. Bochmann and C. AdamsDealing with recommendations in a statistical trust modelProc. of AAMAS Workshop on Trust in Agent Societies, July 2005, Utrecht, Netherlands, pp. 144-155.2005Shikw-ocrWe previously developed a trust model in which an entity makes decisions in online interactions by using past behavior as a predictor of likely future behavior. However, that approach does not combine recommendations from different entities. This paper focuses on the problem of recommendation combination and detection of unfair recommendations. Our approach involves data analysis methods (Bayesian estimation, Dirichlet distribution), and machine learning methods (Weighted Majority Algorithm). We describe simulation experiments to illustrate the effectiveness and robustness of the methods and the resulting evolution of trust. yes J. V. Jourdan and G. v. BochmannOn testing 1-safe Petri netsProc. 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, Tianin, China, 20092009Jourkw-ocrFormal models are often considered for software systems specification, and are helpful for verifying that certain properties are respected, or for automatically generating the implementation code corresponding to the model, or again for conformance testing, for the automatic generation of test cases to check an implementation against the formal specification. Variations of Finite State Machine (FSM) models have been mostly used for conformance testing, while the otherwise very popular formal model of Petri Nets is seldom mentioned in this context. In this paper, we look at the question of conformance testing when the model is provided in the form of a 1-safe Petri Net. We provide a general framework for conformance testing, and give algorithms for deriving test cases under different assumptions: Besides the adaptation of methods originally developed for FSMs which lead to exponentially long test sequences, we have identified cases for which polynomial testing algorithms for free-choice Petri nets can be provided. These results are significant when modeling concurrent systems, as exemplified by workflow modeling. yes J. Vaucher, G. Bochmann, B. Lefebvre, S. Vella, M. Wu and K. LeeProlog for industrial software developmentProc. of The Practical Application of Prolog, Volume one, London, April 19921992Vauckw-crim, kw-ocr J. Wu, H. Zhang, S. Campbell, M. Savoie, G. v. Bochmann and B. St.ArnaudA Grid oriented lightpath provisioning systemProc. Globecom Workshop on "High Performance Global Grid Networks", 2004.2004Wukw-ocrMulti-domain resource sharing is the fundamental feature of computing and data Grid applications. In this paper, we will address the issue of multi-domain optical network resource sharing and present a network management system designed for end-to-end lightpath provisioning across multiple independently managed domains. Our network management system, called user-controlled lightpath provisioning (UCLP) system, is based on the Grid services concept and built on the Jini and JavaSpaces technologies. The UCLP system provides a traffic engineering approach to control network infrastructure for computing and data Grid applications. yes J. Wu, S. Campbell, J. M. Savoie, H. Zhang, G. v. Bochmann and B. St.ArnaudUser-managed end-to-end lightpath provisioning over CA*net 4Proc. National Fiber Optic Engineers Conference (NFOEC), Orlando, FL, USA, Sept 7-11, 2003, pp. 275-282.2003Wukw-ocryes J. Y. Zhang, J. Wu, G. v. Bochmann and M. SavoieDifferentiated static resource allocation in WDM networksproc. of IEEE International Conference on Communications (ICC), Dresden, Germany, June 14-18, 20092009Zhankw-ocryes J. Y. Zhang, J. Wu, G. v. Bochmann and M. SavoieResource criticality analysis of static resource allocations in WDM networksproc. of IEEE International Conference on Communications (ICC), Dresden, Germany, June 14-18, 20092009Zhankw-ocryes J. Zheng, C. Peng and G. v. BochmannFault detection and localization scheme in all-optical overlaid-star TDM networksProc. of 2006 Intern. Conf. on Communications and Networking in China (CHINACOM’06), Beijing, China, Oct. 25-27, 2006. (invited)2006Zhengkw-ocrFault detection and localization is a crucial issue in all-optical networks. Since most commercially-available alloptical space switches are incapable of detecting the loss of optical signals along the data paths between its input ports and output ports, fault localization becomes a challenge for providing service survivability in such networks. This paper proposes a fault detection and localization scheme for an all-optical overlaid-star TDM network. The proposed scheme employs a fault localization technique that identifies the location of a failure by detecting the power loss of optical signals in data and control channels. Two alternatives are proposed. One requires a control channel on each wavelength of a fiber link while the other requires a small data block to be transmitted in each nonallocated data channel. Based on the proposed fault localization technique, a fault advertisement protocol is further presented, which can be incorporated into the signaling protocol used in the network to facilitate the provisioning of static protection or dynamic restoration. The data loss, fault detection time, and connection recovery time are analyzed for the different failure scenarios. yes J. Zheng, C. Peng and G. v. BochmannBlocking model for all-optical overlaid-star TDM networksProc. IEEE Globecom’06, San Francisco, USA, Nov. 27-Dec. 1, 2006.2006Zhengkw-ocrThis paper studies the blocking performance of a class of all-optical overlaid-star TDM networks using a leastcongested-path routing strategy for path selection. An analytical model is proposed to estimate the call blocking probability in such networks. This model takes link-load correlation into account and thus can provide accurate estimation of the blocking probability. The accuracy of the model is verified by comparing analytical results with simulation results. yes J. Zheng, C. Peng, G. v. Bochmann and T. J. HallLoad balancing in all-optical overlaid-star TDM networksProc. of IEEE SARNOFF’06 conference, Princeton, NJ, Mar. 27-28, 2006. (Page numbers unavailable)2006Zhengkw-ocrLoad balancing is an effective solution to relieving network congestion and achieving good network performance. This paper investigates routing strategies for load balancing in all-optical overlaid-star TDM networks. A random routing strategy and a least-congested-path routing strategy are first presented, based on which a weighted-least-congested-path routing strategy is then proposed. The proposed strategy takes into account both load balancing and end-to-end delay in path selection, and thus can achieve better delay performance while maintaining the same blocking performance under low traffic load as compared with the other strategies. The performance of the routing strategies is evaluated through simulation results. yes K. Benjamin, G. v. Bochmann, G.-V. Jourdan and V. OnutSome modeling challenges when testing Rich Internet Applications for securityFirst Intern. Workshop on Modeling and Detection of Vulnerabilities (MDV 2010), Workshop at Third Intern. Conf. on Software Testing, Verification, and Validation, Paris, France, April 2010. Proc. pp. 403­409 (IEEE Computer Society), http://dx.doi.org/10.1109/ICSTW.2010.462010Benjkw-ocryes K. Benjamin, G. v. Bochmann, M. E. Dincturk, G. V. Jourdan and I. V. OnutA strategy for efficient crawling of rich internet applicationsProc. 11th Intern. Conf. on Web Engineering (ICWE 2011), Paphos, Cyprus, June 2011. Springer LNCS, Vol. 6757, pp. 74­89. http://dx.doi.org/10.1007/978-3-642-22233-7_62011Benjkw-ocryes K. El-Fakih and G. v. BochmannLocating a faulty machine in a system of communicating finite state machinesProc. of EEEL Workshop on Software for Embbed Systems and Testing (WSEST'99), Nov. 1999, Maryland.1999ElFakw-ocryes K. El-Fakih, H. Yamaguchi and G. v. BochmannA method and a genetic algorithm for deriving protocols for distributed applications with minimum communications costProc. Int. Conf. on Parallel and Distr. Computing and Systems, Nov. 1999, Boston, USA .1999Elfakw-ocrWe consider a set of rules for deriving the specification of the protocol of a distributed system from a given specification of services, and define and formulate the message exchange optimization problem using a 0-1 integer programming model. This problem is about determining the minimum number of messages to be exchanged between the physical locations of the distributed system, in order to reduce the communication cost. We then present a genetic algorithm for solving this problem. The main advantage of this algorithm, in comparison with exact algorithms, is that its complexity remains manageable for realistic large specifications. The experimental results show that the minimum number of messages to be exchanged is found in a very reasonable time. yes K. El-Fakih, H. Yamaguchi, G. v. Bochmann and T. HigashinoProtocol re-synthesis based on extended Petri netsProc. of Workshop on Software Engineering and Petri Nets (SEPN-2000), June 2000, Aarhus, Denmark.2000ElFakw-ocrProtocol synthesis is used to derive a specication of a distributed system from the specification of the services to be provided by the system to its users. Maintaining such a system involves applying frequent minor modifications to the service specifcation due to changes in the user requirements. In order to reduce the maintenance costs of such a system, we present an original method that consists of a set of rules that avoid complete protocol synthesis after these modications. These rules are given for a system modeled as an extended Petri net. An application example is given along with some experimental results. yes K. El-Fakih, H. Yamaguchi, G. v. Bochmann and T. HigashinoAutomatic derivation of Petri-net based distributed specification with optimal allocation of resourcesProc. of IEEE Int. Conf. on 15th IEEE Int. Conf. on Automated Software Engineering (ASE'2000), Grenoble, France, Sept. 2000, pp.2000ElFakw-ocryes K. El-Fakih, K. Saleh and G. v. BochmannOn the fly re-synthesis of communications protocolsIn Proc. of the 12th Int. Conf. On Parallel and Distributed Computing and Systems (PDCS’00), Nov. 2000 (Las Vegas, USA).2000ElFakw-ocryes K. El-Fakih, N. Yevtushenko and G. v. BochmannDiagnosing multiple faults in communicating finite state machinesin Proc. FORTE'01 (21st IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems), Chapman and Hall, 2001, pp. 85-100.2001ElFakw-ocrIn this paper, we propose a method for diagnostic test derivation when the system specification and implementation are given in the form of two communicating finite state machines and at most a single component machine can be faulty. The method enables to decide if it is possible to identify the faulty machine in the system, once faults have been detected in a system implementation. If this is possible, it also provides tests for locating the faulty component machine. Two examples are used to demonstrate the different steps of the method. The method can also be used for locating faults within a machine when the system specification and implementation are given in the form of a single FSM. yes K. El-Fakih, N. Yevtushenko and G. v. BochmannFSM-based re-testing methodsProc. Int. Conf. on Testing of Communicating Systems (TESTCOM) 2002, pp.2002ElFakw-ocrThe selection of appropriate test cases is an important issue in software engineering. A number of methods are known for the selection of a test suite based on the specification and an implementation under test given in the form of a finite state machine (FSM). In realistic applications, this specification evolves incrementally throughout incorporating frequent modifications. In this paper, we adapt three well-known test derivation methods, namely the W, Wp, and HIS methods, for generating tests that would test the modified parts of the evolving specification. Application examples are provided. yes K. El-Fakih, S. Prokopenko, N. Yevtushenko and G. v. BochmannFault diagnosis in extended finite state machinesProc. TestCom 2003 - the IFIP 15th International Conference on Testing of Communicating Systems, May 2003 in Sophia Antipolis, France, LNCS 2644, Springer Verlag, pp. 197-210.2003El-Fakw-ocryes K. El-Khatib and G. v. BochmannAgent support for context-aware services and personal mobilityProc. Int. Workshop on Mobile Agents for Telecommunication Applications (MATA), Oct. 2003, LNCS 2881, Springer Verlag, 2003, pp. 89-98.2003ElKhkw-ocryes K. El-Khatib, G. v. Bochmann and A. El-SaddikA QoS-based framework for distributed content adaptationProc. of First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, 20042004ElKhkw-ocrThe tremendous growth of the Internet has introduced a number of interoperability problems for distributed multimedia applications. These problems are related to the heterogeneity of client devices, network connectivity, content formats, and user's preferences. The purpose of this paper is to present a framework for trans-coding multimedia streams. The proposed infrastructure takes into consideration the profile of communicating devices, network connectivity, exchanged content format, context description, and available customization services to find a chain of services that could be applied to adapt the content to the required needed format. Part of the framework is a QoS-based selection algorithm that finds the best sequence of adaptation services which can maximize users' satisfaction with the delivered content. yes K. El-Khatib, G. v. Bochmann and A. ElSaddikA QoS-based service composition for content adaptationProc. 2nd Int. Workshop on Service Engineering (SEIW 2007), Istanbul, Turkey, April 2007.2007ElKhkw-ocryes K. El-Khatib, G. v. Bochmann and Y. ZhongSelecting the QoS parameters for multicast applications based on user profile and device capabilityProc. Int. Conf. on Interactive Distributed Multimedia Systems (IDMS), Sept. 2001, Springer Verlag, pp. 221-232.2001ElKhkw-ocrMost adaptive multimedia multicast applications require the source to select the number of streams to transmit as well as the QoS parameters for each stream. If the receivers have different bandwidth limits for their devices and have various preferences for the quality of the data, selecting the QoS parameters that generate the best average satisfaction for all receivers is a challenging problem. In this paper, we developed a selection algorithm that is based on the user profiles and the device capabilities. Receivers are required to send their profiles and the bandwidth limitation on their devices to the source once before the session starts. To avoid the implosion problem and have a constant running time for the selection algorithm, we partition the receivers according to the bandwidth limit of their devices into classes and use a virtual representative for each class of receivers. yes K. El-Khatib, N. Hadibi and G. v. BochmannSupport for personal and service mobility in ubiquitous computing environmentsProc. of International Conference on Parallel and Distributed Computing, Euro-Par, August 2003, Klagenfurt, Austria, pp. 1046-1055.2003ElKhkw-ocryes K. Hamard, J.-Y. Nie, G. v. Bochmann, R. Godin, B. Kerherve, T. Radhakrishnan, R. Shinghal, J. Turner, F. Berouti and F. P. FerrieA digital libraries system based on multi-level agentsin Proc. of Int. Workshop on Agent-Oriented Information Systems, 1999 (accepted)1999Hamakw-ocrIn this paper, we describe an agent-based architecture for digital library (DL) systems and its implementation. This architecture is inspired from Harvest and UMDL, but several extensions have been made. The most important extension concerns the building of multi-level indexing and cataloguing. Search agents are either local or global. A global search agent interacts with other agents of the system, and manages a set of local search agents. We extended the Z39.50 standard in order to support the visual characteristics of images and we also integrated agents for multilingual retrieval. This work shows that the agent-based architecture is flexible enough to integrate various kinds of agents and services in a single system. yes K. S. Raghunathan, J. A. Barchanski and G. v. BochmannRelationship between performance parameters for Transport and Netwook servicesProc. ACM SIGCOMM Symposium, Austin, 1983, pp.129-1351983Raghkw-ocr kw-pubyes K. Y. Chan and G. v. BochmannMethods for designing SIP services in SDL with fewer feature InteractionsProc. 7th Intern. Workshop on Feature Interactions in Telecommunications and Software Systems, Ottawa, Canada, June, 2003.2003Chankw-ocrThis paper describes methods for implementing telephony services in SIP with fewer traditional feature interactions. A formal SDL model of SIP and its services has been derived from published SIP specifications for verification and validation. It is known that the SIP RFC describes only the protocol specification. The specifications of SIP services and additional service features are informal and can only be found in various IETF drafts. Nevertheless, the service designers are still faced with new feature interaction problems. These new feature interactions are unique to SIP because SIP has flexible signaling features, such as request forking and dynamic assignment of contact addresses, which have both cooperative and adversarial side effects on each other. This paper also describes an extension to the classical feature interaction taxonomy, which is used to associate the causes, effects/symptoms with the preventive measures of the new and traditional feature interactions. Finally, SIP services can be designed and implemented without certain feature interactions by following certain design rules which are based on the knowledge deduced from the verification. yes K. Y. Chan and G. v. BochmannModeling the IETF Session Initiation Protocol and its services in SDLProc. of SDL Forum 2003, Springer Verlag (LNCS)2003Chankw-ocrThis paper describes the formal approach to modeling IETF Session Initiation Protocol (SIP) and its services in SDL. The main objective is to discover the advantages and shortcomings of using a formal language such as SDL to model an IETF application signaling protocol like SIP. Evaluating the feasibility of using CASE tools such as Telelogic TAU SDL and TTCN Suite in modeling a complex protocol like SIP is also the interest of this study. By creating an "Abstract User" interface, we discover the importance of use case analysis in specifying SIP services more precisely. In addition, the object-oriented extension in SDL-96 has been applied to some extent in the modeling process; we create an SDL framework that allow us to reuse and to add SIP services to the core protocol more easily by applying SDL type inheritance in our model. Furthermore, we discuss enhancements that may be made to the SDL language and Tau tools to improve the modeling experience of IETF protocols. yes M. Barbeau and G. v. BochmannA subset of Lotos with the computational power of place-transition nets14th Int. Conference on Applications and Theory of Petri Nets, Chicago, June 19931993Barbkw-crim kw-ocr (is related to [Barb 90] P#707) submitted to Formal Aspects of Computing and 14th. Intern. Conf. on Aplications and Theory of Petri Nets, [Nov. 1992] acceptedyes M. Barbeau and G. v. BochmannExperience with automated verification tools: Application to discrete event systemsPrel. Proc. of Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, June 1989 (due to an error, the paper is not included in the final proceedings published in Springer LNCS)1989Barbkw-ocr M. Barbeau and G. v. BochmannThe Lotos model of a fault protected system and its verification using a Petri Net based approachProc. Workshop on Computer Aided Verification, Aalborg, Danemark, July 19911991Barbkw-ocr, kw-crimyes M. Barbeau and G. v. BochmannVerification of LOTOS specifications - a Petri net based approachProc. of Canadian Conference on Electrical and Computer Engineering, Ottawa, Sept. 1990, pp. 43.1.1 - 43.1.41990Barbkw-ocr, kw-crim M. Barbeau, P. d. Saqui-Sannes and G. v. BochmannDesign, formal specification and validation of centralized and distributed control in a transmission systemProc. Workshop on Software Quality Engineering '91, Bell Canada, Oct. 911991Barbkw-ocr kw-crim kw-citr M. Dubuc, G. v. Bochmann, O. B. Bellal and F. SabaTranslation from TTCN to LOTOS and the validation of test casesProc. of the Third International Conference on Formal Description Techniques (FORTE'90), Madrid, Nov. 1990, pp.139-1521990Dubukw-ocr, kw-pub, kw-chaoyes M. Dubuc, R. Dssouli and G. v. BochmannTESTL: A tool for the analysis of test sequences based on finite-state modelIWPTS'92, IFIP Transactions, Protocol Test Systems IV, North Holland Publ., pp.195-2061992Dubukw-chao kw-ocr kw-RDcr M. E. Dincturk, S. Choudhary, G. v. Bochmann, G. V. Jourdan and I. V. OnutA statistical approach for efficient crawling of Rich Internet Applicationsin Proc.s of the 12th Intern. Conf. on Web Engineering (ICWE 2012), Berlin, Germany, July 2012. Springer LCS 7387, pp. 362-369. A longer version of the paper is also available (15 pages)2012Dinckw-ocryes M. Erradi and G. v. BochmannRMondel - A Reflective Object-Oriented Specification LanguageProceeding of the ECOOP/OOPSLA'90 First Workshop on: Reflection and Metalevel Architectures in Object-Oriented Programming, Ottawa 19901990Errakw-citr kw-ocnryes M. Erradi, F. Khendek, R. Dssouli and G. v. BochmannDynamic extension of object-oriented distributed system specificationsInternational Workshop on Feature Interactions in Telecommunications Software Systems, St. Petersburg, Florida, Dec. 3-4, 1992, pp 116-1321992Errakw-citr kw-ocr kw-RDcr -submitted to International Workshop on Feature Interactions in Telecommunications Software Systems, St. Petersburg, Florida, Dec. 3-4, 1992. (accepted)yes M. Erradi, G. v. Bochmann and I. HamidDynamic modifications of object-oriented specificationsProc. CompEuro'92 (IEEE), May 4-8, Netherlands, pp.654-6591992Errakw-citr A-3.3 kw-ocr -submitted to Tools Europe, Tech. of Object-Oriented Languages and Systems Int. Conf.'92, refused -submitted to CompEuro'92 IEEE May 4-8, Netherlands, acceptedyes M. Erradi, G. v. Bochmann and R. DssouliA framework for dynamic evolution of object-oriented specificationsIEEE Int. Conf. on Software Maintenance, Orlando, Nov.19921992Errakw-ocr kw-RDcr kw-citr -submitted to Conf. on Software Maintenance, Orlando 1992 (accepted)yes M. Guiagoussou, A. Das and G. v. BochmannAn Overview of Fault Management in Telecommunication NetworksAdvanced Information Processing Techniques for LAN and MAN Management (C-17) page 59-85, April 19931993Guiakw-ADjr kw-oj?r - no this is OCR -- kw-crim M. N. M. Faleh and G. v. BochmannTransforming dynamic behavior specifications from Activity Diagrams to BPELProc. IEEE 6th Intern. Symp. on Service-Oriented System Engineering, Irvine, Calif., Dec. 2011, pp. 305-311.2011Nasskw-ocrThe Service-Oriented Architecture (SOA) provided by the Web Services standards supports Model-Driven Development, it allows global business process models described in the Business Process Modeling Notation (BPMN) or as UML Activity Diagrams to be transformed into Web Services components specified by WSDL and/or BPEL. We have experimented the transformation of UML Activity Diagrams to several BPEL processes using the IBM Rational Software Architect (RSA) tool. These diagrams were derived from the specification of global system behavior where each activity may represent some collaboration between several system components in distributed systems. The derived component behaviors assure that the global behavior will be realized by coordinating the actions of the components through the exchange of asynchronous messages. In this paper, we describe how this method can be adapted to the context where the system components will be implemented as BPEL processes. We found out that the IBM Rational tool does not support some important asynchronous message exchange scenarios, and we describe here how the generated BPEL processes can be manually adapted. We also discuss some difficulties that arise in relation with input message buffering since we assume that the received messages remain in a buffer pool until they are required by the destination process. This message buffering is largely provided by the BPEL execution environment. We explain in this paper how all these problems can be resolved by simple modifications of the automatically generated component behaviors in BPEL. yes M. V. O. Mohamed-Salem, J. Chen, G. v. Bochmann and J. W. WongAn experimental prototype for scalable server selectionProc. EESD 2003, accepted for publication2003Salekw-ocrAn experimental prototype for server selection using an independent brokerage service is described. This prototype is composed of four main components: instrumented Apache Web servers, monitoring agents, a QoS broker, and client emulator. The role of the broker is to distribute client sessions to a set of replicated servers. It is designed to support different types of selection policies and has the capability to collect performance data from the servers. We include in our description the technique used to instrument Apache servers and our implementation of the server-broker protocol that we have developed. Our implementation of the QoS broker and the technique used to collect data for the performance parameters of interest are also described. We use our prototype to study the performance of server selection algorithms under realistic conditions. The experimental environment and an analysis of the experimental results are presented. yes M. Yao and G. v. BochmannTesting for a conformance relation based on acceptanceProc. of the International Joint Conference on Theory and Practice of Software Development, TAPSOFT'93, Orsay, France, April 1993, pp.519-5281993Yaokw-citr kw-ocr -submitted to CONCOUR'92, NY state -submitted to TAPSOFT'93 (accepted)yes M. Yao, A. Petrenko and G. v. BochmannConformance testing of protocol machines without resetIFIP 13th Int. Conference on Protocol Specification, Testing and Verfication, Liege, Belgium, May 1993, pp.241-2531993Yaokw-citr kw-ocr kw-pub kw-ftp - submitted to PSTV'93, May 93, Liege, Belgium, [Dec.92] acceptedIn a number of test generation methods for conformance testing of communication protocols modeled by finite state machines, the reliable reset function has been assumed to be available in an implementation to be tested. In practice, however, the reliable reset may sometimes be difficult to realize and therefore this kind of test generation methods cannot be employed. In this paper, we propose an approach to the generation of test cases from protocol machines which can be specified by finite state machines possessing at least one Unique Input/Output sequence for each state. Our approach has been developed without the reliable reset assumption and it guarantees full fault coverage. yes M. Yao, A. Petrenko and G. v. BochmannFault coverage analysis in respect to an FSM specificationIEEE INFOCOM'94, Toronto, Canada, June 1994, pp.768-7751994Yaokw-ch kw-pub kw-ocr kw-ftp -submitted to IEEE INFOCOM'94, Toronto, Ont. Canada, June 1994 [Sept.93]. acceptedIn this paper, a connection is established between the following two research activities: (1) the state minimization of finite state machines (FSMs) studied in the automata theory, and (2) the fault coverage analysis of test suites in respect to FSM specifications used for FSM-based hardware and software testing, and in particular for conformance testing of communication protocols. The concept of complete fault coverage in respect to a given fault model is defined. A fault coverage analysis procedure, capable of deciding if a given test suite provides complete fault coverage in respect to a given FSM specification, is then developed. The core of this fault coverage analysis procedure is a state minimization procedure developed in this paper specifically for the class of FSMs whose graphic representations are trees. The fault coverage analysis procedure can cope with partially defined FSM specifications which need not be reduced and faults that can increase the number of states up to a chosen upper bound. Two necessary and one sufficient conditions, which in some cases may simplify the fault coverage analysis, are also presented. yes M. Yao, A. Petrenko and G. v. BochmannA structural analysis approach to evaluating fault coverage of software testingIn Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques (FORTE 94), Berne, Switzerland, pp. 399-414.1994Yaokw-ch kw-pub kw-ftp kw-ocrSoftware testing is always a trade-off between increased confidence in the correctness of the software system under examination and constraints on the amount of time and effort that can be spent in testing the software system. As a result, the fault coverage or adequacy of the test suite used to test the software system becomes a very important issue as it directly reflects the confidence in the correctness of the system under test. Mutation analysis is a well studied approach to the evaluation of fault coverage of a given test suite. However, it often becomes impractical as it may require to generate a huge number of mutants each of which should then be executed against the given test suite. In this paper, we propose a structural analysis approach to the evaluation of fault coverage of software testing. This approach is developed based on the finite state machine (FSM) model which has been used in the testing of certain software systems such as communication protocols and object-oriented programs as well as the testing of sequential digital circuits. The attractiveness of this approach is its low computational complexity. It calculates the fault coverage of a given test suite by directly analyzing the test suite against the specification machine. Therefore, it avoids the generation and execution of mutants. This approach has been implemented and a number of experiments has been carried out. Some of the experimental results are summarized in this paper to show the accuracy of this approach compared with the mutation analysis technique. yes M.-V. M. Salem, G. v. Bochmann and J. W. WongServer selection for differentiated classes of usersInt. Symp. on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2002), San Diego, July 2002, pp.2002Salekw-ocrIt is expected that some applications like for instance, e-commerce systems, will be able in the future to provide different levels of service to different classes of users. Classes of service may for instance be access-oriented, performance-oriented or content-oriented. In this paper, we investigate the introduction of differentiated server selection during the phase of server selection and at independent brokerage entities and not at the server level. This has the advantage that service differentiation can be realized using a broker and a set of generic servers, thus enhancing the portability of servers. Development of servers remains generic while brokers implement sophisticated policy requirements. yes M.-V. M. Salem, G. v. Bochmann and J. W. WongWide-area server selection using a multi-broker architectureProc. International Workshop on New Advances of Web Server and Proxy Technologies, Providence, USA (May 19, 2003)2003Salekw-ocryes M.-V. Mohamed-Salem, J. W. Wong and G. v. BochmannA scalable load-sharing architecture for distributed applicationsProc. 9th IEEE Int. Conf. on Software, Telecommunications and Computer Networks, SoftCom 2001, October 2001, pp. 747-755.2001Salekw-ocrIn recent years, we have seen a significant growth in the development and deployment of distributed applications over the Internet. For large-scale deployment, the system architecture should be able to scale to many users. A common technique for scalable design is replicated servers. The management of replicated architectures introduces new challenges. One very important challenge is how can a client locate the appropriate replica of a server without being aware of the specific details of replica organization, and how can this process scale to a large number of users. In this paper, we investigate the delegation of server selection functionality to an independent brokerage service. A "broker" is used to distribute load to replicated servers. Server selection is "session" based, and intermediate network entities are not required in load balancing activities. Several algorithms for server selection are developed and their performance, under the proposed architecture, is evaluated by simulation. N. Chefai, G. v. Bochmann and N. D. GeorganasPerformance Evaluation of the Preemptive Bandwidth Allocation ProtocolProc. International Workshop on Multimedia Interactive Protocols and Systems (MIPS, formerly IDMS/PROMS), Nov. 2003, Napoli, Italy.2003Chefkw-ocryes N. Chefai, N. Georganas and G. v. BochmannPreemptive bandwidth allocation protocol for multicast, multi-streams environmentsProc. of the ninth ACM International Conference on Multimedia, Ottawa, pp. 528-530, 20012001Chefkw-ocryes N. Rico and G. v. BochmannPerformance description and analysis for distributed systems using a variant of LOTOSProc. IFIP Symposium on Protocol Specification, Testing and Verification, Stockholm, June 1991, pp.199-2131991Ricokw-ocr, kw-ch N. Rico, G. v. Bochmann and O. CherkaouiModel-checking for real-time systems specified in LOTOSProc. Computer Aided Verification, 1992, pp.277-2881992Ricokw-ch kw-ocr -submitted to CAV'92 (accepted)yes O. Kabranov, D. Makrakis, C. Charalambous, D. Ionescu and G. v. BochmannOptimal wavelength allocation and flow assignment for optical networks for profit maximizationProc. Intern. Conf. on Info-tech and Info-net, ICII'2001, Oct. 2001, Beijing, China2001Kabrkw-ocryes O. Lecarme and G. v. BochmannA (truly) usable and portable compiler writing systemProc. IFIP Congress 1974, Stockholm, 1974, pp. 218-2211974Lecakw-ocr P. Dini and G. v. BochmannAutomatic reconfiguration for runtime feature-interaction resolution in an object-oriented environmentin Proc. Third Intl Workshop on Feature Interactions in Telecommunications Software Systems, Kyoto, Japan, October,1995, pp.115-1261995Dinikw-ocr P. Dini and G. v. BochmannSpecifying lifecycles of object interactions for reconfiguration management in distributed systemsIn the Second IEEE Systems Management Workshop, Toronto, Ontario, Canada, June 19-21, 1996, pp. 82-911996Dinikw-ocr P. Dini, A. Das and G. v. BochmannApplying parallel algorithms for managing distributed systemsThe 11th International Conference on Systems Engineering (ICSE'96), Special Session on Networks and Distributed Systems, University of Nevada, Las Vegas, 9-11 July 19961996Dinikw-ocr kw-ADcr P. Dini, A. Hafid and G. v. BochmannCost models for distributed multimedia applicationsIn the International Pacific Workshop on Distributed Multimedia Systems, Hong Kong University of Science and Technology (HKUST), June 25-28, 1996, pp. 238-2451996Dinikw-ocr kw-citr Request for CITR publication requested by mail on May 29, 96 Approved for CITR publication by fax on June 27, 96 P. Dini, D. Ramazani and G. v. BochmannFormal and informal in balanced system specificationsProceedings of the IEE/ECLA/IFIP Intl Conference on Architecture and Design Methods for Balanced Automation Systems (BASYS 95), July 1995, Victoria, ES, Brazil, pp. 339-3481995Dinikw-ocroriginal title was: Formal and informal (aspects) in balanced system specifications P. Dini, G. v. Bochmann and R. BoutabaPerformance evaluation for distributed system componentsin Proc. Second IEEE Systems Management Workshop, Toronto, Ontario, Canada, June 19-21, 1996, pp.20-291996Dinikw-ocryes P. Dini, G. v. Bochmann and R. DssouliSur la voie de l'intégration dans la gestion des systèmes ouverts distributésProc. Colloque Francophone sur l'Ingénierie des Protocoles (CFIP'95), Rennes, France, 1995, pp. 19-491995Dinikw-ocr kw-RDcr kw-crim P. Dini, R. Boutaba and G. v. BochmannHuman and automatic policies in concert: a policy-driven approach to manage distributed systemsIn the IEEE-SMC IMACS Conference on Computational Engineering in Systems Applications, Lille, France, July 9-12, 19961996Dinikw-ocr P. He and G. v. BochmannInter-area shared segment protection of MPLS flows over agile all-photonic star networksProc. IEEE Globecom 2007.2007Hekw-ocrWe study the resilience of MPLS flows over an agile all-photonic star WDM network (AAPN). On the basis of our previous inter-area optimal routing architecture, we propose and develop a dynamic inter-area shared segment-based protection (SSP) framework. We consider the dynamic protection for optimal inter-area working paths and improve the recovery time by segment-based protection. We develop a distributed partial routing information management to increase the scalability in multi-area networks while maintaining good performance compared with the case of complete information. By simulation, we show that our framework outperforms existing scheme. Furthermore, our approach shows its good potential to be a protection solution for inter-AS protection. yes P. He and G. v. BochmannOSN-IX - A Novel Internet eXchange (IX) architecture based on overlaid-star networksProc. 4th Euro-NGificonf. on Next Generation Networks, Krakow, April 2008.2008Hekw-ocrWe propose a novel Internet Exchange (IX) architecture, namely OSN-IX, which adopts an overlaid-star network (OSN) as an IX. OSN can be considered as a "distributed switch", which combines the advantages of the network and switch. Compared to other IX architectures, e.g., LAN-based IX, MPLS IX, Photonic IX, etc., OSN-IX has good properties of scalability, resilience, and widely distributed access points. Particularly, for the first time, OSN-IX introduce traffic engineering (TE) into the IX world. Based on the TE framework we developed for OSN-IX, OSN-IX can provide optimized dynamic inter-ISP (Internet Service Provider) routing while requiring no change, hardware or software, on existing traditional IP/MPLS routers. We have shown by simulation that our TE framework outperforms several existing inter-AS TE schemes. yes P. He and G. v. BochmannRouting of MPLS flows over an agile all-photonic star networkProc. of IASTED Intern. Conf. on Communication Systems and Applications (CSA 2006), July, 2006.2006Hekw-ocrIn this paper, we study how MPLS flows are routed in an Internet that contains a centrally-controlled agile all-photonic star WDM network (AAPN). Two scenarios are considered, namely deploying AAPN within one OSPF (Open Shortest Path First) area and within several OSPF areas. Since the AAPN provides an NxN interconnection structure for the N edge nodes of the AAPN architecture, the straightforward usage of a routing protocol like OSPF leads to scalability problems. In the first scenario, we have identified several schemes by which this scalability problem can be reduced. The idea is to introduce "virtual routers" that represent a collection of edge nodes (and possibly also the core node), thus reducing the number of paths between the "routers". In the second scenario, we focus on inter-area routing in large-scale IP/MPLS networks. This paper proposes a novel framework for inter-area MPLS Traffic Engineering. The key to our proposal lies in deploying the AAPN architecture as the OSPF backbone area and introducing the concept of "virtual area border routers" (v-ABRs). Compared with other proposals, our proposal can provide globally-optimized inter-area routing and has very good compatibility to existing traditional IP/MPLS routers. yes Q. Gao, R. Groz, G. v. Bochmann, J. Dargham and E. H. HtiteValidation of distributed algorithms and protocolsProceedings of the1995 International Conference on Network Protocols (ICNP 95), pp.110-1171995Gaokw-ocr earlier version Gao 93The use of formal description techniques allows the partial automation of the design, the validation, and the implementation of communication protocols and distributed algorithms. In this paper, we present our experiences of using the Estelle language, and a simulation and validation tool, called Veda, to simulate and validate complex distributed algorithms for the distributed implementation of multi-rendezvous. Some design errors in published distributed rendezvous algorithms were found. We obtain from these experiences heuristic guidelines for trouble shooting of distributed algorithms. yes Q. M. Tan, A. Petrenko and G. v. BochmannModeling Basic LOTOS by FSMs for Conformance TestingProceedings of the 15th International Symposium on Protocol Specification, Testing and Verification (PSTV 15), Poland, June 95, pp.137-1521995Tankw-pub kw-ftp kw-ch kw-ocr Submitted for publication to PSTV 95, Poland (March 1, 1995) Accepted in April 1995yes Q. M. Tan, A. Petrenko and G. v. BochmannA test generation tool for specifications in the form of state machinesin proceedings of the International Communications Conference (ICC) 96, session on advanced tools and technologies for developing high integrity software systems, Dallas, Texas, June 23-27, 1996, pp.225-2291996Tankw-ocr kw-pub kw-ftp submitted to ICC 96 (Sept 95) Accepted in February 96yes Q. M. Tan, A. Petrenko and G. v. BochmannA framework for conformance testing of systems communicating through rendezvousin proceedings of the 26th IEEE International Symposium on Fault-Tolerant Computing, Sendai, Japan, June 25-27, 1996, pp.230-2381996Tankw-ocr kw-look Accepted in March 96yes Q. M. Tan, A. Petrenko and G. v. BochmannChecking experiments with labeled transition systems for trace equivalencein Proc. IFIP 10th Intern. Workshop on Testing of Communication Systems(IWTCS'97), Cheju Island, Korea, 19971997Tankw-ftp kw-ocr kw-look submitted in March 1997 for IWTCS'97 Accepted May 24 1997We apply the state identification techniques for testing communication systems which are modeled labeled transition systems (LTSs). The conformance requirements of specifications are represented as the trace equivalence relation and derived tests have finite behavior and provide well-defined fault coverage. We redefine in the realm of LTSs the notions of state identification that were originally defined in the realm of input/output finite state machines (FSMs). Then we present the corresponding test generation methods and discuss their fault coverage. It is shown that for an FSM-based method with a notion of state identification we can have a corresponding LTS-based method with a similar notion of state identification, and if the FSM-based method guarantees complete fault coverage then the LTS-analogue also guarantees such coverage. yes R. Dssouli and G. v. BochmannConformance testing with multiple observersProc. IFIP Workshop on Prot. Specification, Testing and Validation, 1986, North-Holland Publ., pp. 217-2291986Dssokw-ocr kw-RDcr kw-pub R. Dssouli and G. v. BochmannError detection with multiple observersProc. IFIP Workshop on Protocol Specification, Testing and Verification,Toulouse, France, June 1985, M. Diaz ed., North Holland, pp.483-4941985Dssokw-ocr kw-RDcr kw-pub R. Dssouli, R. Fournier and G. v. BochmannDistributed observation and FIFO queuesProc. of the Third International Conference on Formal Description Techniques (FORTE'90), Madrid, Nov. 1990, J. Quemada et al. (eds), North Holland, pp.303-3101990Dssokw-ocr kw-RDcr kw-ch R. Gotzhein and G. v. BochmannSpecialization in EstelleIFIP Symp. on Protocol Spec., Testing and Verification, Vancouver, 1994, pp.17-321994Gotzkw-pub kw-citr kw-ocr -submitted to FORTE'93 (refused: rejection is partly because no more than one paper submitted by a FORTE'93 Program Committee Member will be accepted) - PSTV'94 accepted earlier version Gotz 92dyes R. K. Keller, R. Lajoie, M. Ozkan, F. Saba, X.Shen, T. Tao and G. v. BochmannThe Macrotec toolset for CASE-based business modellingCASE'93, Singapore, July, 19931993Kellkw-crim kw-ocryes R. T. Sanders, R. Braek, G. v. Bochmann and D. AmyotService discovery and component reuse with semantic interfacesProc. of the SDL Forum, Norway, July 2005, Springer Verlag, LNCS 3530, pp. 85-102.2005Sandkw-ocrCurrent trends in distributed computing and e-business processing suggest that many applications are evolving towards Service Oriented Computing (SOC) with technologies such asWeb services. Services are autonomous platform-independent computational elements, and we observe an increasing need for core SOC technologies for dynamic discovery, selection, and composition of services. However, such technologies are often based on syntactic descriptions of the services and of their interfaces, which are insufficient to ensure that desired liveness properties are satisfied. In this paper, we propose an approach for the description, discovery, and selection of services based on role modeling and goal expressions that enables the definition of semantic interfaces and the evaluation of liveness properties. The same mechanisms also enable component reuse. We discuss how UML 2.0 can support the modeling of both the services and the desired properties. The approach is illustrated with telephony services. yes S. A. Ezust and G. v. BochmannAn Automatic Trace Analysis Tool Generator for Estelle SpecificationsComputer Communication review Volume 25 Number 4, October 1995, Proceedings of ACM SIGCOMM 95 Conference, Cambridge, MA, pp. 175-1841995Ezuskw-ocr kw-ftp Summary of Ezus 95a (M.Sc Thesis) Submitted to ACM Sigcomm 95 (95/1/25)yes S. A. Paredes, G. v. Bochmann and T. J. HallDeploying agile photonic networks over reconfigurable optical networksProc. 14th IEEE Symposium on Computers and Communications, July 5 - 8, 2009, Sousse, Tunisia.2009Parekw-ocryes S. Asaduzzaman and G. v. BochmannA locality preserving routing overlay using geographic coordinatesIEEE Intern. Conf. on Internet Multimedia Systems Architecture and Application, Bangalore, India, Dec. 2009.2009Asadkw-ocrThis paper presents a design for a general distance-sensitive routing overlay which is based on adaptive hierarchical partitioning of the geographical network space. Taking the distance between the nodes of the P2P system into account is important for the search and data distribution functions provided by P2P systems. The use of different distance metrics, such as network delays and geographical positioning information, is discussed. The performance of the proposed routing overlay, in terms of two locality properties – stretch and route-convergence, is evaluated by simulation studies. Real topology data of 65 ISPs with presence in 534 cities across the world, collected by the RocketFuel project, is used as the basis of the simulated network. The performance results are compared with corresponding results obtained from a simulated Pastry overlay constructed on the same network, with and without the proximity based neighbor selection. While the performance of the two distance-sensitive P2P systems are similar, the proposed geographical routing scheme facilitates certain geographical search applications that are difficult to realize within a Pastry system. yes S. Asaduzzaman, Y. Qiao and G. v. BochmannCliqueStream - An efficient and fault-resilient live streaming network on a clustered peer-to-peer overlayProc. 8th IEEE Intern. Conf. on Peer-to-Peer Computing (P2P08), Sep 2008, Aachen, Germany2008Asadkw-ocrSeveral overlay-based live multimedia streaming platforms have been proposed in the recent peer-to-peer streaming literature. In most of the cases, the overlay neighbors are chosen randomly for robustness of the overlay. How- ever, this causes nodes that are distant in terms of proximity in the underlying physical network to become neighbors, and thus data travels unnecessary distances before reaching the destination. For efficiency of bulk data transmission like multimedia streaming, the overlay neighborhood should resemble the proximity in the underlying network. In this paper, we exploit the proximity and redundancy properties of a recently proposed clique-based clustered overlay network, named eQuus, to build efficient as well as ro- bust overlays for multimedia stream dissemination. To combine the efficiency of content pushing over tree structured overlays and the robustness of data-driven mesh overlays, higher capacity stable nodes are organized in tree structure to carry the long haul traffic and less stable nodes with in- termittent presence are organized in localized meshes. The overlay construction and fault-recovery procedures are ex- plained in details. Simulation study demonstrates the good locality propoerties of the platform. The outage time and control overhead induced by the failure recovery mechanism are minimal as demonstrated by the analysis. yes S. Bessette and G. v. BochmannImplementation issues for the OSI file transfer, access and management protocolProc. Symposium on Communications, Queen's University, Kingston, Ont., June 1986, pp. C.4.16-C.4.181986Besskw-ocr S. Buffalov, K. El-Fakih, N. Yevtushenko and G. v. BochmannProgressive solutions to a parallel automata equationProc. FORTE Conf. (IFIP), Sept. 2003, Berlin, LNCS 2767, Springer Verlag, pp. 367-382.2003Buffkw-ocrIn this paper, we consider the problem of deriving a component X of a system knowing the behavior of the whole system C and the other components A. The component X is derived by solving the parallel automata equation A X C. We present algorithms for deriving the largest progressive solution to the equation that combined with A does not block any possible action in C and we introduce a new simulation relation between automata in order to characterize all progressive solutions. yes S. Choudhary, M. E. Dincturk, G. v. Bochmann, G. V. Jourdan, I. V. Onut and P. IonescuSolving some modeling challenges when testing Rich Internet Aplications for securityThird Intern. Workshop on Security Testing (SECTEST, afffiliated with ICST), 2012, Montreal, Canada, Proc. ICST, pp. 850 - 857.2012Choukw-ocrCrawling is a necessary step for testing web applications for security. An important concept that impacts the efficiency of crawling is state equivalence. This paper proposes two techniques to improve any state equivalence mechanism. The first technique detects parts of the pages that are unimportant for crawling. The second technique helps identifying session parameters. We also present a summary of our research on crawling techniques for the new generation of web applications, so-called Rich Internet Applications (RIAs). RIAs present new security and crawling challenges that cannot be addressed by traditional techniques. Solving these issues is a must if we want to continue benefitting from automated tools for testing web applications. yes S. Erradey, M. Kadoch and G. v. BochmannObject-oriented design of a message handling system protocolin proceedings of 1995 Canadian Conference on Electrical and Computer Engineering, Montreal1995Errakw-crim kw-ocryes S. Fischer, A. Hafid, G. v. Bochmann and H. d. MeerCooperative quality of service management for multimedia applicationsProceedings of the 4th IEEE International Conference on Multimedia Computing and Systems, Ottawa, Canada, June 1997, pp. 303-310.1997Fisckw-ocr kw-citr kw-look submitted to IEEE Conf. on Multimedia Computing and Systems, June 1997, Ottawa Accepted Approved for publication by CITR on 97-08-25Quality of Service (QoS) management becomes more and more important, especially in networks where many applications are competing for a limited number of resources. As these applications become more complex (consider e.g. multiparty multimedia applications), the number of options for QoS management increases, leading to more complex decision processes. In this paper, we propose an approach for cooperative QoS management, where application-oriented QoS agents are distributed throughout the network and the end systems, communicating with each other. This distributed management system tries to guarantee the QoS level negotiated with the users, at the same time optimizing resource usage. The advantages of distributing the management process are (i) an easier and more precise localization of the cause of QoS problems, (ii) better knowledge of local situations, (iii) a lower complexity for a single QoS agent and (iv) an increase in possible actions. We describe management procedures for QoS negotiation, adaptation and renegotiation. yes S. Fischer, M.-V. Salem and G. v. BochmannApplication design for cooperative QoS managementin Proc. IFIP 5th International Workshop on Quality of Service (IWQoS'97), New York City, May 1997, pp. 191-1941997Fisckw-ocr kw-citr kw-look kw-ftp kw-pub submitted in April 97 to International Workshop on Quality of Service (IWQoS'97), NewYork Accepted. Short version at IWQoS'97, long version in technical report P#1067 Approved for publication by CITR on 97-08-25QoS management for distributed multimedia applications becomes more complex when a huge number of users are participating, as for instance in broadcasts of major sports events or in teleteaching ap plications. On the other hand, such an application offers a variety of options to improve resource usage and system performance while decreasing the overall communication cost. We developed a new QoS management scheme called Cooperative QoS management which handles both increased complexity and options. In this paper, we show how this new scheme influences the design of applications based on it, especially concerning the QoS user interface. As an ex ample, we present a teleteaching application developed in the framework of our project "Broadband Services". yes S. Fujiwara and G. v. BochmannTesting non-deterministic state machines with fault coverageProc. IFIP Int. Workshop on Protocol Test Systems, Netherlands, October 1991, pp. (III-257)-(III-275)1991Fujikw-ocr, kw-chyes T. Hall, A. Paredes and G. v. BochmannAn Agile All-Photonic NetworkProc. Fourth Intern. Conf. on Optical Communications and Networks, ICOCN 2005, Bangkok, Thailand; 14-16 Dec. 2005, pp. 365-368.2005Hallkw-ocrThis paper presents an overview of recent and current work being conducted in the “Agile All-Photonic Networks”, AAPN, Research Network. An AAPN is a wavelength division multiplexed network that consists of several overlaid stars formed by edge nodes that aggregate traffic, interconnected by bufferless optical core nodes that perform fast switching in order to provide bandwidth allocation in sub-wavelength granularities. The architectures, tools and methods being developed for its operation are described, as well as the issues to be solved. yes T. Higashino, G. v. Bochmann, X. Li, K. Yasumoto and K. TaniguchiTest system for a restricted class of LOTOS expressions with data parametersProceedings of the Fifth IFIP Workshop on Protocol Test Systems (IWPTS '92), G.v. Bochmann et al. (eds.), North Holland Publ. 1993, pp.205-2161992Higakw-ocr kw-ch Older version of P#849 (Higa 94a)yes W. L. d. Souza, G. v. Bochmann, K. El-Khatib and X. HeAdaptacao de conteudo de mensagens HTTP baseada em perfis de dispositivo, conteudo, usuario e servico de rede(Content adaptation of HTTP messages based on device, content, user, and network service profiles) Proceedings of the 20th Brazilian Symposium of Computer Networks, Vol II, pp. 554-568, Buzios-RJ (Brazil), May 20-24, 2002.2002Souzkw-ocryes W. L. d. Souza, R. Dssouli and G. v. BochmannAmbiante de teste para protocolos de comunicacioProc. 3 Simposio Brasileiro sobre Redes de Computadores, Rio de Janeiro, April 1985, pp. 24.2 - 24.121985Souzkw-ocr kw-RDcr W. Probst and G. v. BochmannOperating system design with computer network communication protocolsProc. 5th Data Comm. Symposium (ACM SIGCOMM/IEEE), Sept. 1977, pp. 4-19 to 4-25. Reprinted in Distributed System Design, eds M.P. Mariani and D.F. Palmer, 19791977Probkw-ocr kw-pubyes W. Wang, S. Cheng and G. v. BochmannAccessing traditional intelligent services from SIP networksProc. 2001 International Conference on Info-tech and Info-net, October 2001, Beijing, China, IEEE Press, pp. 772-778.2001Wangkw-ocryes Y. Qiao and G. v. Bochmann Applying a diffusive load balancing in a clustered P2P systemProc. 9th Intern. Conf. on New Technologies of Distributed Systems (NOTERE), Montreal, Canada, 2009, pp. 189-199.2009Qiaokw-ocryes Y. Qiao and G. v. BochmannA diffusive load balancing scheme for clustered peer-to-peer systemsProc. 3rd Intern. Workshop on Peer-to-Peer Networked Virtual Environments (P2PNVE 2009), 15th International Conference on Parallel and Distributed Systems (ICPADS), Shenzhen (China), pp. 842-847, Dec. 2009.2009Qiaokw-ocryes Y. Qiao and G. v. BochmannUsing diffusive load balancing to improve performance of peer-to-peer systems for hosting servicesProc. 5th Intern. Conf. on Automonous Infrastructure, Management and Security (AIMS 2011), LNCS 6734, Springer, 2011, pp. 124 - 135.2011Qiaokw-ocryes Z. P. Tao, G. v. Bochmann and R. DssouliA top down method of synthesizing optimized protocol convertersIn Proceedings for the 14th IEEE Int. Phoenix Conference on Computers and Communications, March 19951995Taokw-ocr kw-RDcr kw-ch -submitted to 14th Annual IEEE Int. Phoenix Conference on Computers and Communications, March 1995 [Sept. 94]In this paper, we propose a top-down algorithm for constructing optimized protocol converters to achieve interoperability between heterogeneous computer networks. This method first generates a converter from a given service specification of the internetworking system and two protocol specifications, based on two important concepts: controllability and observability. Reduction relation [1] is used to compare the desired service specification and the internetworking system. Then an optimization algorithm is used for optimizing the converter. Compared with related works reported in [2], our method has three advantages: 1) It generates an optimized converter; 2) the service specification for the internetworking system can be nondeterministic; 3) it needs less computation. yes Z. P. Tao, G. v. Bochmann and R. DssouliVerification and diagnosis of testing equivalence and reduction relationProceedings of the 1995 International Conference on Networks and Protocols, Tokyo, Japan, pp.14-211995Taokw-ocr submitted to ICNP 95, Tokyo (March 24, 95) - accepted (june 20 95)yes Z. P. Tao, G. v. Bochmann and R. DssouliAn efficient method for protocol conversionProceedings of the Fourth Intl Conference on Computer Communications and Networks (IC3N 95), Las Vegas, USA, September 1995, p.40-471995Taokw-ocr kw-RDcrthis is a revised version of Tao 93byes Z. P. Tao, G. v. Bochmann and R. DssouliA model and an algorithm of subsystem constructionin proceedings of the Eighth International Conference on parallel and distributed computing systems, Sept. 21-23, 1995 Orlando, Florida, USA, pp.619-6221995Taokw-ocr kw-RDcr Z. Xu and G. v. BochmannA probabilistic approach for admission control to Web serversProc. of Intern. Symp. on Performance Evaluation of Computer and Telecommunication Systems, SPECTS 2004, San Jose, California, USA, July 2004, ISBN 1-56555-284-9, pp. 787 - 794.2004Xukw-ocrWe consider that some form of admission control must be applied to a Web server in order to avoid completely unacceptable response times during periods of heavy system overload. In this paper, we show that an on-off approach to admission control introduces oscillations in the server load, which may lead, in particular situations, to unacceptable variations in the server response time. In order to solve this problem, we propose a probabilistic approach to admission. A theoretical model and simulation studies show that these oscillations can be avoided with the probabilistic approach if suitable values are selected for its operating parameters. The most important parameters are the gradual nature of the probability function that determines the user acceptance probability, and the inter-observation period, which determines how frequently the response time of the server is determined. While the oscillations have in general only a small effect on the average response time, we showed that the probabilistic approach has a definite advantage for the distinction between different classes of users that have different priorities for accessing the server. yes

Copies of Published Articles as Book ChaptersAnch> G. v. Bochmann and C. SunshineA survey of formal methodsand "A hybrid model and the representation of communication services", chap. 20 and 23 in "Computer Network Architectures and Protocols" ed. P. Green, Plenum Press, N.Y., 1982. Original titles: 1980 - Formal methods in communication protocol design, and 1980 - A General Transition Model for Protocols and Communication Services1982Bochkw-ob G. v. Bochmann and C. SunshineFormal methods for protocol specification and validationchapt. 17 in Computer Network Architectures and Protocols, 2-nd edition (C.Sunshine, ed.), Plenum Press, 1989. Original title: 1980 - Formal methods in communication protocol design1989Bochkw-ob G. v. BochmannFinite state description of communication protocolsComputer Networks, Vol. 2 (1978), pp. 361-372, to be reprinted in "Conformance Testing Methodologies and Architectures for OSI Protocols", edited by R.J. Linn and M.U. Uyar, IEEE Computer Soc. Press, 1994.1994Bochkw-ob W. Probst and G. v. BochmannOperating system design with computer network communication protocolsProc. 5th Data Comm. Symposium (ACM SIGCOMM/IEEE), Sept. 1977, pp. 4-19 to 4-25. Reprinted in Distributed System Design, eds M.P. Mariani and D.F. Palmer, 19791977Probkw-ocr kw-pubyes

G. v. Bochmann and P. M. MerlinOn the construction of communication protocolsICCC, 1980, pp.371-378, reprinted in "Communication Protocol Modeling", edited by C. Sunshine, Artech House Publ., 1981; russian translation: Problems of Intern. Center for Science and Techn. Information, Moscow, 1981, no. 2, pp. 146-1551980Bochkw-ocr kw-ob

Articles in Non-Refereed JournalsAnch> G. v. Bochmann and D. OuimetTélétex fait une entrée réussie à l'Université de MontréalRecherche à L'Université de Montréal, Oct. 19861986Bochkw-ojnr G. v. BochmannExpérience d'enseignement individualiséDocument 2/2 (Febr. 1975), le Bulletin du Service Pédagogique, Université de Montréal1975Bochkw-ojnr

Non-Refereed Conference PresentationsAnch> A. Hafid, J. D. Meer, A. Rennoch, G. v. Bochmann and R. DssouliQuality of service verification experimentsWorkshop on Distributed Multimedia Applications and Quality of Service Verification, Montreal, June 19941994Hafikw-citr A. J. S. Ball, J. Gecsei and G. v. BochmannVideotex and librariesWCC ASIS Annual Conf., 1979, Regina1979Ballkw-ocnr A. Khoumsi, G. v. Bochmann and R. DssouliOn controlling distributed communiation systemsProc. ACFAS workshop on "Méthodes mathématiques pour la synthèse des systèmes informatiques", Montreal, May 1994, pp. 29-441994Khoukw-ch kw-ocnr kw-RDcnr C. Kawa, A. Jacques and G. v. BochmannInterconnection des réseaux et relais de transport54e Congrès de l'ACFAS, May 1986, Montréal1986Kawakw-ocnr D. Berger and G. v. BochmannUn logiciel de banque de données pour l'enseignement assisté par ordinateurCongrès ACFAS, 19831983Bergkw-ocnr E. Cusack and G. v. BochmannObject-oriented methods in communication standardsACM OOPS Messenger, Vol.3, No.2, April 1992, pp.7-81991Cusakw-ojnr, kw-ch Follow-up Report on ECOOP'91 Workshop W3 G. v. Bochmann and A. LeveilleUn modèle de transition pour la spécification formelle de protocoles de communicationActes des journées d'études sur les protocoles..., juin 1981, Paris, AFCET, 19811981Bochkw-ocnr G. v. Bochmann and C. Frasson et al.Scénario pour un système en éducation55-th ACFAS Congress, Ottawa, May 19871987Bochkw-ocnr G. v. Bochmann and F. H. VogtMessage Link ProtocolComputer Comm. Review (ACM) 9, No.2 (April 1979), pp.7-391979Bochkw-ojnryes G. v. Bochmann and L. SwainNational Library of Canada interligrary loan (ILL) protocol and ILL workstationProc. of Conf. on Introduction of High Level Protocol Standards for OSI, Department of Communications, Ottawa, 1984, pp. 599-6001984Bochkw-ocnr G. v. Bochmann, E. Cerny, J. Gecsei and B. SauvageauLow-cost Educational Micro-computer NetworkMIMificonference, Montréal, 19791979Bochkw-ocnr kw-pub G. v. Bochmann, J. Gecsei, F. Tompa and A. J. S. BallDatabase structures and query methods for videotex systems11th Biennial Symp. on Communications, Queen's University, Kingston, Ontario. (May 1982), Proc. pp. B-2.91982Bochkw-ocnr G. v. BochmannCombining assertions and states for the validation of process communicationProtocol Verification Workshop (DARPA/NBS), Washington, USA, March 19791979Bochkw-ocnr G. v. BochmannFormal description techniquesSecond International Conference on Introduction of Open Systems Interconnection Standards, Ottawa, May 19841984Bochkw-ocnr G. v. BochmannFormal models of protocols - limitations and futurepanel presentation at IFIP Symp. on Protocol Specification, Testing and Verification, Atlantic City, USA, June 19881988Bochkw-ocnr G. v. BochmannHigher-level protocols are not necessarily end-to-endpanel presentation at ACM SIGCOMM Symposium, Austin, 1983, Proc. pp... This article was reviewed in Infocom Standards, McGraw Hill, Vol.2, No.4 (April 1983), pp.66-671983Bochkw-ocnr G. v. BochmannL’importance de la recherche et du dévelopement pour l’évolution de l’industrie des télécommunicationspresentation given at "Telecommunications" conference organized by the International Research Institute, Montreal, March 19941994Bochkw-ocnr kw-crim G. v. BochmannLa dérivation de spécifications de protocoles à partir de spécifications de services de communicationColloque des Entretiens du Centre Jacques Cartier "Les Systèmes parallèles et distribués", Lyon, Dec. 19891989Bochkw-ocnr G. v. BochmannLa gestion de la qualité de service au niveau applicatifinvited presentation at intern. NOTERE conference, Montreal, 1998.1998Bochkw-ocnrRÉSUMÉ -- La notion de qualité de service (QdS) a été introduite d'abord pour la définition des services de communication fournis par les réseaux. Dans ce contexte, on est intéressé par le délai de transmission et le taux de perte pour un débit donné. Par contre, la "qualité" vue par un personne qui utilise un système de téléconférence, de vidéo sur demande ou d'accès à une banques de données multimédia, est caractérisée par d'autres attributs, tel que la qualité de l'image ou du son et le temps de reponse; et ces attributs dépendent pas seulement du réseau, mais aussi des propriétés matériels et logiciels des orginateurs impliqués dans l'application, à savoir la station de travail de l'usager et le(s) serveur(s). La gestion de la QdS d'une application implique donc toutes ces composantes du système. Il est important de considérer dans ce contexte les préférences des usagers puisque différentes critères d'optimisation pourraient être utilisées en cherchant une balance entre qualité et coût. -- La présentation donnera une vue d'ensemble de résultats de recherche dans le domaine de la gestion de la QdS pour les applications impliquant des banques de données multimédia, et donnera aussi un aperçu des problèmes de QdS dans le contexte du commerce électronique et des applications de téléconférence. G. v. BochmannMicroelectronics and computer applications in the area of signalling and control(36 pages), invited paper at Symposium on Application of Microelectronics to Transportation, NSERC/Transport Canada, Oct. 1984, Ottawa1984Bochkw-ocnr G. v. BochmannNotes on the X.25 Procedures for Virtual Call Establishment and Clearing(invited paper), ACM Computer Comm. Review Vol.7, No.4, Oct. 1977, pp.53-601977Bochkw-ojnr kw-pubyes G. v. BochmannNouveaux développements en télécommunications et la modélisation de nouveaux servicesPresentation at Salon de l'informatique et de la bureautique, Trois-Rivières, Febr. 1991 (invited)1991Bochkw-ocnr, kw-ch G. v. BochmannOn the contruction of submodule specificationsVerification Workshop, SRI International, Calif. USA, April 1980, ACM SE Notes 5, No. 3 (July 1980), pp. 361980Bochkw-ocnr G. v. BochmannOn the theoretical power of some testing methodsINWG/NPL Workshop, May 1981, London, (1981), National Phys. Lab., Proc. Vol. II, pp. l5-231981Bochkw-ocnr G. v. BochmannPanel presentation on computer communication protocol verificationIFIP Congress 1977, Toronto1977Bochkw-ocnr G. v. BochmannProtocol validation and testingSecond International Conference on Introduction of Open Systems Interconnection Standards, Ottawa, May 19841984Bochkw-ocnr G. v. BochmannResearch projects in the area of conformance testingpresented at the 2-nd Annual Conference of CIGOS (Can. Interest Group on OSI), Quebec City, Oct. 19891989Bochkw-ocnr G. v. BochmannSemi-automatic implementation of Transport and Session protocolsProc. 3-rd Int. Conf. on Introduction of OSI Standards (Depart. Trade and Ind., UK), Cambridge, Sept. 19851985Bochkw-ocnr G. v. BochmannSommes-nous prets pour l'orientation objet ?Panel presentation at the workshop "L'approche orientee objet: mode d'informaticiens ou necessite organisationnelle?", GIRICO, Montreal, May 19941994Bochkw-ocnr kw-crim G. v. BochmannSummary of current researchWorkshop on Fundamental Issues in Distributed Computing (ACM), Dec. 1980, Calif. USA1980Bochkw-ocnr G. v. BochmannTest coordination procedures for ferry architecturesFirst Intern. Workshop on Protocol Test Systems, Vancouver, Oct. 1988.1988Bochkw-ocnr G. v. BochmannTesting of Transport Protocol Implementationspresentation at the Intern. Workshop on OSI Protocol Testing, Paris, June 19831983Bochkw-ocnr G. v. BochmannUn programme général pour les réactions à hautes énergies sur les noyauxCongrès de l'ACFAS, Sherbrooke, 19711971Bochkw-ocnr G. v. BochmannUne définition syntactico-sémantique des langages pour un système d'écriture de compilateursCongrès de l'ACFAS, Ottawa, 19721972Bochkw-ocnr G. v. BochmannUse of formal specifications in protocol validation16-th Annual Lake Arrowhead Workshop on Current Issues in Computer Networking and Distributed Databases, Aug. 1977, Calif. USA1977Bochkw-ocnr G. v. BochmannVideotex and TeletexFirst Latin American Symposium on Computer Networks (OAS/NSTC), Mexico, 19811981Bochkw-ocnr G. v. BochmannVideotex database structuresImplementing Telidon conference (Socioscope Inc.), Ottawa, May 19821982Bochkw-ocnr J. Vaucher, G. v. Bochmann, B. Levebvre, S. Desmarais and P. GamacheLe projet MMS: l'informatique artificielle appliquée à l'implantation et au test de logiciels industrielsprésenté au Congrès de l'ACFAS, May 1991, Sherbrooke, Québec1991Vauckw-ocnr, kw-crim, kw-pub K. El-Khatib, G. Luo and G. v. BochmannMultiplexing scheme for RTP flows between access routersProceedings of the 45-th Internet Engineering Task Force, Oslo, Norway, 2001.2001ElKhkw-ocnr K. El-Khatib, G. Luo and G. v. BochmannMultiplexing scheme for RTP flows between access routersProceedings of the 45-th Internet Engineering Task Force, Oslo, Norway, 2001 (an "Internet Draft")2001Elkhkw-ocnr M. Barbeau, P. d. Saqui-Sannes and G. v. BochmannAn experience with an object-oriented methodology to design a network element controllerPosition Paper for OOPSLA'91 Workshop on Real-Time and Embedded Systems, 19911991Barbkw-crim kw-ocnr P. Dini, G. v. Bochmann and R. BoutabaNew models for applying automatic reconfiguration in networks and distributed systemsIn the First European Conference on Intelligent Management Systems in Operations, 1997, pp. 163-1701997Dinikw-ocnr P. Ward and G. v. BochmannUn générateur de compilateurs pour l'analyse syntaxique descendanteCongrès de l'ACFAS, Québec, 1974, Proc. p.1311974Wardkw-ocnr

Unpublised ReportsAnch> H.N. Castejón, G.v. Bochmann, Rolv BrækDirect Realizabilityunpublished report2009Castkw-oryes G.v. BochmannCompiler Generation for Attribute Grammarsproject description published in the proceedings of some ACM workshop1973Bochkw-oryes G.v. BochmannActivity Nets - A UML profile for modeling workflow and business processesReport prepared for DMR, Montreal2000Bochkw-oryes S. Asaduzzaman, G.v. BochmannDistributed B-tree with Weak Consistencyunpublised manuscript2010Asadkw-oryes S. Asaduzzaman, G.v. BochmannGeoP2P - An Adaptive Peer-to-Peer Overlay for Efficient Search and Update of Spatial Informationunpublised manuscript2009Asadkw-oryes G. v. BochmannAnalysis and evaluation of two formal description techniques for specifying high-level computer network protocolsand "Proposed revisions...", prepared for SRI International under contract for the US Nat. Bur. of Standards, 19811981Bochkw-or A. Bean, G. Bochmann, M. Barbeau, A. Finkel, M. Erradi and L. LecomteApplication Examples for LupinBNR-CRIM Project, Progress Report Document no. 3, nov.19881988Beankw-report A. ElIraki, G. Lapalme and G. v. BochmannAn Interactive System for the Specification of ADA-Based Design and Implementation Interactive Systemssubmitted for publication1989ElIrkw-subm A. Ghedamsi and G. v. BochmannDiagnostic tests for finite state machinespublication départementale P#807, Dépt. IRO, Université de Montréal, 19921992Ghedkw-ch kw-pubn -submitted to Journal of Computer and Software Eng. March 92 - REJECTED (?) A. Ghedamsi, G. v. Bochmann and R. DssouliDiagnosing multiple faults in finite state machinespublication départementale P#859, Dépt. IRO, Université de Montréal, janvier 19931993Ghedkw-ch kw-pubn kw-ftp -submitted to IEEE Tr. on SE [Jan. 93] (rejected)We propose a generalized diagnostic algorithm for the case where more than one fault (output or transfer) may be present in one of the transitions of a non-deterministic system. Such an algorithm localizes the faulty transition in the system, once a fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptoms and which permit the location of the detected faults. The algorithm guarantees the correct diagnosis of any single or double faults (output and/or transfer) in at most one of the transitions of a system which is represented by an observably non-deterministic finite state machine (ONFSM). A simple example is used to demonstrate the different steps of the algorithm. yes A. Hafid, A. Bibal, G. v. Bochmann, T. Burdin, R. Dssouli, J. Gecsei, B. Kerherve and Q. VuOn news-on-demand service implementationpublication départementale P#928, Dépt. IRO, Université de Montréal,19941994Hafikw-citr kw-pub kw-ftp A. Hafid, G. v. Bochmann, B. Kerhervé, R. Dssouli and J. GesceiOn quality of service negotiation for distributed multimedia applicationspublication départementale P#977, Dépt. IRO, Université de Montréal, 19951995Hafikw-citr kw-pubn kw-ftp kw-subm requested approval on May 1, 1995. Approved on May 25th. submitted to IEEE Journal of Selected Areas in Communications (Special issue) (June 95) A. Khoumsi, G. v. Bochmann and R. DssouliOn Synthesizing Protocols for Real-Time ApplicationsSubmitted for publication1994eKhoukw-subm Submitted to Journal IEEE Trans. on Software Engineering A. Khoumsi, G. v. Bochmann and R. DssouliOn specifying real-time discrete event systems - An application for designing real-time protocolsLonger version of Khou 94c1994Khoukw-pub This is not available by FTP due to our inability to print the document to post-script. The microsoft word file is on fermandez in the publications folder. If someone figures out how to do it, please tell me (ezust).This paper deals mainly with modeling and design of distributed communicating systems with temporal requirements. Firstly, timed traces and their corresponding untimed traces are defined and used to model behaviours of real-time discrete event systems (RTDES). These traces use a conceptual digital global clock which generates periodically an event tick. Next, a model based on timed automata is defined and studied. This model is convenient to specify a service desired by a user of a distributed RTDES (DRTDES) and the supremal behaviour of the medium. Timed automata use a digital global clock, and several fictitious timers and counters. A second model, based on temporized automata, is used to model the protocol and temporal constraints on the medium. Contrary to timed automata, temporized automata do not use counters. Next, we propose two procedures of protocol synthesis, respectively for sequential and parallel DRTDES. The entries of these procedures are specified with timed automata, while the results of these procedures, i.e., the protocol and the temporal requirements of the medium, are specified with temporized automata. Compared to [10], the application field is much broader, because two important restrictions are removed. Firstly, temporal requirements are between events which are not necessarily consecutive. Secondly, the systems considered can be parallel and concurrent. Compared to [11], three important additions are made. Firstly, the temporized automata are formally defined, and we present the principle to compute them. Secondly, the specifications obtained by the protocol synthesis are optimized in the sense that they do not necessitate to synchronize the different local clocks of each site of the distributed system. Thirdly, the specifications obtained by the protocol synthesis are improved in the sense that they are more concise, by parameterizing some of their transitions. yes A. Khoumsi, G. v. Bochmann, R. Dssouli and A. GhedamsiA systematic and optimized method for synthesizing protocol specifications from service specifications for real-time applications1994Khou-submitted to ULPAA'94 (Upper Layer Protocols And Architectures) (juin 94) [Nov. 93] REJECTED Submitted to Forte 94 (May 3, 1994) - REJECTED Khou 94e is an improved version of the same paper.yes A. Khoumsi, G. v. Bochmann, R. Dssouli and A. GhedamsiA systematic and optimized method for designing protocols for real-time applicationsPublication départementale P#900, Dépt. IRO, Université de Montréal, avril 19941994Khoukw-pubn kw-ftpIn [KBD93] and in this paper, service and protocol are specified by timed automata. In [KBD93], a method for deriving real-time protocol specifications from service specifications is proposed. In this paper, we improve and generalize this method. Improvement is made by minimizing the number of exchanged messages between protocol entities. In this case, temporal requirements on protocol are less strong than in [KBD93]. Generalization is made by considering an unreliable medium. An error-recovery capability is then necessary. yes A. Leveille and G. v. BochmannExperimental implementation of the class 0 Transport protocol(28 pages), prepared for Dendronic Decisions Ltd under contract for DOC Canada, Febr. 19821982Levekw-or A. Petrenko, N. Yevtushenko and G. v. BochmannExperiments on nondeterministic systems for the reduction relationTechnical report 932.1994Petrkw-ch kw-pubn kw-ftp -submitted to FORTE'94 (May 5, 1994) - rejected from FORTE 94 (April 1995)yes A. Vogel, G. v. Bochmann, R. Dssouli, J. Gecsei, A. Hafid and B. KerhervéOn QoS negotiation in distributed multimedia applicationspublication départementale P#891, Dépt. IRO, Université de Montréal, 1993, publication version of [Kerh 94b]1993Vogekw-citr kw-pubn kw-ftp B. Sarikaya, E. Cerny and G. v. BochmannTest derivation for the class 4 Transport protocolCERBO Informatique Inc. prepared for DOC contract OST84-00362, July 1985 (49 pages)1985Sarikw-or B. Sarikaya, J. M. Serre, M. Maksud and G. v. BochmannFormal specification of Transport protocol test casesprepared for CERBO Informatique Inc. under contract for DOC (4ER.36100-5-0149), April 19861986Sarikw-or C. Wu, G. v. Bochmann and M. YaoFairness properties for distributed systems and N-party synchronizationSubmitted to Theor. Computer Science Journal1993Wukw-ch, kw-pubn kw-subm -Submitted to Theor. Computer Science Journal - This is an extended version of P#797 [Wu 93c] C. Wu, G. v. Bochmann, O. B. Bellal and Q. GaoExecution of LOTOS specifications in a distributed environmentpublication départementale P#792, Dépt. IRO, université de Montréal, 19911991Wukw-ch, kw-pubn -submitted to Distributed Computing [Sept. 1991] -submitted to 4th European Software Engineering Conf. (Sept.13-17 1993) [January 93]yes D. A. MacKinnon and G. v. BochmannBibliographic file transfer service specificationprepared for Computer Gateways Inc. under contract for the National Library of Canada, 19831983MacKkw-or D. A. MacKinnon and G. v. BochmannBibliographic File Transfer Protocol Specificationsprepared for Computer Gateways Inc. under contract for the National Library of Canada, March 19841984MacKkw-or D. A. MacKinnon, R. J. A. Buhr and G. v. BochmannILL service specificationprepared for Computer Gateways Inc. under contract for the National Library of Canada, 19831983MacKkw-or D. Berger, G. v. Bochmann and E. CernyILL testing facility: Design Specificationprepared for CERBO Informatique Inc. under contract for the National Library of Canada, Febr. 1984 (26 pages)1984Bergkw-or D. Ramazani and G. v. BochmannA Conceptual Framework for Object Composition and Behavior Descriptionpublication départementale P#949, Dépt. IRO, Université de Montréal, novembre 19941994Ramakw-pubn kw-ftpA conceptual framework for object composition is outlined. It is based upon a simple abstract object model including the description of dynamic behavior. This model relies on ontological principles and recognizes three steps in the formation of composite objects: (1) configuration deals with the internal activity of the composite object; (2) juxtaposition determines the way the composite object is handled as a unit; and (3) emergence treats the new properties (properties which are not derivable or explainable by properties of component objects) which the composite object may acquire through the composition. The Ontological grounding renders the framework abstract and intuitive. It also allows the integration of existing approaches to composition. One of the major characteristics of this framework is a separation of concerns through the three steps of object composition . yes D. Ramazani, G. v. BOchmann and P. FlocchiniObject Naming and Object Composition1998Ramayes E. Cerny and G. v. BochmannAn experimenal protocol implementation testing system(32 pages), prepared for CERBO Informatique Inc. under contract for DOC Canada, Jan. 19831983Cernkw-or E. Cerny and G. V. BochmannILL test sequencesprepared for CERBO Informatique Inc. under contract for the National Library of Canada, 19841984Cernkw-or E. H. Htite, R. Dssouli, G. v. Bochmann and A. GhedamsiObject-oriented testing - Aspects to test1993Htitkw-citr-submitted to FORTE'93 (rejected)yes F. Khendek, G. v. Bochmann and R. GotzheinMultiple inheritance in the form of reduction-submitted to Concurrency'92 August 24-27, NY (refused) -submitted to STACS'93 (Symposium on Theoritical Aspects of Computer Sc.) Würzburg, Germany, 25-27 Feb. 93. (refused: conf. not appropriate)1992Khenkw-citryes F. W. Tompa, J. Gecsei and G. v. BochmannThe application of current database technology to videotexpublication départementale P#414, (49 pages), Dépt. IRO, Université de Montréal, prepared for the DOC of the Government of Canada, June 1981.1981Tompkw-pubn G. Gerber and G. v. BochmannA parser for an FDT languagedocument de travail P#139, Dépt. IRO, Université de Montréal, avril 19831983Gerbkw-pubn G. Luo, A. Petrenko and G. v. BochmannGenerating tests for communication software modeled by partially-specified finite state machines1992Luokw-chthis is a version of [Luo 92i] -submitted to IEEE/ACM Transactions on Networking [Nov. 92] rejected -A shorter version is submitted to FTCS'93 [Nov. 92]yes G. Luo, G. v. Bochmann and A. DasTest generation for concurrent programs modeled by communicating nondeterministic finite state machinespublication départementale P#823, Dépt. IRO, université de Montréal, 19921992Luokw-ch kw-pubn -submitted to IEEE Tr. on Software Eng., June 1992. -improved version under the same title, and the authors "G. Luo, G.v. Bochmann, A. Petrenko and A. Das," submitted to 13th Int. Conf. on Distributed Computing Systems, may 25-28, Pittsburgh, USA. Date of submission: sept.92.yes G. Luo, G. v. Bochmann, A. Das and A. GhedamsiTesting concurrent programs specified in SDLsubmitted to FORTE'92 (rejected1992Luokw-ch G. v. Bochmann and C. TropperEvaluation of Transport protocolsFinal report, prepared for CERBO Informatique Inc. under contract for DOC Canada, 200 pages, Oct. 19861986Bochkw-or G. v. Bochmann and e. al.Final Report for contract OST83-00082CERBO Informatique Inc. prepared for DOC, March 19841984Bochkw-or G. v. Bochmann and e. al.Object-oriented databases: Modelling and specification of applications in the field of network managementReport for research contract CRIM/BNR, April 19891989Bochkw-or G. v. Bochmann and e. al.The description of the specification language Mondel V1Technical Report, CRIM/BNR Project, Centre de Recherche Informatique de Montreal, April 19911991Bochkw-crim kw-or G. v. Bochmann and E. CernyILL Testing Facility, Work Plan(31 pages), prepared for CERBO Informatique Inc. under contract for the National Library of Canada, 19831983Bochkw-or G. V. Bochmann and E. CernyImplementation test plan for the BIG File Transfer Protocol(138 pages), prepared for CERBO Informatique Inc. under contract for the Nat. Library of Canada, Febr. 19831983Bochkw-or G. v. Bochmann and E. CernyProtocol assessment(40 pages), prepared under contract for Department of Communications Canada, Febr. 19821982Bochkw-or G. V. Bochmann and F. H. VogtMessage Link Protocol: functional specification(39 pages), prepared for Hahn-Meitner-Institut (Report HMI-B 284), Berlin, 19781978Bochkw-or G. v. Bochmann and J. VaucherStudy of performance parameters for the Network serviceprepared for CERBO Informatique Inc. under contract OST83-00311 for the Department of Communications, Canada, 19841984Bochkw-or G. v. Bochmann and P. Dini et al.Common concepts for object-oriented analysis and designDeliverable M.a.2, IGLOO project, Centre de Recherche Informatique de Montreal, Jan. 1994.1994Boch G. v. Bochmann and P. GoyerDatagrams as a public packet-switched data transmission service(53 pages), prepared under contract for DOC Canada, 19771977Bochkw-or G. v. Bochmann and R. GotzheinSpecialization and comparison of object behaviorssubmitted for publication1993Bochkw-citr kw-subm -this is a shortened version of Boch 92d (ref #1027) G. v. Bochmann and R. GotzheinSpecialization of object behaviors and requirement specificationspublication départementale P#853, Dépt. IRO, Université de Montréal, janvier 19931993Bochkw-citr kw-pubn kw-ftp -submitted to ECOOPS'92, refused -submitted to CONCUR'92, refused -submitted to Formal Aspects of Computing (Jan. 1993) (revised Nov. 1992).Given two behavior descriptions, the question whether one is a specialization of the other is important in many situations; for instance an implementation may be considered a specialization of the specification, or in other cases, two specification may have to be compared. Different notions of "specialization" have been developed in different contexts; for instance, a subrange type may be considered a "specialization" of its base type, objects with additional functions may be considered "specializations", a partial functions becomes more "specialized" by having it defined more completely, and a state machine with less non-determinism may be considered a "specialization" of another. This paper shows that all these different notions may be considered to be special cases of a comparison relation, called "reduction", which is based on two more basic relations which correspond to the notions of "safety" and "non-blocking". The paper defines these concepts in a formal framework and presents certain important properties of these relations. It also shows how these concepts may provide a formal framework for the systematic constructions of specifications that have certain given properties. A more general notion of "requirements specification" is also introduced which allows the separation of the maximally allowed behavior ("safety") and a minimal behavior to be implemented, where certain features are explicitly specified as optional. yes G. v. Bochmann, A. Carriere and E. CernyOperations Manual for the ILL Testing Facilityprepared for CERBO Informatique Inc. under contract for the National Library of Canada, April 19851985Bochkw-or G. v. Bochmann, A. Debaque, R. Dssouli, A. Jaoua, R. Keller, N. Rico and F. SabaDécomposition et simulation d'architectures distribuées: Phase ITechnical Report, CRIM/DMR Macroscope, Volet Architecture Plus1992Bochkw-crim kw-or kw-RDr G. v. Bochmann, A. Debaque, R. Dssouli, A. Jaoua, R. Keller, N. Rico and F. SabaDécomposition et simulation d'architectures distribuées: Phase IITechnical Report, CRIM/DMR Macroscope, Volet Architecture Plus1992Bochkw-crim kw-or kw-RDr G. v. Bochmann, A. Debaque, R. Dssouli, A. Jaoua, R. Keller, N. Rico and F. SabaDécomposition et simulation d'architectures distribuées: Phase IIITechnical Report, CRIM/DMR Macroscope, Volet Architecture Plus1992Bochkw-crim kw-or kw-RDr G. v. Bochmann, A. Debaque, R. Dssouli, A. Jaoua, R. Keller, N. Rico and F. SabaA new method for architectural modelling and dynamic analysis of information systems and business processesPublication du CRIM P#CRIM-92/12-071992Bochkw-crim kw-pubn -submitted to IEEE Int. Sym. on Requirements Engineering (summer 1992, refused) - submitted to Europ. Conf. on SE (dec. 92) G. v. Bochmann, A. Jacques and C. KawaTransport RelaysPublication départementale P#556, Dépt. IRO, Université de Montréal,19861986Bochkw-pubn G. v. Bochmann, D. Berger and E. CernyOperations manual for the ILL test facililty(30 pages), prepared for CERBO Informatique Inc. under contract for the Nat. Library of Canada, 19841984Bochkw-or G. v. Bochmann, D. Ouimet and G. NeufeldImplementation support tools for OSI Application layer protocolspublication départementale P#720, Dépt. IRO, Université de Montréal, 19901990Bochkw-pubn, kw-st -90-05 to Software Practice and Experience (Jan 91: refused/major revision required)yes G. v. Bochmann, J.-L. Landry, D. Ouimet and J.-M. SerreExperience with Semiautomatic Protocol ImplementationsPublication départementale P#665, Dépt. IRO, Université de Montréal, avril 19881988Bochkw-pubn G. v. Bochmann, L. Henckel and R. P. -ZeletinFormalized specification and analysis of a Virtual File systemReport HMI-B367 (1982), Hahn-Meitner-Institut, Berlin1982Bochkw-or G. v. Bochmann, M. Barbeau, M. Erradi, L. Lecomte, P. Mondain-Monval and N. WilliamsMondel - An object-oriented specification languageTechn. Report P#748, Dépt. IRO, Université de Montréal, 19901990Bochkw-crim, kw-pubn submitted to IEEE Tr. Knowledge and Data Engineering (Nov. 1990, by Barbeau), refused aout 91.yes G. v. Bochmann, M. Maksud, B. Sarikaya and J. M. SerreA system for testing Transport protocol implementationsDocument de travail D#179, Dépt. IRO, Université de Montréal, prepared under contract for DOC (4ER.36100-5-0149), April 19861986Bochkw-or kw-pub G. v. Bochmann, P. Gamache and B. LefebvreProspects for the use of formal and knowledge methods in the development and documentation of OSI protocolsdeliverable D1 for Research Project IBM-CRIM, Oct. 1989 (89 pages)1989Bochkw-or G. v. Bochmann, R. Chung and D. MackinnonAssessment of high-level protocol standards(294 pages), prepared for CERBO Informatique Inc. under contract for the World Bank, 19841984Bochkw-or G. v. Bochmann, S. Desmarais, P. Gamache, B. Lefebvre and J. VaucherSimulation and testing tools for the MAP MMS protocolDeliverable D5, CRIM-IBM research project "Manufacturing Message Specification (MMS)", August 19901990Bochkw-or G. v. BochmannA study of formal description techniques(63 pages), March 1981, Final Report, research contract for Department of Communications Canada.1981Bochkw-or G. v. BochmannAbstract dynamic modelling of complex systemsTechn. Report P#863, Dépt. IRO, Université de Montréal, Febr. 1993.1993Bochkw-citr kw-pubn -submitted to Int. Workshop on Software Specification and Design (March 93)yes G. v. BochmannActivity Nets: A UML profile for modeling work flow architecturesTechnical Report, University of Ottawa, Oct. 2000.2000Bochkw-or G. V. BochmannComparison of DOD and ISO/CCITT Transport layersprepared for CERBO Informatique Inc. under contract for the Department of Communications, Dec. 19841984Bochkw-or G. v. BochmannComparison of SDL and Estelle in view of finding a usable language subset and compatible toolsprepared for Siemens, Munchen, June 1987 (26 pages)1987Bochkw-or G. v. BochmannCompatibility study of packet-switched data networks(65 pages), prepared under contract for DOC Canada, 19761976Bochkw-or G. v. BochmannDas g-2 Experiment des MyonsDiplom thesis (MSc), Univerity of Munich, 19681968Bochkw-or G. v. BochmannExample of a Network service specificationprepared for CERBO Informatique Inc. under contract OST83-00311 for the Department of Communications, Canada, 19841984Bochkw-or G. v. BochmannExample of a Transport protocol specificationprepared for CERBO Informatique Inc. under contract for Department of Communications Canada, Oct. 19821982Bochkw-or G. v. BochmannExample of a Transport protocol specification (revised)Annex 1, Final Report, DOC research contract OST82-0092, March 1983. Also Doc. de travail #146, Dépt. d'IRO, Univ. de Montréal1983Bochkw-or kw-pub G. v. BochmannExample of Transport protocol specificationscontribution to ISO TC97/SC16/WG1ad hoc group on FDT, Twente-3, 1982. Originally prepared under contract for COST 11 bis (CEE)1982Bochkw-or G. v. BochmannExamples of Transport Service SpecificationsDocument de travail P#145, Dépt IRO, Université de Montréal. Also submitted to ISO and CCITT working groups on FDT1983Bochkw-pubn kw-or G. v. BochmannExamples of Transport Protocol SpecificationsDocument de travail #146, Dept. IRO, Université de Montréal. Also submitted to ISO and CCITT working groups on FDT1983Bochkw-pub kw-or G. v. BochmannFormal description techniques for protocolsFinal Report, DOC research contract CR-CS-1982-0033 (165 pages), 19821982Bochkw-or G. v. BochmannFormal description techniques for protocolsFinal report, DOC research contract OSU82-00218 (160 pages), 19831983Bochkw-or G. v. BochmannFormal Description Techniques for ProtocolsFinal report for DOC contract, Universite de Montreal, 19841984Bochkw-or G. v. BochmannFormal descriptions of Transport protocols and performance parametersprepared for CERBO Informatique Inc. under contract for the Department of Communications, Dec. 19841984Bochkw-or G. v. BochmannFormal Description Techniques for ProtocolsFinal Report, DOC University research contract, March 19851985Bochkw-or G. v. BochmannFormal description techniques: Considerations for their useprepared for Siemens AG, Muenchen, Dec. 19861986Bochkw-or G. v. BochmannFormalized methods for protocol and interface descriptions(40 pages), Final Report, research contract for DOC Canada, 19791979Bochkw-or G. v. BochmannInheritance for objects with concurrencypublication départementale P#687, Dépt. IRO, université de Montréal, 19891989Bochkw-pubn, kw-citr G. v. BochmannMethods and Tools for the Design and Validation of Protocol Specifications and Implementationspublication départementale P#596, Dépt. IRO, Université de Montréal, CERBO Informatique Inc., prepared for DOC Canada, 19861986Bochkw-pubn G. v. BochmannMethods and tools for the design and validation of OSI protocol specifications and implementationsprepared by CERBO Infromatique Inc. and PSC Inc. for the Department of Communications Canada, June 19861986Cerbkw-or G. v. BochmannMulti-step reactions of particles on nuclei at high energyPhD thesis, McGill Univerity, 19711971Bochkw-or G. v. BochmannOn the specialization of object behaviorsrévision de la publication départementale P#6871991Bochkw-ch kw-pubn June 10, 91: soumis à la conférence d'Albuquerque Principles of Programming Languages et refusé le 2 août 1991 (trop long) G. v. BochmannOpen systems interworking: Specification of protocols and interfaces(30 pages), Final Report, research contract for Department of Communications, Canada, 19801980Bochkw-or G. v. BochmannOverview of Protocols in Distributed Videotex Systemspublication départementale P#413 (46 pages), Dépt. IRO, Université de Montréal, prepared for the DOC of the Government of Canada, May 19811981Bochkw-pubn G. v. BochmannPerformance statements in Subgroup B specificationsReport for DOC research contract oST83-00082, CERBO Informatique Inc., Feb. 19841984Bochkw-or G. v. BochmannPossible database structures for future applications of videotex terminals(40 pages), prepared under contract for DOC Canada, 19791979Bochkw-or G. v. BochmannPrinciples of Protocol Conversion and Communication GatewaysPublication départementale P#624, Dépt. IRO, Université de Montréal,19871987Bochkw-pubn G. v. BochmannProtocol Implementation and TestingFinal Report, prepared for CERBO Informatique Inc. under contract for DOC (OST84-00362), July 19851985Bochkw-or G. v. BochmannProtocol implementation and testingFinal Report, prepared for CERBO Informatique Inc. under contract for DOC (4ER.36100-5-0149), April 19861986Bochkw-or G. v. BochmannStudy of standard issues for access protocols of public data networks(77 pages), prepared under contract for DOC Canada, 19771977Bochkw-or G. v. BochmannStudy on the use of the ASN1 notation and coding scheme for library application protocolsprepared for the National Library of Canada, Sept. 19851985Bochkw-or G. v. BochmannTesting of protocol implementations for library applicationsprepared under contract for the National Library of Canada, April 19851985Bochkw-or G. v. BochmannThe Frame Mode DTE interface(47 pages), prepared under contract for DOC Canada, 19771977Bochkw-or J. Barchanski, G. v. Bochmann, P. Desjardins, J. Gecsei and J.-L. LandryAccess protocol to external Videotex databasePublication départementale P#500, Dépt. IRO, Université de Montréal, février 19841984Barc kw-pubn J. Drissi and G. v. BochmannSubmodule construction for systems of I-O automataunpublished manuscript1999Driskw-submThis paper addresses the problem of designing a submodule of a given system of communicating I/O automata. The problem may be formulated mathematically by the equation (C||X)rA under the constraint IX=In, where C represents the specification of the known part of the system, called the context, A represents the specification of the whole system, X represents the specification of the submodule to be constructed, || is a composition operator, r is a conformance relation and In is the required set of inputs for X. As conformance relation, we consider the safe realization and the subtype relation. The subtype relation is a generalization of the well known criteria of trace equivalence, complete trace equivalence, quasi equivalence and reduction, while the weaker safe realization relation is implied by all those criteria. We propose two algorithms for solving the problem with respect to the safe realization and the subtype relation and we characterize the set of solutions in each case. yes J. Drissi and G. v. BochmannSubmodule construction for systems of timed I-O automataunpublished manuscript1999Driskw-submyes J. M. Serre, G. v. Bochmann, M. Maksud and B. SarikayaA parameterized specification of the OSI Transport protocol class 4University of Montreal, prepared under contract for DOC (4ER.36100-5-0149), April 19861986Serrkw-or J. M. Serre, M. Maksud, G. v. Bochmann and B. SarikayaA Parametrized Implementation of the Class 4 Transport ProtocolDocument de travail P#178, Dépt. IRO, Université de Montréal, avril 19861986Serrkw-pubn J. Vaucher and G. v. BochmannA simulation tool for formal specifications(27pages + annexes), prepared for CERBO Informatique Inc. under contract for the Department of Communications Canada, 19841984Vauckw-or K. El-Khatib, X. He and G. v. BochmannQuality of service negotiation based on device capabilities and user preferencesunpublished manuscript2000ElKhkw-submMost existing multimedia applications require the user to select certain QoS parameters. Applications are generally inelastic concerning the media types they can process and present to their users. But as the range of hardware, software, and media types is getting wider, the need for an automated system to do the selection process is increasing. In this paper, we developed a scheme for representing and storing the user preferences in a user profile. Applications may use this user profile to customize the presentation of the media content to the user's preferences. The device capabilities and capacities are also stored in a device profile. The design of a QoS aware middleware (user agent) is presented. On behalf of its user, the middleware merges the user and device profiles for all participants to make the selection of QoS parameters. The middleware will also allow the device alignment to enable the establishment of communication session. The architecture of the middleware will also ease the introduction of new services from various service providers. yes K. Petz and G. v. BochmannFormale Beschreibungsmethoden: Eine Einfuehrung und ihre Anwendung auf ein Fallbeispiel(in german)1987Petzkw-orwas submitted for publication, however, the required important revisions were never made L. Lecomte, P. Mondain-Monval and G. v. BochmannUn modèle orienté-objet pour le système de transmission NT FD-565Progress Report Document no. 8 for CRIM/BNR project, June 19901990Lecokw-report L. Mekouar, S. Fischer, A. Hafid and G. v. BochmannModeling and analysis of cooperative QoS managementInteroperable Communication Networks, Special Issue on Interop. Multimedia Networks, to be published in 2000. APPEARENTLY NEVER PUBLISHED2000Mekokw-subm M. Amalou and G. v. BochmannTest suite design for the ISDN D-Channel Q.931 signaling protocol from an Estelle specificationpublication départementale P#759, Dépt. IRO, Université de Montréal, 19911991Amalkw-chao, kw-pubn submitted to Globecom, March 1991, Arizona (refused)yes M. Barbeau and G. v. BochmannDeriving analysable Petri Nets from LOTOS specificationspublication départementale P#707, Dépt. IRO, Université de Montréal, jan. 19901990Barbkw-pubn, kw-crim M. Barbeau and G. v. BochmannFormal verification of object-oriented specifications in Mondel using a coloured Petrinet-based techniquesubmitted for publication1990Barbkw-subm kw-crim M. Barbeau and G. v. BochmannFormal semantics and formal verification of object-oriented specifications based on the colored Petri Net modelTechnical Report P#784, Dépt. IRO, Université de Montréal, 19911991Barbkw-crim, kw-subm, kw-pubn Submitted to IEEE Transactions on Software Engineering, July 1991 M. Barbeau, G. v. Bochmann and J. M. SerreObject-oriented specifications in OSI and distributed processingpublication départementale P#798, Dépt. IRO, université de Montréal, 19911991Barbkw-pubn, kw-rel-crim -submitted to Computing Systems and ISDN Journal, Nov. 91 (refused)yes M. Erradi, G. v. Bochmann and I. A. HamidType evolution in a reflective object-oriented languagepublication départementale P#827, Dépt. IRO, université de Montréal, 19921992Errakw-citr kw-pubn -submitted to Data and Knowledge Eng. -shorter version submitted to ISMA'92, Tokyo (refused).yes M. Erradi, G. v. Bochmann and R. DssouliSemantics and implementation of type dynamic modificationspublication départementale P#813, Dépt. IRO, Université de Montréal, 19921992Errakw-citr kw-pubn -submitted OOPSLA'92 (refused) under the title: Semantics and Implementation of Type Dynamic Modifications -submitted to IEEE International Symposium on Requirements Engineering Jan. 4-6, 1993 (refused) -submitted to IEE Software Eng. Journal (june 92) sous le titre: Dynamic Modification of Types for Evolving Specificationsyes M. Maksud, B. Sarikaya, J. M. Serre and G. v. BochmannTests for the class 4 Transport protocolprepared for CERBO Informaique Inc. under contract for DOC (4ER.36100-5-0149), April 19861986Makskw-or M. Mohamed-Salem, G. v. Bochmann and J. WongA Scalable architecture for QoS provision in electronic commerce applicationsubmitted for publication1999Mohakw-submSingle server machines are no longer sufficient to handle the load on today's Electronic Commerce systems. When the service becomes popular, it has to be replicated to enhance its availability, performance and reliability. Several approaches have been proposed in the literature to scale large distributed systems. Highly replicated services introduce a new set of problems, specifically server localization by clients and load balancing issues. In this paper we describe an architecture that considers the issues related to the scalability and Quality of service (QoS) provision in largely distributed and replicated servers. We look particularly at the allocation of servers to clients based on recent and continuously collected information on the capabilities of the servers. Our objective is to control the clients' admission so that each server is used at the appropriate level of load under which clients receive acceptable QoS. M. Yao, A. Petrenko and G. v. BochmannA metric approach to measuring fault coverage of software testing in respect to the FSM model1994Yaokw-ch-submitted to ISSTA'94 (Int. Symposium on Soft. Testing and Analysis), Seattle, Washington, August 1994 - REJECTEDyes M.-V. M. Salem, J. Chen and G. v. BochmannPerformance measurements of load sharing algorithms for distributed Web serversunder preparation2002Salekw-subm N. Chefai, G. v. Bochmann and N. D. GeorganasPerformance evaluation of the preemtpive bandwidth allocation multicast protocolsubmitte for publication2004chefkw-submWe present the Preemptive Bandwidth Allocation Multicast Protocol; a distributed multicast QoS-aware signaling protocol that adapts the users' bandwidth requirements to the limited resources available in the network by preempting bandwidth of less prioritized streams from existing multicast groups. We assume that each multicast group will have different multicast streams with predefined quality requirements and each stream will have a priority level assigned to it. When a join request comes to the network and there is a lack of bandwidth, the communication service will try to preempt some streams of existing multicast groups to satisfy the new request without disconnecting the basic stream of any of these multicast groups. The aim is to accommodate the maximum number of users within the network with at least their minimum requirements (e.g. the I frames of an MPEG video). We also present a performance evaluation that compares two versions of the distributed multicast preemptive approach with the traditional non-preemptive one. N. Chefai, G. v. Bochmann and N. GeorganasA Preemptive Bandwidth Allocation Protocol in Peer-to-Peer Environments2004Chefkw-subm O. B. Bellal, G. v. Bochmann, M. Dubuc and F. SabaAutomatic test result analysis for high-level specificationspublication départementale P#800, Dépt. IRO, Université de Montréal, 19921992Bellkw-chao, kw-fcar kw-pubn -submitted to FTCS (refused) -submitted to IEEE Tr. on Soft. Eng. (a different version) (refused)yes P. Dini and G. v. BochmannA framework for configuration management: architectural considerations and issuesIGLOO Deliverable, Technical Report1995Dinikw-oryes P. Dini and G. v. BochmannModelling QoS multimedia costs in distributed systemsAccepted, but not presented in IASTED International Conference on Modelling and Simulation, Pittsburg USA, April 19951995Dini P. Dini, G. v. Bochmann and I. HamidDynamic constraints specification of object interactions within distributed systemsTechnical report in Dynamic Modification of Distributed Systems Specification Using Object-Oriented techniques, Project 06044195, the Ministry of Science, Culture, and Education of Japan, Japan, March 19961996Dinikw-or P. Dini, G. v. Bochmann, T. Koch and B. KraemerAgent based management of distributed systems with variable polling frequency policiesSubmitted for publication1996Dinikw-subm kw-look submitted to: The IFIP/IEEE International Symposium on Integrated Network Management, San Diego, USA, May 12-16, 1997. P. He and G. v. BochmannA Novel Framework for Inter-area MPLS Optimal RoutingIETF, Internet Draft2006Hekw-reportyes P. Mondain-Monval and G. v. BochmannObject-oriented model for the OSI reference modelTechnical Report P#736, Dépt. IRO, Université de Montréal, 1990.1990Mondkw-pubn was submitted to PSTV '90 (refused) Q. Gao and G. v. BochmannA virtual ring algorithm for the distributed implementation of multi-rendezvouspublication départementale P#675, Dépt. IRO, Université de Montréal, 19891989Gaokw-pubn will be submitted (Gao) Q. Gao, R. Groz, G. v. Bochmann, E.-H. Htite and J. DarghamValidation of distributed rendezvous algorithms through simulationpublication départementale P#854, Dépt. IRO, Université de Montréal, janvier 19931993Gaokw-pubn Q. M. Tan, A. Petrenko and G. v. BochmannDeriving tests with fault coverage for specifications in the form of labeled transition systemssubmitted to IEEE Transactions on Software Engineering1996Tankw-ftp kw-subm kw-look kw-pubn Submitted to the journal "IEEE transactions on Software Engineering and Methodology" in May 1996A challenging issue is the derivation of finite test suites with well-defined fault coverage for conformance testing of communication systems modeled by labeled transition systems (LTSs) with respect to a particular conformance relation. It is shown in this paper that this problem can be solved by translating an LTS specification into an input/output finite state machine (FSM) for trace or failure semantics, respectively, subsequently applying existing FSM-based methods for test derivation, and finally converting the obtained tests back to the LTS formalism. It is also demonstrated that the obtained tests can be optimized or the existing FSM-based methods can be adapted for generating optimized tests by taking into account the specifics of the FSMs which are obtained from the given LTSs. R. J. A. Buhr, D. A. Mackinnon, A. R. Kaye and G. v. BochmannEvolving towards OSI in banking(87 pages), prepared for Computer Gateways Inc., under contract to DOC, Canada, 19841984Buhrkw-or R. J. A. Buhr, D. A. MakKinnon and G. v. BochmannA file transfer service for the Bibliographic Interest Groupprepared for Computer Gateways Inc. under contract for the National Library of Canada, April 1982 (180 pages)1982Buhrkw-or R. J. H. Buhr, D. A. MacKinnon and G. V. BochmannImplementation guidelines for the BCIG File Transfer Protocol(207 pages), prepared for Computer Gateways Inc. under contract for the Nat. Library of Canada, 19821982Buhrkw-or R. N. Horspool and G. v. BochmannMemory structures for videotex systemspublication départementale P#454 (91 pages), Dépt. IRO.,Université de Montréal, 19821982Hors kw-pubn S. Fujiwara and G. v. BochmannTesting non-deterministic finite state machinespublication départementale P#758, Dépt. IRO, université de Montréal, 19911991Fujikw-subm, kw-ch kw-pubn - le 14 février à Monsieur Rosenkrantz pour Journal of the ACM (returned, inappropriate topic) - submitted to IEEE Tr. Computer, 16 mai 1991 X. He, K. El-Khatib and G. b. BochmannA Communication Services Infrastructure Including Home Directory Agentssubmitted for publication2000Hekw-submMiddleware can be viewed as a reusable, expandable set of services and functions that are commonly needed by many applications to function well in a networked environment [1]. It can be considered as broad array of tools and data that help applications use networked resources and services. In this paper, the architecture of middleware which decomposes the functions of network control and management into agent-based middleware service components is presented. The middleware services include QoS management, resource allocation, as well as the user identification and address resolution. It supports personal mobility, resource reservation, QoS negotiation and application adaptation based on user preference and device capabilities. The Home Directory will be proposed as an essential middleware component, which supports the user identification and presence service. By enhancing SIP method, the middleware service of finding user location and other personalized network services can be provided based on directory and policy. Y. Benkhellat, R.Dssouli and G. v. BochmannA case study of conformance and interoperability testing: AAL 3/4 layer implementationssubmitted for publication1996Benkkw-look kw-subm kw-pubn submitted to ICNP'96, refusedThis paper deals with a case study of conformance testing and interoperability testing of ATM Adaptation Layer type3/4 (AAL3/4) implementations. A set of conformance test purposes for AAL 3/4 sublayers is developped. The implementation of these test purposes is analysed using the transverse conformance test method and the interoperability test method. This analysis leads to the identification of some general reasons that prevent the implementation of a given test purpose. As a complement for the conformance testing study, some criteria are given for interoperability between AAL 3/4 implementations. Keywords: SMDS, ATM, AAL 3/4, testing, interoperability. yes Z. P. Tao, G. v. Bochmann and R. DssouliA solution for a special case of the submodule construction problem and its application to protocol conversion1993Taokw-citr-to be submitted to the sixth Int. Conf. on FDTs (FORTE'93) Boston, Massachusetts, 26-29 Oct.93 [Mai 93] was not submitted finally. Z. P. Tao, G. v. Bochmann and R. DssouliFormal methods for protocol conversion: principles, current practice and future directions1993Taokw-citr-submitted to IEEE/ACM Transactions on Networking - rejected A. J. Ball, G. v. Bochmann, B. Botten, J. Coyne, J. Gecsei, J. L. Houle, D. Leahy, D. Lemoign and F. TompaFirst Montreal Workshop on Videotex TechnologyDocument de travail P#112, Dépt. IRO, Université de Montréal, juin 19801980Ballkw-pubn G. v. BochmannHigh-level modular hardware design and interfacepublication départementale P#393, Dépt. IRO, Université de Montréal, décembre 19801980Boch kw-pubn G. v. BochmannSynchronization in distributed systemspublication départementale P#259, Dépt. IRO, Université de Montréal, juillet 19771977Boch kw-pubn G. v. BochmannTowards an understanding of distributed and parallel systemspublication départementale P#317, Dépt. IRO, Université de Montréal, mars 19791979Boch kw-pubn J. Gecsei and G. v. BochmannDatabase structures for videotex applicationspublication départementale P#348, Dépt. IRO, Université de Montréal, novembre 19791979bGecs kw-pubn P. Merlin and G. v. BochmannOn the construction of communication protocols and module specificationspublication départementale P#352, Dépt. IRO, Université de Montréal, janvier 19801980Merl kw-pubn