1302 search results - page 120 / 261 » Fair Equivalence Relations |
147
click to vote
ACSD
2005
IEEE
15 years 11 months ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
171
click to vote
CCS
2005
ACM
15 years 11 months ago
2005
ACM
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
148
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
153
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
151
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...