Browsing by Subject "Process calculi"
Now showing items 1-7 of 7
-
Conference Object
Essential features of a compiler target language for parallel machines
(IEEE, 1995)Term Graph Rewriting Systems (TGRS) have been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) ...
-
Conference Object
Mean-field semantics for a process calculus for spatially-explicit ecological models
(Open Publishing Association, 2016)We define a mean-field semantics for S-PALPS, a process calculus for spatially-explicit, individual-based modeling of ecological systems. The new semantics of S-PALPS allows an interpretation of the average behavior of a ...
-
Article
On sharing and determinacy in concurrent systems
(1995)The relationship between sharing and determinacy in concurrent systems is studied. Syntactic conditions on programs of a concurrent object language are isolated and it is established, on the basis of two different semantic ...
-
Article
A process calculus for dynamic networks
(2011)In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery ...
-
Article
Process ordering in a process calculus for spatially-explicit ecological models
(2014)In this paper we extend PALPS, a process calculus proposed for the spatially-explicit individual-based modeling of ecological systems, with the notion of a policy. A policy is an entity for specifying orderings between the ...
-
Article
Simulation and verification in a process calculus for spatially-explicit ecological models
(2013)We propose PALPS, a Process Algebra with Locations for Population Systems. PALPS allows us to produce spatially-explicit individual-based ecological models and to reason about their behavior. PALPS has two abstraction ...
-
Article
Verification techniques for distributed algorithms
(2006)A value-passing, asynchronous process calculus and its associated theory of confluence are considered as a basis for establishing the correctness of distributed algorithms. In particular, we present an asynchronous version ...