Sciweavers

133 search results - page 22 / 27
» Decidable Fragments of Many-Sorted Logic
Sort
View
JELIA
2010
Springer
13 years 5 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
STACS
2001
Springer
13 years 11 months ago
On Presburger Liveness of Discrete Timed Automata
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmere...
CONCUR
2006
Springer
13 years 11 months ago
Controller Synthesis for MTL Specifications
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
CONCUR
1998
Springer
13 years 11 months ago
Axioms for Real-Time Logics
This paper presents a complete axiomatization of two decidable propositional realtime linear temporal logics: Event Clock Logic (EventClockTL) and Metric Interval Temporal Logic w...
Jean-François Raskin, Pierre-Yves Schobbens...
LICS
2003
IEEE
14 years 19 days ago
Model-checking Trace Event Structures
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
P. Madhusudan