Retractable Contracts

In calculi for modelling communication protocols, internal and external choices play dual roles. Two external choices can be viewed naturally as dual too, as they represent an agreement between the communicating parties. If the interaction fails, the past agreements are good candidates as points where to roll back, in order to take a different agreement. We propose a variant of contracts with synchronous rollbacks to agreement points in case of deadlock. The new calculus is equipped with a compliance relation which is shown to be decidable.Comment: In Proceedings PLACES 2015, arXiv:1602.0325

An expressive completeness theorem for coalgebraic modal mu-calculi

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas. More specifically, we investigate whether the coalgebraic mu-calculus is the bisimulation-invariant fragment of the monadic second-order language for a given functor. Using automatatheoretic techniques and building on recent results by the third author, we show that in order to provide such a characterization result it suffices to find what we call an adequate uniform construction for the coalgebraic type functor. As direct applications of this result we obtain a partly new proof of the Janin-Walukiewicz Theorem for the modal mu-calculus, avoiding the use of syntactic normal forms, and bisimulation invariance results for the bag functor (graded modal logic) and all exponential polynomial functors (including the "game functor"). As a more involved application, involving additional non-trivial ideas, we also derive a characterization theorem for the monotone modal mu-calculus, with respect to a natural monadic second-order language for monotone neighborhood models.Comment: arXiv admin note: substantial text overlap with arXiv:1501.0721

Sound and complete axiomatizations of coalgebraic language equivalence

Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and complete with respect to behavioral equivalence can be extended to a coarser coalgebraic language equivalence, which arises from a generalised powerset construction that determinises coalgebras. We show that soundness and completeness are established by proving that expressions modulo axioms of a calculus form the rational fixpoint of the given type functor. Our main result is that the rational fixpoint of the functor $FT$, where $T$ is a monad describing the branching of the systems (e.g. non-determinism, weights, probability etc.), has as a quotient the rational fixpoint of the "determinised" type functor $\bar F$, a lifting of $F$ to the category of $T$-algebras. We apply our framework to the concrete example of weighted automata, for which we present a new sound and complete calculus for weighted language equivalence. As a special case, we obtain non-deterministic automata, where we recover Rabinovich's sound and complete calculus for language equivalence.Comment: Corrected version of published journal articl

Towards Tractable Algebras for Bags

AbstractBags, i.e., sets with duplicates, are often used to implement relations in database systems. In this paper, we study the expressive power of algebras for manipulating bags. The algebra we present is a simple extension of the nested relation algebra. Our aim is to investigate how the use of bags in the language extends its expressive power and increases its complexity. We consider two main issues, namely (i) the impact of the depth of bag nesting on the expressive power and (ii) the complexity and the expressive power induced by the algebraic operations. We show that the bag algebra is more expressive than the nested relation algebra (at all levels of nesting), and that the difference may be subtle. We establish a hierarchy based on the structure of algebra expressions. This hierarchy is shown to be highly related to the properties of the powerset operator

Symptomatic Subcapsular and Perinephric Hematoma Following Ureteroscopic Lithotripsy for Renal Calculi

Objective: Ureteroscopic lithotripsy (URSL) is believed to be associated with less risk of symptomatic renal hematoma than extracorporeal shockwave lithotripsy (SWL) and percutaneous nephrolithotomy (PCNL). We sought to document the rate of and risk factors for this rare complication following URSL for renal calculi. Methods: With Institutional Review Board approval, we reviewed 1087 cases of URSL performed between July 2009 and October 2012 for four surgeons. We identified cases for renal calculi complicated by symptomatic ?hematoma? by searching electronic medical records of patients undergoing URSL with a web-based search tool and cross-referencing with a departmental quality improvement database for postoperative complications. Chi-squared tests were used to assess risk factors. Results: Among 877 renal units exposed to URSL for renal calculi, 4 were complicated by symptomatic subcapsular hematomas (SH) and 3 by symptomatic perinephric hematomas (PH), yielding a 0.5% and 0.3% rate for each complication, respectively. Pain was the primary presenting symptom. Almost all cases presented within 24 to 48 hours postop. Two PH patients required postoperative blood transfusion. Four patients (two SH, two PH) were hospitalized for observation. Ureteral sheaths were used in two cases (one PH and one SH). There was no association with age, diabetes, body mass index (BMI), or operative duration (p-values all>0.05). However, hematoma did correlate with female gender, preoperative hypertension, preoperative ureteral stenting, intraoperative ureteral sheath use, and postoperative ureteral stenting (all p-values<0.0001). Conclusions: While symptomatic hematoma is a complication of URSL, the rate of such outcome (0.8%) is far less than that reported by prior series with SWL and PCNL. This may partially be attributable to collection biases, where subclinical cases are not imaged, or anchoring biases, where clinicians attribute symptoms to another possible etiology. This outcome can be morbid, but can often be conservatively managed with observation.Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/140379/1/end.2014.0176.pd

A language for multiplicative-additive linear logic

A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive categories with additives. It is also shown that proof equivalence is decidable by showing that the cut elimination rewrites supply a confluent rewriting system modulo equations.Comment: 16 pages without appendices, 30 with appendice

Incremental View Maintenance For Collection Programming

In the context of incremental view maintenance (IVM), delta query derivation is an essential technique for speeding up the processing of large, dynamic datasets. The goal is to generate delta queries that, given a small change in the input, can update the materialized view more efficiently than via recomputation. In this work we propose the first solution for the efficient incrementalization of positive nested relational calculus (NRC+) on bags (with integer multiplicities). More precisely, we model the cost of NRC+ operators and classify queries as efficiently incrementalizable if their delta has a strictly lower cost than full re-evaluation. Then, we identify IncNRC+; a large fragment of NRC+ that is efficiently incrementalizable and we provide a semantics-preserving translation that takes any NRC+ query to a collection of IncNRC+ queries. Furthermore, we prove that incremental maintenance for NRC+ is within the complexity class NC0 and we showcase how recursive IVM, a technique that has provided significant speedups over traditional IVM in the case of flat queries [25], can also be applied to IncNRC+.Comment: 24 pages (12 pages plus appendix