From rewrite rules to bisimulation congruences
Theoretical Computer Science
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Pure bigraphs: structure and dynamics
Information and Computation
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Security, Cryptography and Directed Bigraphs
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An algebraic approach to image schemas for geographic space
COSIT'09 Proceedings of the 9th international conference on Spatial information theory
DBtk: a toolkit for directed bigraphs
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A verification environment for bigraphs
Innovations in Systems and Software Engineering
| Hi-index | 0.00 |
We introduce directed bigraphs, a bigraphical meta-model for describing computational paradigms dealing with locations and resource communications. Directed bigraphs subsume and generalize both original Milner's and Sassone-Sobocinski's variants of bigraphs. The key novelty is that directed bigraphs take account of the ''resource request flow'' inside link graphs, from controls to edges (through names), by means of the new notion of directed link graph. We give RPO and IPO constructions for this model, generalizing and unifying the constructions independently given by Jensen-Milner and Sassone-Sobocinski in their respective variants. Moreover, the very same construction can be used for calculating RPBs as well, and hence also luxes (when these exist). Therefore, directed bigraphs can be used as a general theory for deriving labelled transition systems (and congruence bisimulations) from (possibly open) reactive systems.