The Experts below are selected from a list of 3774 Experts worldwide ranked by ideXlab platform

Tevfik Bultan - One of the best experts on this subject based on the ideXlab platform.

  • Realizability of Choreographies using Process Algebra Encodings
    IEEE Transactions on Services Computing, 2012
    Co-Authors: Gwen Salaün, Tevfik Bultan, Nima Roohi
    Abstract:

    Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with each other via exchanging messages. Modeling and analysis of interactions among services is a crucial problem in this domain. Interactions among a set of services that participate in a service composition can be described from a global point of view as a choreography. Choreographies can be specified using specification languages such as Web Services Choreography Description Language (WS-CDL) and visualized using graphical formalisms such as Collaboration Diagrams. In this article, we present an encoding of Collaboration Diagrams into the LOTOS process algebra for choreography analysis. This encoding allows us to (i) check the temporal properties of choreographies using a LOTOS verification tool set called the Construction and Analysis of Distributed Processes (CADP) toolbox, (ii) check the realizability of choreographies for both synchronous communication and bounded asynchronous communication, and (iii) automate the peer generation process. Realizability indicates whether peers can be generated from a given choreography specification in such a way that the interactions of the generated peers exactly match the choreography specification. If a Collaboration Diagram is unrealizable, our approach extends the peer generation process by adding extra communication that guarantees that the peers behave according to the choreography specification.

  • realizability of choreographies using process algebra encodings
    Integrated Formal Methods, 2009
    Co-Authors: Gwen Salaün, Tevfik Bultan
    Abstract:

    Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange of messages. Interactions among a set of services involved in a new system are described from a global point of view using choreography specification languages such as WS-CDL or Collaboration Diagrams. In this paper, we present an encoding of Collaboration Diagrams into the LOTOS process algebra. This encoding allows to (i) check choreography specification using the LOTOS verification toolbox (CADP), (ii) check realizability of Collaboration Diagrams for both synchronous communication and bounded asynchronous communication, and (iii) automate service peer generation. Realizability indicates whether peers can be generated from a choreography such that they will behave exactly as formalized in its specification. If the Collaboration Diagram is unrealizable, our approach extends the peer generation process by adding some communications that make the peers respect the choreography specification.

  • specification of realizable service conversations using Collaboration Diagrams
    Service-Oriented Computing and Applications, 2007
    Co-Authors: Tevfik Bultan, Xiang Fu
    Abstract:

    Specification, modeling and analysis of interactions among peers that communicate via messages are becoming increasingly important due to the emergence of service oriented computing. Collaboration Diagrams provide a convenient visual model for specifying such interactions. An interaction among a set of peers can be characterized as a conversation, the global sequence of messages exchanged among the peers, listed in the order they are sent. A Collaboration Diagram can be used to specify the set of allowable conversations among the peers participating to a composite web service. Specification of interactions from such a global perspective leads to the realizability problem: Is it possible to construct a set of peers that generate exactly the specified conversations? In this paper we investigate the realizability of conversations specified by Collaboration Diagrams. We formalize the realizability problem by modeling peers as concurrently executing finite state machines and we give sufficient realizability conditions for a class of Collaboration Diagrams.

Gwen Salaün - One of the best experts on this subject based on the ideXlab platform.

  • Realizability of Choreographies using Process Algebra Encodings
    IEEE Transactions on Services Computing, 2012
    Co-Authors: Gwen Salaün, Tevfik Bultan, Nima Roohi
    Abstract:

    Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with each other via exchanging messages. Modeling and analysis of interactions among services is a crucial problem in this domain. Interactions among a set of services that participate in a service composition can be described from a global point of view as a choreography. Choreographies can be specified using specification languages such as Web Services Choreography Description Language (WS-CDL) and visualized using graphical formalisms such as Collaboration Diagrams. In this article, we present an encoding of Collaboration Diagrams into the LOTOS process algebra for choreography analysis. This encoding allows us to (i) check the temporal properties of choreographies using a LOTOS verification tool set called the Construction and Analysis of Distributed Processes (CADP) toolbox, (ii) check the realizability of choreographies for both synchronous communication and bounded asynchronous communication, and (iii) automate the peer generation process. Realizability indicates whether peers can be generated from a given choreography specification in such a way that the interactions of the generated peers exactly match the choreography specification. If a Collaboration Diagram is unrealizable, our approach extends the peer generation process by adding extra communication that guarantees that the peers behave according to the choreography specification.

  • realizability of choreographies using process algebra encodings
    Integrated Formal Methods, 2009
    Co-Authors: Gwen Salaün, Tevfik Bultan
    Abstract:

    Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange of messages. Interactions among a set of services involved in a new system are described from a global point of view using choreography specification languages such as WS-CDL or Collaboration Diagrams. In this paper, we present an encoding of Collaboration Diagrams into the LOTOS process algebra. This encoding allows to (i) check choreography specification using the LOTOS verification toolbox (CADP), (ii) check realizability of Collaboration Diagrams for both synchronous communication and bounded asynchronous communication, and (iii) automate service peer generation. Realizability indicates whether peers can be generated from a choreography such that they will behave exactly as formalized in its specification. If the Collaboration Diagram is unrealizable, our approach extends the peer generation process by adding some communications that make the peers respect the choreography specification.

