1,222 research outputs found
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)
The languages accepted by finite automata are precisely the languages denoted
by regular expressions. In contrast, finite automata may exhibit behaviours
that cannot be described by regular expressions up to bisimilarity. In this
paper, we consider extensions of the theory of regular expressions with various
forms of parallel composition and study the effect on expressiveness. First we
prove that adding pure interleaving to the theory of regular expressions
strictly increases its expressiveness up to bisimilarity. Then, we prove that
replacing the operation for pure interleaving by ACP-style parallel composition
gives a further increase in expressiveness. Finally, we prove that the theory
of regular expressions with ACP-style parallel composition and encapsulation is
expressive enough to express all finite automata up to bisimilarity. Our
results extend the expressiveness results obtained by Bergstra, Bethke and
Ponse for process algebras with (the binary variant of) Kleene's star
operation.Comment: In Proceedings EXPRESS'10, arXiv:1011.601
Critical behavior at Mott-Anderson transition: a TMT-DMFT perspective
We present a detailed analysis of the critical behavior close to the
Mott-Anderson transition. Our findings are based on a combination of numerical
and analytical results obtained within the framework of Typical-Medium Theory
(TMT-DMFT) - the simplest extension of dynamical mean field theory (DMFT)
capable of incorporating Anderson localization effects. By making use of
previous scaling studies of Anderson impurity models close to the
metal-insulator transition, we solve this problem analytically and reveal the
dependence of the critical behavior on the particle-hole symmetry. Our main
result is that, for sufficiently strong disorder, the Mott-Anderson transition
is characterized by a precisely defined two-fluid behavior, in which only a
fraction of the electrons undergo a "site selective" Mott localization; the
rest become Anderson-localized quasiparticles.Comment: 4+ pages, 4 figures, v2: minor changes, accepted for publication in
Phys. Rev. Let
First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation
In this paper we consider first-order logic theorem proving and model
building via approximation and instantiation. Given a clause set we propose its
approximation into a simplified clause set where satisfiability is decidable.
The approximation extends the signature and preserves unsatisfiability: if the
simplified clause set is satisfiable in some model, so is the original clause
set in the same model interpreted in the original signature. A refutation
generated by a decision procedure on the simplified clause set can then either
be lifted to a refutation in the original clause set, or it guides a refinement
excluding the previously found unliftable refutation. This way the approach is
refutationally complete. We do not step-wise lift refutations but conflicting
cores, finite unsatisfiable clause sets representing at least one refutation.
The approach is dual to many existing approaches in the literature because our
approximation preserves unsatisfiability
Staged Mucosal Advancement Flap versus Staged Fibrin Sealant in the Treatment of Complex Perianal Fistulas
Background. In this prospective randomised study, the staged mucosal advancement flap is compared with staged fibrin sealant application in the treatment of perianal fistulas.
Methods. All patients with high complex cryptoglandular fistulas were randomised to closure of the internal opening by a mucosal advancement flap (MF) or injection with fibrin sealant (FS) after treatment with setons. Recurrence rate and incontinence disorders were explored.
Results. The MF group (5 females and 10 males) with a median age of 51 years and a median followup of 52 months. The FS group (4 females and 11 males) with a median age of 45 years and a median followup of 49 months. Three (20%) patients of the MF group had a recurrent fistula compared to 9 (60%) of the FS group (P = 0.03). No new continence disorders developed.
Conclusion. Staged FS injection has a much lower success rate compared to MF
A Process Algebra for Supervisory Coordination
A supervisory controller controls and coordinates the behavior of different
components of a complex machine by observing their discrete behaviour.
Supervisory control theory studies automated synthesis of controller models,
known as supervisors, based on formal models of the machine components and a
formalization of the requirements. Subsequently, code generation can be used to
implement this supervisor in software, on a PLC, or embedded microprocessor. In
this article, we take a closer look at the control loop that couples the
supervisory controller and the machine. We model both event-based and
state-based observations using process algebra and bisimulation-based
semantics. The main application area of supervisory control that we consider is
coordination, referred to as supervisory coordination, and we give an academic
and an industrial example, discussing the process-theoretic concepts employed.Comment: In Proceedings PACO 2011, arXiv:1108.145
Colonic irrigation for defecation disorders after dynamic graciloplasty
AB - BACKGROUND AND AIMS: Dynamic graciloplasty (DGP) improves anal continence and quality of life for most patients. However, in some patients, DGP fails and fecal incontinence is unsolved or only partially improved. Constipation is also a significant problem after DGP, occurring in 13-90%. Colonic irrigation can be considered as an additional or salvage treatment for defecation disorders after unsuccessful or partially successful DGP. In this study, the effectiveness of colonic irrigation for the treatment of persistent fecal incontinence and/or constipation after DGP is investigated. MATERIALS AND METHODS: Patients with defecation disorders after DGP visiting the outpatient clinic of the University Hospital Maastricht were selected for colonic irrigation as additional therapy or salvage therapy in the period between January 1999 and June 2003. The Biotrol(R) Irrimatic pump or the irrigation bag was used for colonic irrigation. Relevant physical and medical history was collected. The patients were asked to fill out a detailed questionnaire about colonic irrigation. RESULTS: Forty-six patients were included in the study with a mean age of 59.3 +/- 12.4 years (80% female). On average, the patients started the irrigation 21.39 +/- 38.77 months after the DGP. Eight patients started irrigation before the DGP. Fifty-two percent of the patients used the irrigation as additional therapy for fecal incontinence, 24% for constipation, and 24% for both. Irrigation was usually performed in the morning. The mean frequency of irrigation was 0.90 +/- 0.40 times per day. The mean amount of water used for the irrigation was 2.27 +/- 1.75 l with a mean duration of 39 +/- 23 min. Four patients performed antegrade irrigation through a colostomy or appendicostomy, with good results. Overall, 81% of the patients were satisfied with the irrigation. Thirty-seven percent of the patients with fecal incontinence reached (pseudo-)continence, and in 30% of the patients, the constipation completely resolved. Side effects of the irrigation were reported in 61% of the patients: leakage of water after irrigation, abdominal cramps, and distended abdomen. Seven (16%) patients stopped the rectal irrigation. CONCLUSION: Colonic irrigation is an effective alternative for the treatment of persistent fecal incontinence after DGP and/or recurrent or onset constipation additional to unsuccessful or (partially) successful DG
Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints
The monadic shallow linear Horn fragment is well-known to be decidable and
has many application, e.g., in security protocol analysis, tree automata, or
abstraction refinement. It was a long standing open problem how to extend the
fragment to the non-Horn case, preserving decidability, that would, e.g.,
enable to express non-determinism in protocols. We prove decidability of the
non-Horn monadic shallow linear fragment via ordered resolution further
extended with dismatching constraints and discuss some applications of the new
decidable fragment.Comment: 29 pages, long version of CADE-26 pape
- …