A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Specification languages for distributed systems
Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
On the parameterized algebraic specification of concurrent systems
Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
Amalgamation of graph transformations: a synchronization mechanism
Journal of Computer and System Sciences
Concurrent histories: a basis for observing distributed systems
Journal of Computer and System Sciences
Distributed systems, partial orderings of events, and event structures
Control Flow and Data Flow: concepts of distributed programming
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
A Tutorial and Bibliographical Survey on Graph Grammars
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Relationships Between Graph Grammars and the Design and Analysis of Concurrent Software
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Graph Grammars for distributed systems
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Aspects of concurrency in graph grammars
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Partial ordering derivations for CCS
FCT '85 Fundamentals of Computation Theory
Liveness properties as convergence in metric spaces
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Foundations of Actor Semantics
Foundations of Actor Semantics
Web Structures: A Tool for Representing and Manipulating Programs
IEEE Transactions on Software Engineering
Software architecture styles as graph grammars
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Graph grammars and constraint solving for software architecture styles
ISAW '98 Proceedings of the third international workshop on Software architecture
Describing Software Architecture Styles Using Graph Grammars
IEEE Transactions on Software Engineering
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
Reconfiguration of Software Architecture Styles with Name Mobility
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
SHReQ: Coordinating Application Level QoS
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
Theory and Practice of Logic Programming
Exploiting User-definable Synchronizations in Graph Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric synchronizations in mobile nominal calculi
Theoretical Computer Science
Ugo Montanari and Graph Transformation
Concurrency, Graphs and Models
Graph-Based Design and Analysis of Dynamic Software Architectures
Concurrency, Graphs and Models
Ugo Montanari and Concurrency Theory
Concurrency, Graphs and Models
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Network Applications of Graph Bisimulation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Application of Graph Transformation in Verification of Dynamic Systems
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Brief announcement: self-assembly as graph grammar as distributed system
Proceedings of the 28th ACM symposium on Principles of distributed computing
Rational Unification in 28 Characters
Electronic Notes in Theoretical Computer Science (ENTCS)
Parallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Tarzan: Communicating and Moving in Wireless Jungles
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronization Algebras with Mobility for Graph Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed Event Graphs: Formalizing Component-based Modelling and Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
A Logic for Application Level QoS
Electronic Notes in Theoretical Computer Science (ENTCS)
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
PRISMA: a mobile calculus with parametric synchronization
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Symmetry for the analysis of dynamic systems
NFM'11 Proceedings of the Third international conference on NASA Formal methods
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
Simulating algebraic high-level nets by parallel attributed graph transformation
Formal Methods in Software and Systems Modeling
Synchronized hyperedge replacement for heterogeneous systems
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Complete axioms for stateless connectors
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
TOWARDS SYNCHRONOUS AND ASYNCHRONOUS GRAPH TRANSFORMATIONS
Fundamenta Informaticae
Hi-index | 0.01 |
In our model, a graph describes a net of processes communicating through ports and, at the same time, its computation history consisting of a partial ordering of events. Stand-alone evolution of processes is specified by context-free productions. From productions and a basic synchronization mechanism, a set of context-sensitive rewriting rules that models the evolution of processes connected to the same ports can be derived. A computation is a sequence of graphs obtained by successive rewritings. The result of a finite computation is its last graph, whereas the result of an infinite computation is the limit, infinite graph defined through a completion technique based on metric spaces. A result characterizes a concurrent computation, since it abstracts from any particular interleaving of concurrent events, while in the meantime providing information about termination, partial or complete deadlocks, and fairness. Not every result is acceptable, however, but only the computations that produce a result no longer rewritable are successful. Infinite successful computations are shown to coincide with weakly fair computations, and a scheduler yielding all and only such computations is defined.