Sciweavers

14379 search results - page 2571 / 2876
» is 2000
Sort
View
ENTCS
2000
112views more  ENTCS 2000»
15 years 6 months ago
Typed Multiset Rewriting Specifications of Security Protocols
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Iliano Cervesato
ENTCS
2000
114views more  ENTCS 2000»
15 years 6 months ago
Syntactic Type Soundness for the Region Calculus
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
Simon Helsen, Peter Thiemann
ENTCS
2000
97views more  ENTCS 2000»
15 years 6 months ago
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
Jirí Srba
ENVSOFT
2000
70views more  ENVSOFT 2000»
15 years 6 months ago
Modeling soil pile bioremediation
A model is presented for the analysis of bioremediation applied to an ex situ soil pile. The approach is based on the remediation of a pile containing the contaminated soil, which...
Fehmidakhatun A. Mesania, Aaron A. Jennings
EOR
2000
98views more  EOR 2000»
15 years 6 months ago
Optimal planning in large multi-site production networks
This contribution describes a general mixed-integer linear programming model based on a time-indexed formulation covering the relevant features required for the complete supply ch...
Christian Timpe, Josef Kallrath
« Prev « First page 2571 / 2876 Last » Next »