Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Bisimulations and abstraction homomorphisms
Journal of Computer and System Sciences
Towards the unification of models for concurrency
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Concurrent bisimulations in Petri nets
Acta Informatica
Causal trees interleaving + causality
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Deciding history preserving bisimilarity
Proceedings of the 18th international colloquium on Automata, languages and programming
Information and Computation
Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
Integrating the Specification Techniques of Graph Transformation and Temporal Logic
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
History Preserving Bisimulation for Contextual Nets
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
A Fully Abstract Model for Graph-Interpreted Temporal Logic
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Concatenable Graph Processes: Relating Processes and Derivation Traces
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Minimal Transition Systems for History-Preserving Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Concurrent Graph and Term Graph Rewriting
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Tutorial introduction to the algebraic approach of graph grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
History-Dependent Automata
Ugo Montanari and Concurrency Theory
Concurrency, Graphs and Models
On the concurrent semantics of algebraic graph grammars
Formal Methods in Software and Systems Modeling
Hi-index | 0.00 |
Along the years the concurrent behaviour of graph grammars has been widely investigated, and, in particular, several classical approaches to the semantics of Petri nets have been extended to graph grammars. Most of the existing semantics for graph grammars provide a (possibly concurrent) operational model of computation, while little interest has been devoted to the definition of abstract observational semantics. The aim of this paper is to introduce and study a behavioural equivalence over graph grammars, inspired by the classical history preserving bisimulation. Several choices are conceivable according to the kind of concurrent observation one is interested in. We concentrate on the basic case where the concurrent nature of a graph grammar computation is described by means of a prime event structure. As it happens for Petri nets, history preserving bisimulation can be studied in the general framework of causal automata -- a variation of ordinary automata introduced to deal with history dependent formalisms. In particular, we prove that history preserving bisimulation is decidable for finite-state graph grammars, by showing how the problem can be reduced to deciding the equivalence of finite causal automata.