PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 12

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  graph grammars
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Automatic bridge between BPMN models and UML activity diagrams based on graph transformation
Rahmoune Yasmina, Chaoui Allaoua
Computer Science
|
2022
|
T. 23 (3)
411--445
EN
Model-driven engineering (MDE) provides the available tools, concepts, and languages for creating and transforming models. One of the most important successes of MDE is model transformation; it permits the transformion of models that are used by one community to equivalent models that can be used by another one. Moreover, each community of developers has its own tools for verification, testing, and test-case generation. Hence, a developer of one community who moves to another community needs a transformation process from the second community to his/her own community and vice versa. Therefore, the target community can benefit from the expertise of the source one, and the developers do not begin from zero. In this context, we propose an automatic transformation in this paper for creating a bridge between the BPMN and UML communities. We propose an approach and a visual tool for the automatic transformation of BPMN models to UML activity diagrams (UML-AD). The proposed approach is based on meta-modeling and graph transformation and uses the AToM3 tool. Indeed, we were inspired by the OMG meta-models of BPMN and UML-AD and implemented versions of both meta-models using AToM3 . This latter one allows for the automatic generation of a visual-modeling tool for each proposed meta-model. Based on these two meta-models, we propose a graph grammar that is composed of 58 rules that perform the transformation process. The proposed approach is illustrated through three case studies.
2
Content available remote Designing and Learning Substitutable Plane Graph Grammars
Eyraud R., Oates T., Janodet J.-C., Papadopoulos F.
Fundamenta Informaticae
|
2016
|
Vol. 146, nr 4
403--430
EN
Though graph grammars have been widely investigated for 40 years, few learning results exist for them. The main reasons come from complexity issues that are inherent when graphs, and a fortiori graph grammars, are considered. The picture is however different if one considers drawings of graphs, rather than the graphs themselves. For instance, it has recently been proved that the isomorphism and pattern searching problems could be solved in polynomial time for plane graphs, that is, planar embeddings of planar graphs. In this paper, we introduce the Plane Graph Grammars (PGG) and detail how they differ to usual graph grammar formalism’s while at the same time they share important properties with string context-free grammars. In particular, though exponential in the general case, we provide an appropriate restriction on languages that allows the parsing of a graph with a given PGG in polynomial time. We demonstrate that PGG are well-shaped for learning: we show how recent results on string grammars can be extended to PGG by providing a learning algorithm that identifies in the limit the class of substitutable plane graph languages. Our algorithm runs in polynomial time assuming the same restriction used for polynomial parsing, and the amount of data needed for convergence is comparable to the one required in the case of strings.
3
Content available remote Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
Mayr E. W., Weihmann J.
Fundamenta Informaticae
|
2015
|
Vol. 137, nr 1
61--86
EN
We investigate several computational problems of communication-free Petri nets, and develop very efficient (mostly linear time) algorithms for different variations of the boundedness and liveness problems of cf-PNs. For several more complex notions of boundedness, as well as for the covering problem, we show NP-completeness. In the last part, we use our results for cf-PNs to give linear time algorithms for related problems of context-free (commutative) grammars, and, in turn, use known results for such grammars to give a coNEXPTIME-upper bound for the equivalence problem of cf-PNs.
4
Content available remote Business process- and graph grammar-based approach to ERP system modelling
Flasiński M., Jurek J.
Journal of Applied Computer Science
|
2012
|
Vol. 20, nr 1
7-21
EN
Methods of ERP (Enterprise Resource Planning) systems modelling are presented in the paper. The modelling is necessary to adapt an ERP system to a company in such a way, that it fully supports a management at the operational level, i.e. it supports the business processes in the best possible way. The choice of methods (business process and graph grammarbased) described in the paper is based on the authors' experiences in several dozen of implementation projects, realized in large Polish enterprises. The methods can be used to select the best ERP system for a company, to design its implementation, and to customize the system accordingly to the requirements of a company.
5
Content available remote Priority levels and heuristic rules in the structural recognition of mathematical formulae
Sroczyński S.
Theoretical and Applied Informatics
|
2010
|
Vol. 22, No. 4
273-289
EN
In the paper an algorithm for an automatic recognition of the structure of mathematical formulae saved in a graphical form has been presented. The described method is based on 2D graph grammars, although the other approaches were mentioned. Moreover, the heuristic rules used during the simplification of the initial data structure, the example graph grammar rules, the priority system used within the production of the rules, and the test application that allows the step-by-step analysis of an entire recognition process, were discussed. The solution introduced in the paper allows to analyse web pages and the other documents containing a math notation saved in graphics formats. It will also help in the development of systems indexing, searching and translating such documents to formats used by visually impaired people.
PL
W pracy przedstawiono algorytm automatycznego rozpoznawania struktury wzorów matematycznych zapisanych w postaci graficznej, wykorzystujący gramatykę grafową. Opisane zostały reguły heurystyczne stosowane w celu uproszczenia inicjalnej struktury danych, przykładowe reguły gramatyki oraz aplikacja testowa, pozwalająca na analizę procesu rozpoznawania w trybie krokowym. Szczególną uwagę poświęcono zagadnieniom związanym z systemem priorytetów i reguł heurystycznych pozwalających na efektywne przetwarzanie grafu opisującego rozpoznawane wyrażenie za pomocą reguł zdefiniowanej gramatyki. Zastosowanie opisanego rozwiązania do przetwarzania stron internetowych oraz innych dokumentów zawierających wzory matematyczne osadzone w postaci graficznej pozwoli na indeksowanie, katalogowanie i wyszukiwanie ich treści, a także translację do formatów używanych przez osoby niepełnosprawne wzrokowo.
6
Content available remote Inferring graph grammars by detecting overlap in frequent subgraphs
Kukluk J. P., Holder L. B., Cook D. J.
International Journal of Applied Mathematics and Computer Science
|
2008
|
Vol. 18, no 2
241-250
EN
In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. We can also infer a hierarchy of productions by compressing portions of a graph described by a production and then inferring new productions on the compressed graph. We validate the approach in experiments where we generate graphs from known grammars and measure how well the approach infers the original grammar from the generated graph. We show graph grammars found in biological molecules, biological networks, and analyze learning curves of the algorithm.
7
On the use of graph grammars for business process optimization
Flasiński M.
Foundations of Control and Management Sciences
|
2008
|
No. 9
29-37
EN
The analysis of IT applications development in small and medium-sized enterprises reveals significant difficulties with selection and adjustment of the available IT solutions to real and still changing requirements of management support, particularly in the firms with the non-stream organization of production and services. Those difficulties justify the necessity to seek for a new approach to IT applications development in those organizations. In the proposed solution IT is a supporting tool of organizational learning and optimisation of enterprise functioning. Optimisation of the quality, productivity and costs of the processes that contribute to reach immanent goals of the enterprise functioning, shapes the model of information management and IT application development.
8
Content available remote On Applying Model-Driven Engineering in Conceptual Design
Papiernik K., Grabska E., Borkowski A.
Machine Dynamics Problems
|
2007
|
Vol. 31, No. 3
58-65
EN
It is shown how decision support tools in the domain of conceptual design in architecture can be efficiently developed within the paradigm of Model-Driven Engineering (MDE). A prototype software is presented that allows the user to specify functional requirements for the designed building and then to map them onto certain subspaces. Hierarchical graphs and graph grammars serve as a knowledge representation tool. The final result is a 3D-view of the designed object coded automatically in the VRML and available on the screen. Hiding technicalities behind intuitive GUI we are able to win the interest of the designer and to convince him or her that the proposed tool increases productivity and creativity in the conceptual design phase.
9
Content available remote On computer-aided publication design
Grelowska K., Grabska E., Łachwa A.
Machine Graphics and Vision
|
2004
|
Vol. 13, No. 1/2
167-179
EN
The article presents a method of computer aided publication design. We consider text as a structure of mark displayed on a certain background, without paying attention to its meaning. Our approach is illustrated by a computer program generating layouts of covers with help of graph grammars.
10
Content available remote Natural languages and graphs
Skowron M.
Image Processing & Communications
|
2003
|
Vol. 9, no 3-4
27-43
EN
This paper introduces the Graphs Description Language. This language is similar to the natural one and makes it possible to communicate between a system and a user in the form of questions and answers. The Graphs Description Language can be applied to the interactive graph grammar - the grammar with a user's demands controlled derivation.
11
The synergy in cooperating grammar systems
Staniszkis M.
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Prace Informatyczne
|
2000
|
z. 10
165-179
EN
The study of multiagent distributed systems through the optics of the theory of formal grammars and languages is presented. Models based on NLC and BNLC graph grammars are mainly considered. The basic intuition of a grammar model of distributed systems follows the blackboard model for problem solving and is the following: component grammars forming the distributed system execute rewritings on a shared sentential form/graph. The order of participation on rewriting, the start and stop conditions of participation are determined by the strategies for the cooperation of components. The strategies of cooperation considered include the ones based on chains or linear, partial and arbitrary orders control relations. The introduced transformations on graphs representing the control permit one to obtain results regarding the synergy created by the cooperation.
12
Content available remote Parsing of random graphs for scene analysis
Skomorowski M.
Machine Graphics and Vision
|
1998
|
Vol. 7, No. 1/2
313-323
EN
Further results of research into parsing of random graphs for recognition of distored scenes ([9, 11]) are presented. An efficient top-down parallel parsing algorithm for analysis of distored scenes is proposed. The proposed approach involves parsing of graph grammars. To take into acount all variations of a distored scene under study, a probabilistic description of the scene is needed. The random graph approach ([9, 11]) is proposed here for such a description.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.