1,148 research outputs found

    Safety and Liveness of Quantitative Automata

    Get PDF
    The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totally-ordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications

    Regular Methods for Operator Precedence Languages

    Get PDF
    The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time

    Safety and Liveness of Quantitative Automata

    Full text link
    The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totally-ordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications.Comment: Full version of the paper to appear in CONCUR 202

    A caveolin-binding domain in the HCN4 channels mediates functional interaction with caveolin proteins

    Get PDF
    Pacemaker (HCN) channels have a key role in the generation and modulation of spontaneous activity of sinoatrial node myocytes. Previous work has shown that compartmentation of HCN4 pacemaker channels within caveolae regulates important functions, but the molecular mechanism responsible is still unknown. HCN channels have a conserved caveolin-binding domain (CBD) composed of three aromatic amino acids at the N-terminus; we sought to evaluate the role of this CBD in channel-protein interaction by mutational analysis. We generated two HCN4 mutants with a disrupted CBD (Y259S, F262V) and two with conservative mutations (Y259F, F262Y). In CHO cells expressing endogenous caveolin-1 (cav-1), alteration of the CBD shifted channels activation to more positive potentials, slowed deactivation and made Y259S and F262V mutants insensitive to cholesterol depletion-induced caveolar disorganization. CBD alteration also caused a significant decrease of current density, due to a weaker HCN4-cav-1 interaction and accumulation of cytoplasmic channels. These effects were absent in mutants with a preserved CBD. In caveolin-1-free fibroblasts, HCN4 trafficking was impaired and current density reduced with all constructs; the activation curve of F262V was not altered relative to wt, and that of Y259S displayed only half the shift than in CHO cells. The conserved CBD present in all HCN isoforms mediates their functional interaction with caveolins. The elucidation of the molecular details of HCN4-cav-1 interaction can provide novel information to understand the basis of cardiac phenotypes associated with some forms of caveolinopathies

    Characterization Measurements of Sapphire and Diamond based KIDs for Polarimetric Plasma Diagnostics

    Get PDF

    Land rent values determinants: a Hedonic Pricing approach at local scale

    Get PDF
    Farmland values are driven by a complex set of factors. Starting from the idea that land rent values may reflect several characteristics both internal and external to agricultural sector, the paper has implemented a hedonic model based on land rent values in the metropolitan area of Milan, Northern Italy, assessing the influence of climate, soil, territorial and farm variables on a sample of farms. The model is based on data at rent contract level, matched with data at farm and municipal scale retrieved from different sources. Results confirm that land rent prices are affected by some climate variables, along with territorial and farm characteristics
    • …
    corecore