Sciweavers

4401 search results - page 341 / 881
» Computing with Default Logic
Sort
View
ACTA
2010
109views more  ACTA 2010»
15 years 6 months ago
On regular temporal logics with past
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 6 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 6 months ago
Modeling Adversaries in a Logic for Security Protocol Analysis
Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...
Joseph Y. Halpern, Riccardo Pucella
ENTCS
2006
142views more  ENTCS 2006»
15 years 6 months ago
Specialization of Interaction Protocols in a Temporal Action Logic
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
Laura Giordano, Alberto Martelli, Camilla Schwind
JANCL
2006
105views more  JANCL 2006»
15 years 6 months ago
BDD-based decision procedures for the modal logic K
We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, ...
Guoqiang Pan, Ulrike Sattler, Moshe Y. Vardi