Sesqui-Pushout Rewriting

Sesqui-pushout (SqPO) rewriting-sesqui means one and a half in Latin-is a new algebraic approach to abstract rewriting in any category. SqPO rewriting is a deterministic and conservative extension of double-pushout (DPO) rewriting, which allows to model deletion in unknown context, a typical feature of single-pushout (SPO) rewriting, as well as cloning. After illustrating the expressiveness of the proposed approach through a case study modelling an access control system, we discuss sufficient conditions for the existence of final pullback complements and we analyze the relationship between SqPO and the classical DPO and SPO approaches.

[1]  Wolfram Kahl.  A Fibred Approach to Rewriting | How the Duality between Adding and Deleting Cooperates with the Diierence between Matching and Rewriting , 1997 .

[2]  Ravi S. Sandhu,et al.  Role-Based Access Control Models , 1996, Computer.

[3]  Hartmut Ehrig,et al.  Parallelism and concurrency in high-level replacement systems , 1991, Mathematical Structures in Computer Science.

[4]  Frédéric Cuppens,et al.  Computer Security - ESORICS 2000 , 2000, Lecture Notes in Computer Science.

[5]  Michael Löwe,et al.  Algebraic Approach to Single-Pushout Graph Transformation , 1993, Theor. Comput. Sci..

[6]  Jeffrey D. Ullman,et al.  Protection in operating systems , 1976, CACM.

[7]  Reiko Heckel,et al.  Double-Pullback Transitions and Coalgebraic Loose Semantics for Graph Transformation Systems , 2001, Appl. Categorical Struct..

[8]  Hartmut Ehrig,et al.  Categorical principles, techniques and results for high-level-replacement systems in computer science , 1993, Appl. Categorical Struct..

[9]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[10]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach , 1997, Handbook of Graph Grammars.

[11]  Annegret Habel,et al.  Double-pushout graph transformation revisited , 2001, Mathematical Structures in Computer Science.

[12]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

[13]  Joan Torrens,et al.  Single-pushout rewriting in categories of spans I: the general setting , 1997 .

[14]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[15]  R. Goldblatt.  Topoi, the Categorial Analysis of Logic , 1979 .

[16]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[17]  Richard Kennaway,et al.  Graph Rewriting in Some Categories of Partial Morphisms , 1990, Graph-Grammars and Their Application to Computer Science.

[18]  Edmund Robinson,et al.  Categories of Partial Maps , 1988, Inf. Comput..

[19]  Michel Bauderon,et al.  A Uniform Approach to Graph Rewriting: The Pullback Approach , 1995, WG.

[20]  Pawel Sobocinski,et al.  Adhesive and quasiadhesive categories , 2005, RAIRO Theor. Informatics Appl..

[21]  Roy Dyckhoff,et al.  Exponentiable morphisms, partial products and pullback complements , 1987 .

[22]  Luigi V. Mancini,et al.  A Formal Model for Role-Based Access Control Using Graph Transformation , 2000, ESORICS.