CAI
2005
Springer
14 years 9 months ago
2005
Springer
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e.,...
CSL
2008
Springer
14 years 10 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...