652 research outputs found

    GEOGRAFIE DEL VINO: COSTRUZIONE STORICA E PATRIMONIALIZZAZIONE DEI PAESAGGI VITICOLI

    No full text
    This research project is supposed to face up viticulture in a complex, epistemological framework. As Dickenson and Salt affirm the geography of the wine «may be studied from a variety of perspectives and encompasses the influence of the physical environment, historical diffusion of the vine and viticulture, economic geographies of cultivation and marketing, political influences on trade and production, and cultural perceptions of landscapes, product and people». After all, already in the Latin etymology of viticulture exists a deep content hiatus that imposes to consider two fair enough different concepts; indeed, culture may refer to cultivation and care. Therefore, it is crucial to understand how viticulture must be considered and to show the way its dichotomic nature may suggest distant methodologies of investigation. After having underlined the epistemological framework of viticulture in relationship to geography and given the interpretative tools of the research, I analyzed the construction and the evolution of some viticultural landscapes (Montalcino, Barolo, Bolgheri and the Côte d’Or) whose choice depends on the dynamics that regarded their production (characterized by a particular propensity to commercialization), the relationships and the differences among them and finally the essential relationship that wine creates with its territory of origin. The role of the tradition represents the fil rouge that links these experiences and it declines in a different perspective according to the realities I analyzed. However, for each of them, it has been fundamental the role developed by a forerunner; indeed, Ferruccio Biondi for Brunello di Montalcino, Juliette Colbert-Falletti for Barolo and Mario Incisa della Rocchetta for the Sassicaia have not only contributed to the creation of a wine but generally to the development of a whole territory that is identified today in the cultivation of the grapevine. Finally, in virtue of such a rooted and shared historical construction, these territories take part in the processes of patrimonialization that are characterizing some wine regions to a global scale. Following different criterions of classification, where however viticulture covers a preponderant aspect, Val d’Orcia, Langhes and the climats de Bourgogne are considered from the UNESCO a human world heritage to safeguard while Bolgheri has been inserted by Regione Tuscana in the catalog of the historical rural landscapes; in all these cases, independently from who promoted the patrimonialization, the aim is clear: to allow the future generations to enjoy the cultural and environmental wealth that distinguish them. The wine landscapes are reported to be the ones that underwent fast and important transformations. Moving from this, I underline the debate around the relationship between patrimonialization (considered as a specific process of conservation) and the general transformation of the landscape. From this perspective, the criterions of patrimonialization adopted for the viticultural landscapes seem not to consider the eventuality of one change in the case wine shouldn’t play the social and economic role that it has nowadays. What would it happen in that case

    Monitoring data-aware business constraints with finite state automata

    No full text
    Checking the compliance of a business process execution with respect to a set of regulations is an important issue in several settings. A common way of representing the expected behavior of a process is to describe it as a set of business con-straints. Runtime verification and monitoring facilities allow us to continuously determine the state of constraints on the current process execution, and to promptly detect violations at runtime. A plethora of studies has demonstrated that in several settings business constraints can be formalized in terms of temporal logic rules. However, in virtually all exist-ing works the process behavior is mainly modeled in terms of control-flow rules, neglecting the equally important data perspective. In this paper, we overcome this limitation by presenting a novel monitoring approach that tracks streams of process events (that possibly carry data) and verifies if the process execution is compliant with a set of data-aware business constraints, namely constraints not only referring to the temporal evolution of events, but also to the temporal evolution of data. The framework is based on the formal specification of business constraints in terms of first-order linear temporal logic rules. Operationally, these rules are translated into finite state automata for dynamically rea-soning on partial, evolving execution traces. We show the versatility of our approach by formalizing (the data-aware extension of) Declare, a declarative, constraint-based process modeling language, and by demonstrating its application on a concrete case dealing with web security

    Dispersal of methicillin resistant Staphylococcus aureus (MRSA) in a burn intensive care unit

    No full text
    Methicillin resistant Staphylococcus aureus (MRSA) is a pathogen of special concern in intensive care units (ICUs). The burn units are a very susceptible habitat to colonization and infection events by this organism. In this paper isolation of MRSA from a sepsis case and from samples of the care unit air is described, along with simultaneous circulation of two clones of MRSA. Some peculiar epidemiological features of MRSA in burn intensive care wards are confirmed

    Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness

    No full text
    In this paper we study when an LTL formula on finite traces (LTLf formula)isinsensitivetoinfiniteness,thatis,itcanbe correctly handled as a formula on infinite traces under the assumption that at a certain point the infinite trace starts re- peating an end event forever, trivializing all other propositions to false. This intuition has been put forward and (wrongly) assumed to hold in general in the literature. We define a neces- sary and sufficient condition to characterize whether an LTLf formula is insensitive to infiniteness, which can be automati- cally checked by any LTL reasoner. Then, we show that typical LTLf specificationpatternsusedinprocessandservicemod- eling in CS, as well as trajectory constraints in Planning and transition-basedLTLf specificationsofactiondomainsinKR, are indeed very often insensitive to infiniteness. This may help to explain why the assumption of interpreting LTL on finite and on infinite traces has been (wrongly) blurred. Possibly be- cause of this blurring, virtually all literature detours to Bu ̈chi automata for constructing the NFA that accepts the traces satis- fying an LTLf formula. As a further contribution, we give a simple direct algorithm for computing such NFA

    Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces

    No full text
    Runtime monitoring is a central operational decision support task in business process management. It helps process executors to check on-the-fly whether a running process instance satisfies business constraints of interest, providing an immediate feedback when deviations occur. We study runtime monitoring of properties expressed in ltlf, a variant of the classical ltl (Linear-time Temporal Logic) that is interpreted over finite traces, and in its extension ldlf, a powerful logic obtained by combining ltlf with regular expressions. We show that ldlf is able to declaratively express, in the logic itself, not only the constraints to be monitored, but also the de facto standard rv-LTL monitors. On the one hand, this enables us to directly employ the standard characterization of ldlf based on finite-state automata to monitor constraints in a fine-grained way. On the other hand, it provides the basis for declaratively expressing sophisticated metaconstraints that predicate on the monitoring state of other constraints, and to check them by relying on standard logical services instead of ad hoc algorithms. We then report on how this approach has been effectively implemented using Java to manipulate ldlf formulae and their corresponding monitors, and the RuM rule mining suite as underlying infrastructure

    Abducing Compliance of Incomplete Event Logs

    No full text
    The capability to store data about business processes execution in so-called Event Logs has brought to the diffusion of tools for the analysis of process executions and for the assessment of the goodness of a process model. Nonetheless, these tools are often very rigid in dealing with Event Logs that include incomplete information about the process execution. Thus, while the ability of handling incomplete event data is one of the challenges mentioned in the process mining manifesto, the evaluation of compliance of an execution trace still requires an end-to-end complete trace to be performed. This paper exploits the power of abduction to provide a flexible, yet computationally effective, framework to deal with different forms of incompleteness in an Event Log. Moreover it proposes a refinement of the classical notion of compliance into strong and conditional compliance to take into account incomplete logs

    Declarative Process Models: Different Ways to Be Hierarchical

    No full text
    In the literature, hierarchical dimensions for procedural process models have been widely investigated as they provide different ways to relate, organize and classify models. Such a categorization is based on the dimensions of inheritance, behavioral equivalence, and modularization and can be used to better understand and modify models as well as handle their complexity. Unfortunately, in the context of declarative process models hierarchical dimensions have been sparsely investigated. This paper addresses such a research gap. More specifically, we study a formal semantics for the dimensions above and show how they naturally induce hierarchies on a declarative process language based on declare

    Discovering hybrid process models with bounds on time and complexity

    No full text
    Discovering process models from event data is a highly relevant, but also a notoriously difficult, problem. Therefore, it is unsurprising that the biggest share of process mining research is devoted to process discovery. While techniques reported in scientific literature tend to produce process models that are formal, i.e., which mathematically describe the possible behaviors, commercial process mining tools return informal models (merely a “picture” not allowing for any form of formal reasoning). Hybrid process models aim at combining the best of both worlds: they capture behavior that is strongly supported by data and that can be used for formal reasoning, as well as behavior that cannot be represented in clear-cut process constructs or that does not have enough evidence in the data. This paper presents an approach for discovering hybrid Petri nets, which, unlike existing techniques, produces models that have both formal and semi-formal constructs so that even if the behavior in the data is noisy and irregular or it does not fit predefined constructs, causal relationships are still captured. Our evaluation demonstrates the advantages of combining such “deliberate vagueness” with formal guarantees. The ideas presented here are fairly general, and can serve as a foundation for other, new hybrid discovery techniques
    corecore