Search results for " In C"
showing 10 items of 586 documents
L'abolizione delle Province in Sicilia: resoconto semiserio di un rivoluzione in progress
2014
Il fenomeno della commoditization nel mercato delle conserve ittiche a base di tonno
2017
Nel complesso scenario competitivo dell’odierno mercato globalizzato nasce la minaccia della commoditization: un processo in cui un prodotto (o un servizio) perde la differenziazione significativa rispetto ai concorrenti. Il prezzo risulta così l’unico parametro di scelta per il consumatore e il prodotto si trasforma in una commodity, diviene cioè “banale”. In una prospettiva empirica, si vuole qui studiare la commoditization nell’industria ittico conserviera del tonno descrivendone le dinamiche e le caratteristiche strutturali che presentano chiari segnali della “banalizzazione”. In particolare, attraverso lo strumento della mappa prezzo-benefici saranno indagati il maturo mercato del tonn…
La metodologia della ricerca in didattica
2021
Il testo descrive le tipologie di ricerca in campo didattico; segnala le aree più rappresentate nel panorama italiano degli ultimi anni e gli ambiti ritenuti prioritari per i prossimi anni; indica una metodologia capace di migliorare la pratica educativa già durante lo svolgimento delle azioni di ricerca; fornisce dei suggerimenti per assicurare la qualità delle ricerche di Didattica indipendentemente dal metodo di indagine adoperato. Le argomentazioni svolte sono animate dalla profonda convinzione che non sia possibile fare ricerca in Didattica senza la collaborazione e il confronto dei ricercatori universitari con gli insegnanti e con gli educatori in generale. The text describes the type…
Краткое обозрѣніе системы мѣръ и денегъ въ Китаѣ
1909
Отдельный оттиск из 2-го выпуска XXIX тома Известий Восточного Института
Commento agli artt. 284, 285, 286, 286 bis c.p.p.
2010
Deciding properties of integral relational automata
1994
This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
2021
One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very versatile variant and have thus seen many different applications over the past 32 years. One of the early stubborn sets works shows how the basic conditions for reduction can be augmented to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a stronger reduction condition and provide extensive new correc…
Minimal Büchi Automata for Certain Classes of LTL Formulas
2009
In this paper we calculate the minimal number of states of Buchi automata which encode some classes of linear temporal logic (LTL) formulas that are frequently used in model checking. Our results may be used for verification of the quality of algorithms which automatically translate LTL formulas into Buchi automata and for improving the quality and speed of such translators. In the last section of this paper we compare our lower-bound estimations to Buchi automata generated by two currently used translators: LTL2BA and SPOT.
Verification of scope-dependent hierarchical state machines
2008
AbstractA hierarchical state machine (Hsm) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (Shsm). We show that Shsms can be exponentially more succinct than Shsms and verification is in general harder by an exponential factor. We carefully establish the computational complexity of reachability, cycle detection, and model checking against general Ltl and Ctl specifications. We also discuss some natural and interesting restrictions of the considered problems for which we can …
Boolean operations mediated by an ion-pair receptor of a multi-readout molecular logic gate
2013
A heteroditopic BODIPY dye that performs all basic Boolean operations with a cation (K+) and an anion (F-) as inputs and absorption, transmission and fluorescence as outputs is described. The molecular logic gate can also act as a digital comparator between the inputs.