A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
The Evolving Philosophers Problem: Dynamic Change Management
IEEE Transactions on Software Engineering
A calculus of mobile processes, II
Information and Computation
Dynamic structure in software architectures
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Self organising software architectures
ISAW '96 Joint proceedings of the second international software architecture workshop (ISAW-2) and international workshop on multiple perspectives in software development (Viewpoints '96) on SIGSOFT '96 workshops
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Graph grammars and constraint solving for software architecture styles
ISAW '98 Proceedings of the third international workshop on Software architecture
Architecture-based runtime software evolution
Proceedings of the 20th international conference on Software engineering
Algebraic software architecture reconfiguration
ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Modeling concurrent, mobile and coordinated systems via graph transformations
Handbook of graph grammars and computing by graph transformation
Describing Software Architecture Styles Using Graph Grammars
IEEE Transactions on Software Engineering
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Modeling Software Architecutes and Styles with Graph Grammars and Constraint Solving
WICSA1 Proceedings of the TC2 First Working IFIP Conference on Software Architecture (WICSA1)
Analysing Dynamic Change in Software Architectures: A Case Study
CDS '98 Proceedings of the International Conference on Configurable Distributed Systems
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
SHReQ: Coordinating Application Level QoS
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Ugo Montanari and Graph Transformation
Concurrency, Graphs and Models
Synchronous Multiparty Synchronizations and Transactions
Concurrency, Graphs and Models
Software Engineering: Ugo Montanari's Main Contributions and Introduction to the Section
Concurrency, Graphs and Models
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Synchronised hyperedge replacement as a model for service oriented computing
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Synchronized hyperedge replacement for heterogeneous systems
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
| Hi-index | 0.00 |
An important issue in the area of software architecture is the specification of reconfiguration and mobility of systems. This paper presents an approach for the specification of software architecture styles using hyperedge replacement systems and for their dynamic reconfiguration using constraint solving. A system architecture is represented as a graph where edges are components and nodes are ports of communication. Then, a style is represented as a graph grammar where the instances of the style are the graphs generated by the corresponding grammar. The construction and dynamic evolution of the style are represented as context-free productions and graph rewriting. To model reconfigurations we allow the declaration, creation and matching of new nodes (i.e. ports of communication) and use constraint solving over the productions of the style grammar for achieving synchronization. In this way complex evolutions can be specified in a more expressive and compact form than using π-calculus style languages for mobility.