183 search results - page 37 / 37 » Exemplaric Expressivity of Modal Logics |
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
STACS
2010
Springer
14 years 9 days ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
MFCS
1991
Springer
13 years 8 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...