Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey

Courcelle, Bruno

doi:10.1007/978-3-540-30550-7_1

Cited by 5 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also mention that our model in [10] for BPs has strong connections with that of Context Free Graph Grammars (CFGGs) [60,52,26]. CFGGs, similarly to "classic" context free (string) grammars (CFGs), CFGGs are composed of non-terminals, terminals, and derivation rules.…”

Section: Control Flow Modelsmentioning

confidence: 99%

A quest for beauty and wealth (or, business processes for database researchers)

Deutch

Milo

2011

Proceedings of the Thirtieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems

View full text Add to dashboard Cite

While classic data management focuses on the data itself, research on Business Processes considers also the context in which this data is generated and manipulated, namely the processes, the users, and the goals that this data serves. This allows the analysts a better perspective of the organizational needs centered around the data. As such, this research is of fundamental importance.Much of the success of database systems in the last decade is due to the beauty and elegance of the relational model and its declarative query languages, combined with a rich spectrum of underlying evaluation and optimization techniques, and efficient implementations. This, in turn, has lead to an economic wealth for both the users and vendors of database systems. Similar beauty and wealth are sought for in the context of Business Processes. Much like the case for traditional database research, elegant modeling and rich underlying technology are likely to bring economic wealth for the Business Process owners and their users; both can benefit from easy formulation and analysis of the processes. While there have been many important advances in this research in recent years, there is still much to be desired: specifically, there have been many works that focus on the processes behavior (flow), and many that focus on its data , but only very few works have dealt with both. We will discuss here the important advantages of a holistic flow-and-data framework for Business Processes, the progress towards such a framework, and highlight the current gaps and research directions.

show abstract

Section: Control Flow Modelsmentioning

confidence: 99%

A quest for beauty and wealth (or, business processes for database researchers)

Deutch

Milo

2011

Proceedings of the Thirtieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems

View full text Add to dashboard Cite

show abstract

“…Models are described and built with the help of a visual modeling language, which is a fixed set of graphical symbols and rules for constructing visual models by using these symbols [1]. Visual languages can be represented as various types of graphs, including oriented graphs [2], hypergraphs [3], hi-graphs [4], meta-graphs [5] and P-graphs [6]. Previously, a new graph model, called HP-graph, was proposed as a formalism for representing visual languages [7].…”

Section: Introductionmentioning

confidence: 99%

A Multilayer Approach to Subgraph Matching in HP-graphs

Suvorov¹,

Lyadova²

2021

Proceedings of ISP RAS

View full text Add to dashboard Cite

Visual modeling is widely used nowadays, but the existing modeling platforms cannot meet all the user requirements. Visual languages are usually based on graph models, but the graph types used have significant restrictions. A new graph model, called HP-graph, whose main element is a set of poles, the subsets of which are combined into vertices and edges, has been previously presented to solve the problem of insufficient expressiveness of the existing graph models. Transformations and many other operations on visual models face a problem of subgraph matching, which slows down their execution. A multilayer approach to subgraph matching can be a solution for this problem if a modeling system is based on the HP-graph. In this case, the search is started on the higher level of the graph model, where vertices and hyperedges are compared without revealing their structures, and only when a candidate is found, it moves to the level of poles, where the comparison of the decomposed structures is performed. The description of the idea of the multilayer approach is given. A backtracking algorithm based on this approach is presented. The Ullmann algorithm and VF2 are adapted to this approach and are analyzed for complexity. The proposed approach incrementally decreases the search field of the backtracking algorithm and helps to decrease its overall complexity. The paper proves that the existing subgraph matching algorithms except ones that modify a graph pattern can be successfully adapted to the proposed approach.

show abstract

Verification of graph grammars using a logical approach

Costa

Ribeiro

2012

Science of Computer Programming

View full text Add to dashboard Cite

Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey

Cited by 5 publications

References 7 publications

A quest for beauty and wealth (or, business processes for database researchers)

A quest for beauty and wealth (or, business processes for database researchers)

A Multilayer Approach to Subgraph Matching in HP-graphs

Verification of graph grammars using a logical approach

Contact Info

Product

Resources

About