Comparing process models in the BPMN 2.0 XML format
Comparing business process models is one of the most significant challenges for business and systems analysts. The complexity of the problem is explained by the fact there is a lack of tools that can be used for comparing business process models. Also there is no universally accepted standard for modeling them. EPC, YAWL, BPEL, XPDL and BPMN are only a small fraction of available notations that have found acceptance among developers. Every process modeling standard has its advantages and disadvantages, but almost all of them comprise an XML schema, which defines process serialization rules. Due to the fact that XML naturally represents hierarchical and reference structure of business process models, these models can be compared using their XML representations. In this paper we propose a generic comparison approach, which is applicable to XML representations of business process models. Using this approach we have developed a tool, which currently supports BPMN 2.0  (one of the most popular business process modeling notations), but can be extended to support other business process modeling standards.
This paper suggests an approach, which enables automatization of computer business game automaton model construction. The processes of business game design and conduction occur within the Competence-based Business Game Studio source environment. This fact provides the universality of the domain. Separation of information system into operating and automaton models causes control logic to be concentrated within the automaton model. Due to this fact the control object (operating model) is to have unsophisticated behavior: accepting commands from the automaton and then executing stated commands. This paper verifies the need for automaton model, provides analysis of requirements and describes the design of corresponding program module (interactive visual model editor) of the Competence-based Business Game Studio source environment. This module is used to construct and edit business process models interactively during the stage of business game design.
The books contains papers presented at the BPM Demo sessions 2013, co-located with 11th International Conference on Business Process Management 2013.
This volume contains a set of dedicated scientific contributions to the 11th International Conference on Perspectives in Business Informatics Research. The peer-reviewed and tentatively selected papers cover a broad scope of modern research in Business Informatics, and include new results in such domains as: Knowledge Management and Semantic Web, Business and information systems development, Business, people and systems interoperability and Business intelligence.
In 2012 the conference is hosted by National Research University Higher School of Economics (NRU HSE) in Nizhny Novgorod. Our university is Russia’s leader in the field of scientific research conducted at the junction of Management, Economics and Governance of IT. In particular, NRU HSE is the originator and the promoter of Business Informatics in Russia. Therefore NRU HSE pays particular attention to sustainable international cooperation and leverages scientific research in that area.
We strongly believe that materials presented will contribute to further advances in Business Informatics and will foster intensive scientific cooperation between researchers.
BPM 2013 was the 11th conference in a series that provides a prestigious forum for researchers and practitioners in the field of business process management (BPM). The conference was organized by Tsinghua University, China, and took place during August 26–30, 2013, in Beijing, China. Compared to previous editions of BPM, this year we noted a lower focus by authors on topics like process modeling, while we also observed a considerable growth of submissions regarding areas like process mining, conformance/compliance checking, and process model matching. The integrated consideration of processes and data remains popular, and novel viewpoints focus, among others, on data completeness in business processes, the modeling and runtime support of event streaming in business processes, and business process architectures.
This article describes the new Stata command xml_tab, which outputs the results of estimation commands and Stata matrices directly into tables in XML format. The XML files can be opened with Microsoft Excel or OpenOffice Calc, or they can be linked with Microsoft Word files. By using XML, xml_tab allows Stata users to apply a rich set of formatting options to the elements of output tables.
The research reported in this paper aims at introducing principally new approach to the design of traceability applications for supply network by the means of semantically consistent and conceptually aligned abstractions of business-processes, data, and software architecture. To derive needed abstractions, proposed approach uses the general principles of enterprise ontology for meta-description of business objects and processes, conceptual modeling techniques for data representation in a universal format, and multi-agent solution adjusted with an ontological view on data model and business processes of organizations. The method for data modeling consistent with the business view on supply chain activities is introduced and exemplified. Agent-based approach to tracing data analysis and particular model of intellectual agents are presented.
Recognizing the challenges that a contemporary university faces, an inter-faculty group of researchers performed the analysis of organizational and management approach in one of Russia’s universities and modeled existing business processes. The university is a multi-campus organization and to manage it efficiently it is necessary to make transition from the traditional management model to a more flexible - network structure. This paper focuses on development of the Goal Tree and designing of AS-IS model. The researchers applied IBM Business Modeler which allows to execute modeling and simulation of business processes. The practical value of the proposed approach is that it enables the university management to improve performance and effectiveness.
In order to support management functions in dynamically changing corporate enterprises, adequate information systems need to be built, automating desirable adaptation of inter- and intra- organizational business processes. This paper therefore introduces a new approach to the design of multi-agent information systems meant for planning, discovering, monitoring deviations, and optimizing business processes. Expected qualitative breakthrough in the system’s capacity is based on the matching of its constructional and behavioral perspective with the ontological model of supported enterprise. Besides, conformity between organizational and information systems is supplemented by their conceptual alignment in the description of states and processes. The method of multi-agent framework construction and its application for traceability in supply chains are presented in this paper.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables