32 search results - page 5 / 7 » Concurrent Rewriting for Graphs with Equivalences |
TOPNOC
2008
13 years 10 months ago
2008
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
ENTCS
2008
13 years 11 months ago
2008
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
OOPSLA
2005
Springer
14 years 4 months ago
2005
Springer
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...