Communicating sequential processes
Communicating sequential processes
A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Theoretical Computer Science
Communication and Concurrency
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Graph Grammars for distributed systems
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Modelling Clustering of Sensor Networks with Synchronised Hyperedge Replacement
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
| Hi-index | 0.00 |
Wireless networks allow portable/mobile devices (and the related applications) to communicate each other with radio or infrared signals. Computations on those networks are very sensible to many physical variables (e.g., energy consumption, distance, geographic topology, etc.). We propose Tarzan, a framework based on graph rewriting that easily allow one to express many quantitative aspects of wireless networks. Apart from the expressiveness issue, the main advantage of Tarzan is its formal semantics that can be exploited for specifying applications, routing algorithms or coordination aspects of wireless devices considering realistic physical limitations.