Results 11 to 20 of about 2,591 (261)
Higher-order port-graph rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The biologically inspired framework of port-graphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in this paper we
Maribel Fernández, Sébastien Maulat
doaj +1 more source
Graph Creation, Visualisation and Transformation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface ...
Maribel Fernández, Olivier Namet
doaj +1 more source
A Visual Analytics Approach to Compare Propagation Models in Social Networks [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Numerous propagation models describing social influence in social networks can be found in the literature. This makes the choice of an appropriate model in a given situation difficult. Selecting the most relevant model requires the ability to objectively
Jason Vallet +3 more
doaj +1 more source
Needed Computations Shortcutting Needed Steps [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code is another constructor-based graph rewriting system.
Sergio Antoy +2 more
doaj +1 more source
Order Reconfiguration under Width Constraints
Journal of Graph Algorithms and Applications, 2023 In this work, we consider the following order reconfiguration problem: Given a graph $G$ together with linear orders $\omega$ and $\omega'$ of the vertices of $G$, can one transform $\omega$ into $\omega'$ by a sequence of swaps of adjacent elements in ...
Emmanuel Arrighi +3 more
doaj +1 more source
Attributed Hierarchical Port Graphs and Applications [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We present attributed hierarchical port graphs (AHP) as an extension of port graphs that aims at facilitating the design of modular port graph models for complex systems.
Nneka Chinelo Ene +2 more
doaj +1 more source
Non-simplifying Graph Rewriting Termination [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work).
Bruno Guillaume, Guillaume Bonfante
doaj +1 more source
Conditional Bisimilarity for Reactive Systems [PDF]
Logical Methods in Computer Science, 2022 Reactive systems \`a la Leifer and Milner, an abstract categorical framework for rewriting, provide a suitable framework for deriving bisimulation congruences.
Mathias Hülsbusch +3 more
doaj +1 more source
Strategic programming on graph rewriting systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We describe a strategy language to control the application of graph rewriting rules, and show how this language can be used to write high-level declarative programs in several application areas.
Maribel Fernández, Olivier Namet
doaj +1 more source
Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Sesqui-pushout (SqPO) rewriting is a variant of transformations of graph-like and other types of structures that fit into the framework of adhesive categories where deletion in unknown context may be implemented.
Nicolas Behr
doaj +1 more source