103 search results - page 21 / 21 » Modal logic of time division |
STACS
2010
Springer
14 years 2 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...
MFCS
1991
Springer
13 years 11 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
13 years 9 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...