115 search results - page 2 / 23 » On contraction and the modal fragment |
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
CONCUR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We define a language for Web services contracts as a parallelfree fragment of ccs and we study a natural notion of compliance between clients and services in terms of th...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
LOGCOM
2000
13 years 5 months ago
2000
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...