Milner introduced the action calculus framework as a graphical framework for describing many models of interactive behaviour. We describe a specification tool for action graphs, which allows the user to naturally switch between between the syntactic and graphical presentations. The implementation includes a type-checking algorithm on reduction rules, which uses a decision procedure for a variant of word unification, and a general matching algorithm for identifying redexes in a graph. Introduction Milner introduced the action calculus framework as a framework for describing many models of interactive behaviour, where a graph corresponds to a process and the dynamics (or reduction) of a graph corresponds to interaction between processes. Mil...
We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph re...
This paper presents a formalism for defining higher-order systems based on the notion of graph trans...
State-of-the-art approaches to controlled graph rewriting focus on the specification of an external ...
Diagrammatic visual languages can increase the ability of engineers to model and understand complex ...
Abstract. We study resolving conflicts between an action description and a set of conditions (possib...
AbstractAn action graph is a combinatorial representation of a group acting on a set. Comparing two ...
We propose a class of hierarchical graphs equipped with a simple algebraic syntax as a convenient wa...
Process calculi and graph transformation systems provide models of reactive systems with labelled tr...
We propose a class of hierarchical graphs equipped with a simple algebraic syntax as a convenient wa...
We present a new approach -- based on graph transformation -- to incremental specification of the op...
The framework of graph transformation combines the potentials and advantages of both, graphs and rul...
Sophisticated control concepts are necessary to make the application of graph grammars feasible for ...
There is an intimate link between program structure and behaviour. Exploiting this link to phrase pr...
The use of graphs to model dynamic structures is ubiquitous in computer science; prominent example a...
The paper proposes a formal approach for constructing UML activity diagrams from sequence diagrams b...
We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph re...
This paper presents a formalism for defining higher-order systems based on the notion of graph trans...
State-of-the-art approaches to controlled graph rewriting focus on the specification of an external ...
Diagrammatic visual languages can increase the ability of engineers to model and understand complex ...
Abstract. We study resolving conflicts between an action description and a set of conditions (possib...
AbstractAn action graph is a combinatorial representation of a group acting on a set. Comparing two ...
We propose a class of hierarchical graphs equipped with a simple algebraic syntax as a convenient wa...
Process calculi and graph transformation systems provide models of reactive systems with labelled tr...
We propose a class of hierarchical graphs equipped with a simple algebraic syntax as a convenient wa...
We present a new approach -- based on graph transformation -- to incremental specification of the op...
The framework of graph transformation combines the potentials and advantages of both, graphs and rul...
Sophisticated control concepts are necessary to make the application of graph grammars feasible for ...
There is an intimate link between program structure and behaviour. Exploiting this link to phrase pr...
The use of graphs to model dynamic structures is ubiquitous in computer science; prominent example a...
The paper proposes a formal approach for constructing UML activity diagrams from sequence diagrams b...
We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph re...
This paper presents a formalism for defining higher-order systems based on the notion of graph trans...
State-of-the-art approaches to controlled graph rewriting focus on the specification of an external ...