110 search results - page 15 / 22 » A Finite Model Construction for Coalgebraic Modal Logic |
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
113
Voted
IEEESCC
2005
IEEE
15 years 5 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
140
click to vote
TABLEAUX
2000
Springer
15 years 3 months ago
2000
Springer
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
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...
106
Voted
LPAR
2010
Springer
14 years 9 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...