Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The minism provides an abstraction over scheduling, net...
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...