3273 search results - page 529 / 655 » types 2007 |
102
click to vote
ENTCS
2007
15 years 4 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
109
click to vote
ENTCS
2007
15 years 4 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
148
click to vote
ENTCS
2007
15 years 4 months ago
2007
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
144
click to vote
ENTCS
2007
15 years 4 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
127
click to vote
EOR
2007
15 years 4 months ago
2007
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...