148 search results - page 3 / 30 » An Algebraic Theory of Graph Reduction |
WOLLIC
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
CADE
2000
Springer
14 years 23 days ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
CORR
2006
Springer
13 years 8 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 ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
ICFP
1996
ACM
14 years 17 days ago
1996
ACM
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...