activity
20102017
most citedConstraint LTL Satisfiability Checking without Automata

3 citations · 8 across the 7 of their papers we have counts for

collaborators

7 papers

math.NT2017

A note on Fibonacci number of even index

Achille Frigeri

We prove that a positive integer is a Fibonacci number of even index if and only if .

math.CO2014★ 1 cited

Composing short 3-compressing words on a 2 letter alphabet

Alessandra Cherubini, Achille Frigeri, Zuhua Liu

A finite deterministic (semi)automaton is -compressible if there is some word such that the image of its state set under the natural action…

cs.LO2012★ 3 cited

Constraint LTL Satisfiability Checking without Automata

Marcello M. Bersani, Achille Frigeri, Angelo Morzenti +3

This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic for…

cs.LO2012

Fuzzy Time in LTL

Achille Frigeri, Liliana Pasquale, Paola Spoletini

In the last years, the adoption of active systems has increased in many fields of computer science, such as databases, sensor networks, and software engineering. These systems are…

math.RA2010★ 1 cited

Circular planar nearrings: geometrical and combinatorial aspects

Anna Benini, Achille Frigeri, Fiorenza Morini

Let be a circular Ferrero pair. We define the disk with center and radius , , as \[\mathcal{D}(a;b)=\{x\in Φ(r)+c\mid r\neq 0,\ b\in Φ(r)+c,\ |(Φ(r…

cs.LO2010★ 2 cited

Bounded Reachability for Temporal Logic over Constraint Systems

Marcello M. Bersani, Achille Frigeri, Angelo Morzenti +3

We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint…

cs.LO2010★ 1 cited

SMT-based Verification of LTL Specifications with Integer Constraints and its Application to Runtime Checking of Service Substitutability

Marcello M. Bersani, Luca Cavallaro, Achille Frigeri +2

An important problem that arises during the execution of service-based applications concerns the ability to determine whether a running service can be substituted with one with a d…