3228 search results - page 268 / 646 » Computationally Sound Proofs |
102
click to vote
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
Jonsson and Larsen's notion of probabilistic simulation is studied from a coalgebraic perspective. The notion is compared with two generic coalgebraic definitions of simulatio...
120
click to vote
GG
2008
Springer
15 years 5 months ago
2008
Springer
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
113
click to vote
ENTCS
2006
15 years 4 months ago
2006
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...
174
click to vote
TGC
2010
Springer
15 years 2 months ago
2010
Springer
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
169
Voted
FUIN
2010
15 years 2 months ago
2010
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...