240 search results - page 23 / 48 » Infinite trace equivalence |
ASE
2005
13 years 8 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
act Approach to Process Equivalence Bartek Klin Pawel Soboci´nski BRICS University of Aarhus, Denmark Abstract. A framework of Plotkin and Turi’s, originally aimed at providing ...
ARESEC
2011
12 years 8 months ago
2011
—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive definitions of message distinguish ability and...
ALGORITHMICA
2002
13 years 8 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
DATE
2004
IEEE
14 years 11 days ago
2004
IEEE
System level modeling with executable languages such as C/C++ has been crucial in the development of large electronic systems from general processors to application specific desig...