Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

3 ( 1 )

2019 ( 518 )

2018 ( 705 )

2017 ( 699 )

Custom range...

Search Results: 1 - 10 of 402370 matches for " Marcello M. Bersani "
All listed articles are free for downloading (OA Articles)
Page 1 /402370
Display every page Item
An LTL Semantics of Business Workflows with Recovery
Luca Ferrucci,Marcello M. Bersani,Manuel Mazzara
Computer Science , 2014,
Abstract: We describe a business workflow case study with abnormal behavior management (i.e. recovery) and demonstrate how temporal logics and model checking can provide a methodology to iteratively revise the design and obtain a correct-by construction system. To do so we define a formal semantics by giving a compilation of generic workflow patterns into LTL and we use the bound model checker Zot to prove specific properties and requirements validity. The working assumption is that such a lightweight approach would easily fit into processes that are already in place without the need for a radical change of procedures, tools and people's attitudes. The complexity of formalisms and invasiveness of methods have been demonstrated to be one of the major drawback and obstacle for deployment of formal engineering techniques into mundane projects.
Integrated Modeling and Verification of Real-Time Systems through Multiple Paradigms
Marcello M. Bersani,Carlo A. Furia,Matteo Pradella,Matteo Rossi
Computer Science , 2009, DOI: 10.1109/SEFM.2009.16
Abstract: Complex systems typically have many different parts and facets, with different characteristics. In a multi-paradigm approach to modeling, formalisms with different natures are used in combination to describe complementary parts and aspects of the system. This can have a beneficial impact on the modeling activity, as different paradigms an be better suited to describe different aspects of the system. While each paradigm provides a different view on the many facets of the system, it is of paramount importance that a coherent comprehensive model emerges from the combination of the various partial descriptions. In this paper we present a technique to model different aspects of the same system with different formalisms, while keeping the various models tightly integrated with one another. In addition, our approach leverages the flexibility provided by a bounded satisfiability checker to encode the verification problem of the integrated model in the propositional satisfiability (SAT) problem; this allows users to carry out formal verification activities both on the whole model and on parts thereof. The effectiveness of the approach is illustrated through the example of a monitoring system.
Constraint LTL Satisfiability Checking without Automata
Marcello M. Bersani,Achille Frigeri,Angelo Morzenti,Matteo Pradella,Matteo Rossi,Pierluigi San Pietro
Computer Science , 2012,
Abstract: 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 formulae belonging to constraint system D (CLTLB(D) for short). The technique is based on the concept of bounded satisfiability, and hinges on an encoding of CLTLB(D) formulae into QF-EUD, the theory of quantifier-free equality and uninterpreted functions combined with D. Similarly to standard LTL, where bounded model-checking and SAT-solvers can be used as an alternative to automata-theoretic approaches to model-checking, our approach allows users to solve the satisfiability problem for CLTLB(D) formulae through SMT-solving techniques, rather than by checking the emptiness of the language of a suitable automaton A_{\phi}. The technique is effective, and it has been implemented in our Zot formal verification tool.
Efficient Large-scale Trace Checking Using MapReduce
Marcello M. Bersani,Domenico Bianculli,Carlo Ghezzi,Srdan Krstic,Pierluigi San Pietro
Computer Science , 2015,
Abstract: The problem of checking a logged event trace against a temporal logic specification arises in many practical cases. Unfortunately, known algorithms for an expressive logic like MTL (Metric Temporal Logic) do not scale with respect to two crucial dimensions: the length of the trace and the size of the time interval for which logged events must be buffered to check satisfaction of the specification. The former issue can be addressed by distributed and parallel trace checking algorithms that can take advantage of modern cloud computing and programming frameworks like MapReduce. Still, the latter issue remains open with current state-of-the-art approaches. In this paper we address this memory scalability issue by proposing a new semantics for MTL, called lazy semantics. This semantics can evaluate temporal formulae and boolean combinations of temporal-only formulae at any arbitrary time instant. We prove that lazy semantics is more expressive than standard point-based semantics and that it can be used as a basis for a correct parametric decomposition of any MTL formula into an equivalent one with smaller, bounded time intervals. We use lazy semantics to extend our previous distributed trace checking algorithm for MTL. We evaluate the proposed algorithm in terms of memory scalability and time/memory tradeoffs.
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,Matteo Pradella,Matteo Rossi
Computer Science , 2010,
Abstract: 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 different interface, for example if the former is no longer available. Standard Bounded Model Checking techniques can be used to perform this check, but they must be able to provide answers very quickly, lest the check hampers the operativeness of the application, instead of aiding it. The problem becomes even more complex when conversational services are considered, i.e., services that expose operations that have Input/Output data dependencies among them. In this paper we introduce a formal verification technique for an extension of Linear Temporal Logic that allows users to include in formulae constraints on integer variables. This technique applied to the substitutability problem for conversational services is shown to be considerably faster and with smaller memory footprint than existing ones.
Bounded Reachability for Temporal Logic over Constraint Systems
Marcello M. Bersani,Achille Frigeri,Angelo Morzenti,Matteo Pradella,Matteo Rossi,Pierluigi San Pietro
Computer Science , 2010,
Abstract: 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 systems, satisfiability and Model Checking problem of such logic can be undecidable. We introduce suitable restrictions and assumptions that are shown to make the satisfiability problem for the extended logic decidable. Moreover for a large class of constraint systems we propose an encoding that realize an effective decision procedure for the Bounded Reachability problem.
Deciding the Satisfiability of MITL Specifications
Marcello Maria Bersani,Matteo Rossi,Pierluigi San Pietro
Computer Science , 2013, DOI: 10.4204/EPTCS.119.8
Abstract: In this paper we present a satisfiability-preserving reduction from MITL interpreted over finitely-variable continuous behaviors to Constraint LTL over clocks, a variant of CLTL that is decidable, and for which an SMT-based bounded satisfiability checker is available. The result is a new complete and effective decision procedure for MITL. Although decision procedures for MITL already exist, the automata-based techniques they employ appear to be very difficult to realize in practice, and, to the best of our knowledge, no implementation currently exists for them. A prototype tool for MITL based on the encoding presented here has, instead, been implemented and is publicly available.
Proceedings First Workshop on Logics and Model-checking for Self-* Systems
Marcello Maria Bersani,Davide Bresolin,Luca Ferrucci,Manuel Mazzara
Computer Science , 2014, DOI: 10.4204/EPTCS.168
Abstract: This volume contains the proceedings of the First Workshop on Logics and Model-checking for self-* systems (MOD* 2014). The worshop took place in Bertinoro, Italy, on 12th of September 2014, and was a satellite event of iFM 2014 (the 11th International Conference on Integrated Formal Methods). The workshop focuses on demonstrating the applicability of Formal Methods on modern complex systems with a high degree of self-adaptivity and reconfigurability, by bringing together researchers and practitioners with the goal of pushing forward the state of the art on logics and model checking.
Comparison of facial expression in patients with obsessive-compulsive disorder and schizophrenia using the Facial Action Coding System: a preliminary study
Bersani G,Bersani FS,Valeriani G,Robiony M
Neuropsychiatric Disease and Treatment , 2012,
Abstract: Giuseppe Bersani,1 Francesco Saverio Bersani,1,2 Giuseppe Valeriani,1 Maddalena Robiony,1 Annalisa Anastasia,1 Chiara Colletti,1,3 Damien Liberati,1 Enrico Capra,2 Adele Quartini,1 Elisa Polli11Department of Medical-Surgical Sciences and Biotechnologies, 2Department of Neurology and Psychiatry, Sapienza University of Rome, Rome, 3Department of Neuroscience and Behaviour, Section of Psychiatry, Federico II University of Naples, Naples, ItalyBackground: Research shows that impairment in the expression and recognition of emotion exists in multiple psychiatric disorders. The objective of the current study was to evaluate the way that patients with schizophrenia and those with obsessive-compulsive disorder experience and display emotions in relation to specific emotional stimuli using the Facial Action Coding System (FACS).Methods: Thirty individuals participated in the study, comprising 10 patients with schizophrenia, 10 with obsessive-compulsive disorder, and 10 healthy controls. All participants underwent clinical sessions to evaluate their symptoms and watched emotion-eliciting video clips while facial activity was videotaped. Congruent/incongruent feeling of emotions and facial expression in reaction to emotions were evaluated.Results: Patients with schizophrenia and obsessive-compulsive disorder presented similarly incongruent emotive feelings and facial expressions (significantly worse than healthy participants). Correlations between the severity of psychopathological condition (in particular the severity of affective flattening) and impairment in recognition and expression of emotions were found.Discussion: Patients with obsessive-compulsive disorder and schizophrenia seem to present a similarly relevant impairment in both experiencing and displaying of emotions; this impairment may be seen as a chronic consequence of the same neurodevelopmental origin of the two diseases. Mimic expression could be seen as a behavioral indicator of affective flattening. The FACS could be used as an objective way to evaluate clinical evolution in patients.Keywords: schizophrenia, obsessive-compulsive disorder, facial expression, Facial Action Coding System
Capgras-like syndrome in a patient with an acute urinary tract infection
Salviati M,Bersani FS,Macrì F,Fojanesi M
Neuropsychiatric Disease and Treatment , 2013,
Abstract: Massimo Salviati, Francesco Saverio Bersani, Francesco Macrì, Marta Fojanesi, Amedeo Minichino, Mariana Gallo, Francesco De Michele, Roberto Delle Chiaie, Massimo BiondiDepartment of Neurology and Psychiatry, Sapienza University of Rome, Rome, ItalyAbstract: Delusional misidentification syndromes are a group of delusional phenomena in which patients misidentify familiar persons, objects, or themselves, believing that they have been replaced or transformed. In 25%–40% of cases, misidentification syndromes have been reported in association with organic illness. We report an acute episode of Capgras-like delusion lasting 8 days, focused on the idea that people were robots with human bodies, in association with an acute urinary infection. To our knowledge, this is the first case report associating urinary tract infection with Capgras-like syndrome. Awareness of the prevalence of delusional misidentification syndromes associated with acute medical illness should promote diligence on the part of clinicians in recognizing this disorder.Keywords: delusional misidentification, Capgras syndrome, urinary tract infection, psychosis
Page 1 /402370
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.