Highly distributed networks have now become a common platform for large scale distributed programming. While a number of useful internet applications can be developed using the standard client-server paradigm, internet applications distinguish themselves from traditional applications on scalability (huge number of users and nodes), connectivity (both availability and bandwidth), heterogeneity (operating systems and application software) and autonomy (of network nodes and administration domains having strong control of their resources). Hence, other programming paradigms (thin client and application servers, collaborative \peer-to-peer", code-ondemand, mobile agents) seem more appropriate for applications over internet. These emerging programming paradigms require on the one hand mechanisms to support mobility of code and computations, and eective infrastructures to support coordination and control of dynamically loaded software modules. On the other hand, an abstract semantic framework to formalize the model of computation of internet applications is clearly needed, and missing. Such semantic framework may provide the formal basis to discuss and motivate controversial design/implementation issues
|
1464
|
The Unified Model-ing Language User Guide
– Booch, Jacobson, et al.
- 1999
|
|
886
|
A Calculus of Mobile Processes
– Milner, Parrow, et al.
- 1992
|
|
410
|
A language with distributed scope
– Cardelli
- 1995
|
|
297
|
Formal methods: State of the art and future directions
– Clarke, Wing
- 1996
|
|
278
|
A calculus of mobile agents
– Fournet, Gonthier, et al.
- 1996
|
|
215
|
Universal coalgebra: A theory of systems
– Rutten
- 1996
|
|
214
|
Handbook of Graph Grammars and Computing by Graph Transformation
– Rozenberg, ed
|
|
184
|
Kaim: a kernel language for agents interaction and mobility
– Nicola, Ferrari, et al.
- 1998
|
|
156
|
Petri nets are monoids
– Meseguer, Montanari
- 1990
|
|
151
|
Mobile agents
– White
- 1995
|
|
145
|
Calculi for interaction
– Milner
- 1996
|
|
90
|
Towards a mathematical operational semantics
– Turi, Plotkin
- 1997
|
|
83
|
Graph processes
– Corradini, Montanari, et al.
- 1996
|
|
54
|
Conditional rewriting logic as a uni model of concurrency
– Meseguer
- 1992
|
|
39
|
A model for distributed systems based on graph rewriting
– Degano, Montanari
- 1987
|
|
36
|
An algebraic semantics for structured transition systems and its application to logic programs
– Corradini, Montanari
- 1992
|
|
34
|
Type-safe execution of mobile agents in anonymous networks
– Hennessy, Riely
- 1998
|
|
31
|
An algebraic presentation of term graphs, via gs-monoidal categories
– Corradini, Gadducci
- 1999
|
|
28
|
Unfolding and Event Structure Semantics for Graph Grammars
– Baldan, Corradini, et al.
- 1999
|
|
22
|
Safe, untrusted agents using proof-carrying code
– Necula, Lee
- 1998
|
|
17
|
History Dependent Automata
– Pistore
- 1999
|
|
16
|
Concurrent semantics of algebraic graph transformations
– Baldan, Corradini, et al.
- 1999
|
|
16
|
Cartesian closed double categories, their lambdanotation, and the Pi-calculus
– Bruni, Montanari
- 1999
|
|
14
|
Normal forms for partitions and relations
– Bruni, Gadducci, et al.
- 1998
|
|
14
|
Concurrent Graph and Term Graph Rewriting
– Corradini
- 1996
|
|
12
|
Coordination Languages and Their Signi
– Gelernter, Carriero
- 1992
|
|
7
|
Structured transition systems with parametric observations: observational congruences and minimal realizations
– Ferrari, Montanari, et al.
- 1997
|
|
6
|
Symmetric and cartesian double categories as a semantic framework for tile logic
– Bruni, Meseguer, et al.
- 2000
|
|
4
|
Executable tile speci for process calculi
– Bruni, Meseguer, et al.
- 1999
|
|
4
|
From SOS speci to structured coalgebras: How to make bismulation a congruence
– Corradini, Heckel, et al.
- 1999
|
|
4
|
Modeling Concurrent, Mobile and Coordinated Systems via Graph Transformations In
– Montanari, Pistore, et al.
- 1999
|
|
2
|
Tile Formats for Located and
– Ferrari, Montanari
- 1999
|
|
2
|
Final semantics for the pi-calculus
– Honsell, Lenisa, et al.
- 1998
|
|
2
|
Checking Bisimilarity for Finitary pi-calculus
– Montanari, Pistore
|
|
1
|
Interaction Categories and Communicating
– Abramsky
- 1995
|
|
1
|
A -calculus with Explicit Substitutions. TCS-c Vol
– Ferrari, Montanari, et al.
- 1996
|
