CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We develop a variant of Gordon and Hankin's concurrent object calculus with support for flexible access control on methods. We investigate safe administration and ac...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...