-
...we provide a trace-based semantics for a language of synchronously communicating processes, assuming weakly fair parallel execution. the semantics is fully abstract: processes have the same trace sets if and only if their communication behaviors, including potential for deadlock, are identical in all...
-
...we construct several denotational semantics for communicating processes that incorporate assumptions of strong (process) fairness. strong fairness is the guarantee that every process enabled infinitely often will make...is simply the set of fair traces representing its fair computations; each fair trace records the steps made along...
-
...we present a denotational semantics for a language of parallel communicating processes based on hoare's csp [10] and milner's ccs [14], and we prove that the semantics...by introducing closure conditions on trace sets, we achieve full abstraction [13]: two processes have the same meaning if and only if they exhibit identical...
-
...the setting of algebra of communicating
processes (acp). a model of process graphs modulo readiness equivalence, respectively, failure equivalence,
is constructed, and an equational axiom system is...to subsets of hoare's communicating sequential processes (csp) and milner's calculus
of communicating systems (ccs). also, the characterisation implies a full abstraction result for the failure
model. in the...
-
...semantic models to incorpo- rate fairness. we consider a process algebra based on asynchronous communication and fair parallel execution. we show that...that this semantics is fully abstract, in that processes have the same trace sets if and only if they induce identical safety and liveness properties in all program...
-
...the most reasonable notion of fairness.this paper describes a strongly fair, trace-based semantics for a ccs-like language of communicating processes with full recursion. the semantics is a...outline the general difficulties encountered and discuss why the fair-trace approach is unlikely to yield full abstraction for this combination of features....
-
...we provide a model for networks of communicating asynchronous processes, a nondeterministic generalization of kahn...never proved that his semantics for deterministic networks was consistent with an operational semantics, the appealing simplicity of his denotational model is undeniable and kahn's principle has almost...
-
...could not be the same for all inventions; his own highly 'philosophical' and abstract specification for the separate condenser was validated...the disputed (1775) patent was for machinery for 'preparing silk, cotton, flax or wool for spinning', i.e. for carding and roving (fig. 3). its specification...
-
...network consists of nodes that communicate by passing data over unbounded fifo channels. for dataflow networks containing only deterministic nodes, kahn has presented a simple and elegant semantic model. however, the...attained by models based on traces. in the paper, we investigate trace models of dataflow networks, with...
-
...having an elegant mathematical
structure and at the same time describing steps of execution. game semantics was successfully used to prove full abstraction
of pcf and has since been used to...honest
agents are the players and the intruder is the opponent. we propose a game-based calculus for the specification of security
protocols...