Sciweavers

Share
CAI
2005
Springer
9 years 10 months ago
Behavioural Equivalences on Finite-State Systems are PTIME-hard
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.,...
Zdenek Sawa, Petr Jancar
CSL
2008
Springer
10 years 5 days ago
Quantitative Languages
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...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
books