Nima Roohi - One of the best experts on this subject based on the ideXlab platform.

  • Realizability of Choreographies using Process Algebra Encodings
    IEEE Transactions on Services Computing, 2012
    Co-Authors: Gwen Salaün, Tevfik Bultan, Nima Roohi
    Abstract:

    Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with each other via exchanging messages. Modeling and analysis of interactions among services is a crucial problem in this domain. Interactions among a set of services that participate in a service composition can be described from a global point of view as a choreography. Choreographies can be specified using specification languages such as Web Services Choreography Description Language (WS-CDL) and visualized using graphical formalisms such as Collaboration Diagrams. In this article, we present an encoding of Collaboration Diagrams into the LOTOS process algebra for choreography analysis. This encoding allows us to (i) check the temporal properties of choreographies using a LOTOS verification tool set called the Construction and Analysis of Distributed Processes (CADP) toolbox, (ii) check the realizability of choreographies for both synchronous communication and bounded asynchronous communication, and (iii) automate the peer generation process. Realizability indicates whether peers can be generated from a given choreography specification in such a way that the interactions of the generated peers exactly match the choreography specification. If a Collaboration Diagram is unrealizable, our approach extends the peer generation process by adding extra communication that guarantees that the peers behave according to the choreography specification.

Muhammad Ali Babar - One of the best experts on this subject based on the ideXlab platform.

  • An Automated Tool for Generating UML Models from Natural Language Requirements
    2009 IEEE ACM International Conference on Automated Software Engineering, 2009
    Co-Authors: Deva Kumar Deeptimahanti, Muhammad Ali Babar
    Abstract:

    This paper describes a domain independent tool, named, UML Model Generator from Analysis of Requirements (UMGAR), which generates UML models like the Use-case Diagram, Analysis class model, Collaboration Diagram and Design class model from natural language requirements using efficient Natural Language Processing (NLP) tools. UMGAR implements a set of syntactic reconstruction rules to process complex requirements into simple requirements. UMGAR also provides a generic XMI parser to generate XMI files for visualizing the generated models in any UML modeling tool. With respect to the existing tools in this area, UMGAR provides more comprehensive support for generating models with proper relationships, which can be used for large requirement documents.

Jan Van Moll - One of the best experts on this subject based on the ideXlab platform.

  • the effect of modularity representation and presentation medium on the understandability of business process models in bpmn
    Business Process Management, 2016
    Co-Authors: Oktay Turetken, Ahmet Dikici, Tessa Rompen, Irene Vanderfeesten, Jan Van Moll
    Abstract:

    Many factors influence the creation of understandable business process models for an appropriate audience. Understandability of process models becomes critical particularly when a process is complex and its model is large in structure. Using modularization to represent such models hierarchically (e.g. using sub-processes) is considered to contribute to the understandability of these models. To investigate this assumption, we conducted an experiment that involved 2 large-scale real-life business process models that were modeled using BPMN v2.0 (Business Process Model and Notation). Each process was modeled in 3 modularity forms: fully-flattened, flattened where activities are clustered using BPMN groups, and modularized using separately viewed BPMN sub-processes. The objective is to investigate if and how different forms of modularity representation in BPMN Collaboration Diagrams influence the understandability of process models. In addition to the forms of modularity representation, we also looked into the presentation medium (paper vs. computer) as a factor that potentially influences model comprehension. Sixty business practitioners from a large organization participated in the experiment. The results of our experiment indicate that for business practitioners, to optimally understand a BPMN model in the form of a Collaboration Diagram, it is best to present the model in a ‘fully-flattened’ fashion (without using collapsed sub-processes in BPMN) in the ‘paper’ format.