825 search results - page 163 / 165 » Modal Logics with Counting |
100
click to vote
STACS
2010
Springer
15 years 6 months 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...
VRCAI
2004
ACM
15 years 5 months ago
2004
ACM
Despite steady research advances in many aspects of virtual reality, building and testing virtual worlds remains to be a very difficult process. Most virtual environments are stil...
ICALP
1998
Springer
15 years 3 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
110
click to vote
MFCS
1991
Springer
15 years 3 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...
FOIS
2006
15 years 1 months ago
2006
The paper analyzes how and under which assumptions it is possible to compare (in a relationist setting and relatively to qualities) entities living in different worlds. We begin wi...