Sciweavers

115 search results - page 23 / 23
» On contraction and the modal fragment
Sort
View
STACS
2010
Springer
14 years 14 days ago
Branching-time Model Checking of One-counter Processes
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...
Stefan Göller, Markus Lohrey
ICALP
1998
Springer
13 years 9 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
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...
Petr Jancar, Antonín Kucera, Richard Mayr
FORMATS
2006
Springer
13 years 9 months ago
A Dose of Timed Logic, in Guarded Measure
We consider interval measurement logic IML, a sublogic of Zhou and Hansen's interval logic, with measurement functions which provide real-valued measurement of some aspect of ...
Kamal Lodaya, Paritosh K. Pandya
ECAI
2010
Springer
13 years 6 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
PAMI
2007
127views more  PAMI 2007»
13 years 5 months ago
Text-Independent Writer Identification and Verification Using Textural and Allographic Features
—The identification of a person on the basis of scanned images of handwriting is a useful biometric modality with application in forensic and historic document analysis and const...
Marius Bulacu, Lambert Schomaker