550 research outputs found
As naturalistic as it gets: Subtitles in the English classroom in Norway
Get PDFCopyright © 2015 Vulchanova, Aurstad, Kvitnes and Eshuis. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these term
Extracting Reusable Fragments From Data-Centric Process Variants
Get PDFData-centric process management supports knowledge workers in performing knowledge-intensive processes in a flexible way. An essential ingredient of data-centric process management are process templates that are manually modified for a specific case to suit the context of that case. Modifying templates results in many different yet related process variants. However, manually modifying a template is time consuming and may lead to errors. This paper defines an approach to extract reusable fragments from data-centric process variants. The set of extracted fragments is minimal. By composing the fragments not only the input variants but many more process variants can be derived. We have implemented the approach in a prototype and evaluated it on several business processes. Using the fragment extraction approach, complex data-centric process variants can be designed more efficiently and their quality can improve, since well-known modifications are applied
Symbolic Model Checking of UML Activity Diagrams
No full textTwo translations from activity diagrams to the input language of NuSMV, a symbolic model verifier, are presented. Both translations map an activity diagram into a finite state machine and are inspired by existing statechart semantics. The requirements-level translation defines state machines that can be efficiently verified, but are a bit unrealistic since they assume the perfect synchrony hypothesis. The implementation-level translation defines state machines that cannot be verified so efficiently, but that are more realistic since they do not use the perfect synchrony hypothesis. To justify the use of the requirements-level translation, we show that for a large class of activity diagrams and certain properties, both translations are equivalent: regardless of which translation is used, the outcome of model checking is the same. Moreover, for linear stutteringclosed properties, the implementation-level translation is equivalent to a slightly modified version of the requirements-level translation. We use the two translations to model check data integrity constraints for an activity diagram and a set of class diagrams that specify the data manipulated in the activities. Both translations have been implemented in two tools. We discuss our experiences in applying both translations to model check some large example activity diagrams
Statechartable Petri nets
Get PDFPetri nets and statecharts can model concurrent systems in a succinct way. While translations from statecharts to Petri nets exist, a well-defined translation from Petri nets to statecharts is lacking. Such a translation should map an input net to a corresponding statechart, having a structure and behaviour similar to that of the input net. Since statecharts can only model a restricted form of concurrency, not every Petri net has a corresponding statechart. We identify a class of Petri nets, called statechartable nets, that can be translated to corresponding statecharts. Statechartable Petri nets are structurally defined using the novel notion of an area. We also define a structural translation that maps each statechartable Petri net to a corresponding statechart. The translation is proven sound and complete for statechartable Petri nets
Modeling decision-intensive processes with declarative business artifacts
No full text\u3cp\u3eModern business processes often need to support knowledge workers that are responsible for making decisions about real-world business entities such as orders and quotes. Such decision-intensive processes are driven by data and require flexibility in their execution. Business artifacts model data and process aspects of business entities in a holistic way and are therefore well-suited to model data-driven processes. Declarative process models support flexible process executions. Therefore, declarative business artifacts are a promising ingredient to support decision-intensive processes. However, there are several challenges that need to be overcome in order to support real-world decision-intensive processes with declarative business artifacts. This position paper discusses key challenges and discusses preliminary solutions to overcome them and turn declarative business artifacts into a mature modeling language for decision-intensive processes.\u3c/p\u3
Feature-oriented composition of declarative artifact-centric process models
No full text\u3cp\u3eDeclarative business process models that are centered around artifacts, which represent key business entities, have proven useful to specify knowledge-intensive processes. Currently, declarative artifact-centric process models need to be designed from scratch, even though existing model fragments could be reused to gain efficiency in designing and maintaining such models. To address this problem, this paper proposes an approach for composing model fragments, abstracted into features, into fully specified declarative artifact-centric process models. We use Guard-Stage-Milestone (GSM) schemas as modeling language and let each feature denote a GSM schema fragment. The approach supports feature composition at different levels of granularity. Correctness criteria are defined that guarantee that valid GSM schemas are derived. The approach is evaluated by applying it to an industrial process. Using the approach, declarative artifact-centric process models can be composed from existing model fragments in an efficient and correct way.\u3c/p\u3
- …
