IUPC: Identification and Unification of Process Constraints

Business Process Compliance (BPC) has gained significant momentum in research and practice during the last years. Although many approaches address BPC, they mostly assume the existence of some kind of unified base of process constraints and focus on their verification over the business processes. However, it remains unclear how such an inte- grated process constraint base can be built up, even though this con- stitutes the essential prerequisite for all further compliance checks. In addition, the heterogeneity of process constraints has been neglected so far. Without identification and separation of process constraints from domain rules as well as unification of process constraints, the success- ful IT support of BPC will not be possible. In this technical report we introduce a unified representation framework that enables the identifica- tion of process constraints from domain rules and their later unification within a process constraint base. Separating process constraints from domain rules can lead to significant reduction of compliance checking effort. Unification enables consistency checks and optimizations as well as maintenance and evolution of the constraint base on the other side.Comment: 13 pages, 4 figures, technical repor

A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints

We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been formalized in the Coq theorem prover. Our proofs show that finite maps produced by the unification algorithm provide a model of the axioms characterizing idempotent MGUs of lists of constraints. The axioms that serve as the basis for our verification are derived from a standard set by extending them to lists of constraints. For us, constraints are equalities between terms in the language of simple types. Substitutions are formally modeled as finite maps using the Coq library Coq.FSets.FMapInterface. Coq's method of functional induction is the main proof technique used in proving many of the axioms.Comment: In Proceedings UNIF 2010, arXiv:1012.455

Yukawa-unified natural supersymmetry

Previous work on t-b-\tau Yukawa-unified supersymmetry, as expected from SUSY GUT theories based on the gauge group SO(10), tended to have exceedingly large electroweak fine-tuning (EWFT). Here, we examine supersymmetric models where we simultaneously require low EWFT ("natural SUSY") and a high degree of Yukawa coupling unification, along with a light Higgs scalar with m_h\sim125 GeV. As Yukawa unification requires large tan\beta\sim50, while EWFT requires rather light third generation squarks and low \mu\sim100-250 GeV, B-physics constraints from BR(B\to X_s\gamma) and BR(B_s\to \mu+\mu-) can be severe. We are able to find models with EWFT \Delta\lesssim 50-100 (better than 1-2% EWFT) and with Yukawa unification as low as R_yuk\sim1.3 (30% unification) if B-physics constraints are imposed. This may be improved to R_yuk\sim1.2 if additional small flavor violating terms conspire to improve accord with B-constraints. We present several Yukawa-unified natural SUSY (YUNS) benchmark points. LHC searches will be able to access gluinos in the lower 1-2 TeV portion of their predicted mass range although much of YUNS parameter space may lie beyond LHC14 reach. If heavy Higgs bosons can be accessed at a high rate, then the rare H, A\to \mu+\mu- decay might allow a determination of tan\beta\sim50 as predicted by YUNS models. Finally, the predicted light higgsinos should be accessible to a linear e+e- collider with \sqrt{s}\sim0.5 TeV.Comment: 18 pages, 7 figures, pdflatex; 3 references adde

Yukawa coupling unification and non-universal gaugino mediation of supersymmetry breaking

The requirement of Yukawa coupling unification highly constrains the SUSY parameter space. In several SUSY breaking scenarios it is hard to reconcile Yukawa coupling unification with experimental constraints from B(b->s gamma) and the muon anomalous magnetic moment a_mu. We show that b-tau or even t-b-tau Yukawa unification can be satisfied simultaneously with b->s gamma and a_mu in the non-universal gaugino mediation scenario. Non-universal gaugino masses naturally appear in higher dimensional grand unified models in which gauge symmetry is broken by orbifold compactification. Relations between SUSY contributions to fermion masses, b->s gamma and a_mu which are typical for models with universal gaugino masses are relaxed. Consequently, these phenomenological constraints can be satisfied simultaneously with a relatively light SUSY spectrum, compared to models with universal gaugino masses.Comment: 20 pages, 8 figures. References added. A copy of the paper with better resolution figures can be found at http://www.hep.fsu.edu/~balazs/Physics/Papers/2003

Radiatively Generated Maximal Mixing Scenario for the Higgs Mass and the Least Fine Tuned Minimal Supersymmetric Standard Model

We argue that given the experimental constraints on the Higgs mass the least fine tuned parameter space of minimal supersymmetric standard model is with negative stop masses squared at the grand unification scale. While stop mass squared is typically driven to positive values at the weak scale, the contribution to the Higgs mass squared parameter from the running can be arbitrarily small, which reduces fine tuning of electroweak symmetry breaking. At the same time the stop mixing is necessarily enhanced and the maximal mixing scenario for the Higgs mass can be generated radiatively even when starting with negligible mixing at the unification scale. This highly alleviates constraints on possible models for supersymmetry breaking in which fine tuning is absent.Comment: 5pages, 1 color figur