Results 1 - 10
of
17
Synchronised Hyperedge Replacement as a Model For Service Oriented Computing
, 2006
"... ..."
(Show Context)
A formal basis for reasoning on programmable Qos
- In Intl. Symposium on Verification – Theory and Practice – Honoring Z. Manna’s 64th Birthday, volume 2772 of LNCS
, 2003
"... Abstract. The explicit management of Quality of Service (QoS) of net-work connectivity, such as, e.g., working cost, transaction support, and security, is a key requirement for the development of the novel wide area network applications. In this paper, we introduce a foundational model for specifica ..."
Abstract
-
Cited by 19 (17 self)
- Add to MetaCart
(Show Context)
Abstract. The explicit management of Quality of Service (QoS) of net-work connectivity, such as, e.g., working cost, transaction support, and security, is a key requirement for the development of the novel wide area network applications. In this paper, we introduce a foundational model for specification of QoS attributes at application level. The model han-dles QoS attributes as semantic constraints within a graphical calculus for mobility. In our approach QoS attributes are related to the program-ming abstractions and are exploited to select, configure and dynamically modify the underlying system oriented QoS mechanisms. 1
Computing by Graph Transformation - A Survey and Annotated Bibliography
, 1996
"... this paper as candidates to represent the processes in a concurrent system or, more exactly, as representatives of equivalent views on the processes. The main results give sufficient conditions for existence and uniqueness of canonical derivations. ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
this paper as candidates to represent the processes in a concurrent system or, more exactly, as representatives of equivalent views on the processes. The main results give sufficient conditions for existence and uniqueness of canonical derivations.
Non-Functional Aspects of Wide Area Network Programming
, 2003
"... Wide-Area Network (WAN) applications have become one of the most popular ap-plications in current distributed computing. Internet and the World Wide Web are now the primary environment for designing, developing and distributing appli-cations. This scenario imposes different programming metaphors wit ..."
Abstract
-
Cited by 13 (13 self)
- Add to MetaCart
(Show Context)
Wide-Area Network (WAN) applications have become one of the most popular ap-plications in current distributed computing. Internet and the World Wide Web are now the primary environment for designing, developing and distributing appli-cations. This scenario imposes different programming metaphors with respect to traditional applications. Theoretical models for formally reasoning on WAN applications must consider many crucial aspects and their mutual relationships, e.g. mobility, network aware-ness, security, service level agreement, etc. This dissertation attempts to formally define declarative approaches for dealing with various facets of actual WAN programming and verification issues. We propose a declarative approach based on hypergraphs that provide founda-tional framework for “declaring ” components ’ behaviours of a distributed system. It is exercised with two well-known models for distributed computations as Ambient and Klaim. Moreover, we extend Klaim with constructs for specifying, at applica-
Synchronized hyperedge replacement for heterogeneous systems
- IN PROC. OF COORDINATION’05, VOLUME 3454 OF LNCS
, 2005
"... We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes complex evolutions by synchronizing local rules. In order to deal with heterogeneity, we consider different synchronization algebras ..."
Abstract
-
Cited by 12 (7 self)
- Add to MetaCart
(Show Context)
We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes complex evolutions by synchronizing local rules. In order to deal with heterogeneity, we consider different synchronization algebras for different communication channels. The main technical point is the interaction between synchronization algebras and name mobility in the π-calculus style. The power of our approach is shown through a few examples.
Graph-Based Design and Analysis of Dynamic Software Architectures
- In Concurrency, Graphs and Models, volume 5065 of LNCS
, 2008
"... Dedicated to Ugo Montanari in occasion of his 65th birthday Abstract. We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented in Alloy; ii) a process al-gebraic presentation of ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
(Show Context)
Dedicated to Ugo Montanari in occasion of his 65th birthday Abstract. We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented in Alloy; ii) a process al-gebraic presentation of graph transformation implemented in Maude. The two approaches are compared by showing how different aspects can be tackled, including representation issues, modelling phases, property spec-ification and analysis. 1
Tarzan: Communicating and Moving in Wireless Jungles
- QAPL 2004 PRELIMINARY VERSION
, 2004
"... 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 f ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
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.
A logic for application level QoS
- In Proceedings of the 3rd Workshop on Quantitative Aspects of Programming Languages, ENTCS
, 2005
"... Recently, Service Oriented Computing (SOC) has been proposed as a paradigm ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
(Show Context)
Recently, Service Oriented Computing (SOC) has been proposed as a paradigm
Shreq: Coordinating application level qos
- In SEFM ’05: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods. IEEE Computer Society
"... WepresentSHReQ,aformalframework forspecifying systemsthathandleabstracthigh-levelQoSaspectswhich are becoming more and more important for service oriented computing. SHReQ combines Synchronised Hyperedge Replacement (SHR) with constraint-semirings. SHR is a (hyper)graph rewriting mechanism for model ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
WepresentSHReQ,aformalframework forspecifying systemsthathandleabstracthigh-levelQoSaspectswhich are becoming more and more important for service oriented computing. SHReQ combines Synchronised Hyperedge Replacement (SHR) with constraint-semirings. SHR is a (hyper)graph rewriting mechanism for modelling mobility and reconfiguration of systems. The novelty of the approach relies on the synchronisation mechanism which is based on constraint-semirings, algebraic structures that provide both the mathematics for multicriteria QoS and the synchronisation policies underlying the SHR mechanism. 1.
Describing systems of processes by means of high-level replacement
- IN EHRIG ET AL
"... Graphs and graph transformations are natural means to describe systems of processes. Graphs represent structure of the system, and graph rewriting rules model dynamic behaviour. In this chapter, we illustrate the technique by describing Petri nets, statecharts, parallel logic programming, and system ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Graphs and graph transformations are natural means to describe systems of processes. Graphs represent structure of the system, and graph rewriting rules model dynamic behaviour. In this chapter, we illustrate the technique by describing Petri nets, statecharts, parallel logic programming, and systems of processes. Whereas description of Petri nets is based on usual graphs, statecharts lead us to hierarchical graphs, and parallel logic programming needs jungles. Finally, we combine different approaches to describe systems of processes. Topological structure is represented by a hypergraph. Local states and communication channels correspond to nodes that are labelled with parts of a global jungle playing the role of a shared data structure. The formal model takes advantage of comma-category approach allowing to change both the structure of graph and the contents of nodes consistently and to treat different graph structures as well as different labelling mechanisms in
