384 research outputs found
Interval-valued algebras and fuzzy logics
In this chapter, we present a propositional calculus for several interval-valued fuzzy logics, i.e., logics having intervals as truth values. More precisely, the truth values are preferably subintervals of the unit interval. The idea behind it is that such an interval can model imprecise information. To compute the truth values of ‘p implies q’ and ‘p and q’, given the truth values of p and q, we use operations from residuated lattices. This truth-functional approach is similar to the methods developed for the well-studied fuzzy logics. Although the interpretation of the intervals as truth values expressing some kind of imprecision is a bit problematic, the purely mathematical study of the properties of interval-valued fuzzy logics and their algebraic semantics can be done without any problem. This study is the focus of this chapter
Runtime Verification of Temporal Properties over Out-of-order Data Streams
We present a monitoring approach for verifying systems at runtime. Our
approach targets systems whose components communicate with the monitors over
unreliable channels, where messages can be delayed or lost. In contrast to
prior works, whose property specification languages are limited to
propositional temporal logics, our approach handles an extension of the
real-time logic MTL with freeze quantifiers for reasoning about data values. We
present its underlying theory based on a new three-valued semantics that is
well suited to soundly and completely reason online about event streams in the
presence of message delay or loss. We also evaluate our approach
experimentally. Our prototype implementation processes hundreds of events per
second in settings where messages are received out of order.Comment: long version of the CAV 2017 pape
A logical approach to fuzzy truth hedges
The starting point of this paper are the works of Hájek and Vychodil on the axiomatization of truth-stressing and-depressing hedges as expansions of Hájek's BL logic by new unary connectives. They showed that their logics are chain-complete, but standard completeness was only proved for the expansions over Gödel logic. We propose weaker axiomatizations over an arbitrary core fuzzy logic which have two main advantages: (i) they preserve the standard completeness properties of the original logic and (ii) any subdiagonal (resp. superdiagonal) non-decreasing function on [0, 1] preserving 0 and 1 is a sound interpretation of the truth-stresser (resp. depresser) connectives. Hence, these logics accommodate most of the truth hedge functions used in the literature about of fuzzy logic in a broader sense. © 2013 Elsevier Inc. All rights reserved.The authors acknowledge partial support of the MICINN projects TASSAT (TIN2010-20967-C04-01) and ARINF (TIN2009-14704-C03-03), and the FP7-PEOPLE-2009-IRSES project MaToMUVI (PIRSES-GA-2009-247584). Carles Noguera also acknowledges support of the research contract “Juan de la Cierva” JCI-2009-05453.Peer Reviewe
A Theory of Sampling for Continuous-time Metric Temporal Logic
This paper revisits the classical notion of sampling in the setting of
real-time temporal logics for the modeling and analysis of systems. The
relationship between the satisfiability of Metric Temporal Logic (MTL) formulas
over continuous-time models and over discrete-time models is studied. It is
shown to what extent discrete-time sequences obtained by sampling
continuous-time signals capture the semantics of MTL formulas over the two time
domains. The main results apply to "flat" formulas that do not nest temporal
operators and can be applied to the problem of reducing the verification
problem for MTL over continuous-time models to the same problem over
discrete-time, resulting in an automated partial practically-efficient
discretization technique.Comment: Revised version, 43 pages
Path Checking for MTL and TPTL over Data Words
Metric temporal logic (MTL) and timed propositional temporal logic (TPTL) are
quantitative extensions of linear temporal logic, which are prominent and
widely used in the verification of real-timed systems. It was recently shown
that the path checking problem for MTL, when evaluated over finite timed words,
is in the parallel complexity class NC. In this paper, we derive precise
complexity results for the path-checking problem for MTL and TPTL when
evaluated over infinite data words over the non-negative integers. Such words
may be seen as the behaviours of one-counter machines. For this setting, we
give a complete analysis of the complexity of the path-checking problem
depending on the number of register variables and the encoding of constraint
numbers (unary or binary). As the two main results, we prove that the
path-checking problem for MTL is P-complete, whereas the path-checking problem
for TPTL is PSPACE-complete. The results yield the precise complexity of model
checking deterministic one-counter machines against formulae of MTL and TPTL
The variety generated by all the ordinal sums of perfect MV-chains
We present the logic BL_Chang, an axiomatic extension of BL (see P. H\'ajek -
Metamathematics of fuzzy logic - 1998, Kluwer) whose corresponding algebras
form the smallest variety containing all the ordinal sums of perfect MV-chains.
We will analyze this logic and the corresponding algebraic semantics in the
propositional and in the first-order case. As we will see, moreover, the
variety of BL_Chang-algebras will be strictly connected to the one generated by
Chang's MV-algebra (that is, the variety generated by all the perfect
MV-algebras): we will also give some new results concerning these last
structures and their logic.Comment: This is a revised version of the previous paper: the modifications
concern essentially the presentation. The scientific content is substantially
unchanged. The major variations are: Definition 2.7 has been improved.
Section 3.1 has been made more compact. A new reference, [Bus04], has been
added. There is some minor modification in Section 3.
- …