Sciweavers

ACOM
2006
Springer
13 years 10 months ago
Temporal Logics for Representing Agent Communication Protocols
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
Ulle Endriss
JVA
2006
IEEE
13 years 10 months ago
Natural Deduction Calculus for Computation Tree Logic
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
RV
2007
Springer
100views Hardware» more  RV 2007»
13 years 11 months ago
The Good, the Bad, and the Ugly, But How Ugly Is Ugly?
When monitoring a system wrt. a property defined in some temporal logic, e. g., LTL, a major concern is to settle with an adequate interpretation of observable system events; that...
Andreas Bauer 0002, Martin Leucker, Christian Scha...
LPAR
2007
Springer
13 years 11 months ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich
LFCS
2007
Springer
13 years 11 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
HVC
2007
Springer
107views Hardware» more  HVC 2007»
13 years 11 months ago
On the Characterization of Until as a Fixed Point Under Clocked Semantics
Modern hardware designs are typically based on multiple clocks. While a singly-clocked hardware design is easily described in standard temporal logics, describing a multiply-clocke...
Dana Fisman
FROCOS
2007
Springer
13 years 11 months ago
Noetherianity and Combination Problems
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
FOSSACS
2007
Springer
13 years 11 months ago
On the Expressiveness and Complexity of ATL
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
François Laroussinie, Nicolas Markey, Ghass...
CSL
2007
Springer
13 years 11 months ago
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
ATAL
2007
Springer
13 years 11 months ago
Preservation of obligations in a temporal and deontic framework
We study logical properties that concern the preservation of futuredirected obligations that have not been fulfilled yet. Our starting point is a product of temporal and deontic ...
Jan Broersen, Julien Brunel