Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework

Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework

Sesqui-pushout (SqPO) rewriting is a variant of transformations of graph-like and other types of structures that fit into the framework of adhesive categories where deletion in unknown context may be implemented. We provide the first account of a concurrency theorem for this important type of rewrit...

Full description

Bibliographic Details
Main Author: Nicolas Behr
Format: Article
Language:English
Published: Open Publishing Association 2019-12-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1904.08357v2
id doaj-d3a3544205f745f092c707fec6dddff0
record_format Article
spelling doaj-d3a3544205f745f092c707fec6dddff02020-11-25T01:18:00ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802019-12-01309Proc. GCM 2019235210.4204/EPTCS.309.2:3Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra FrameworkNicolas Behr0 Université de Paris, IRIF, CNRS Sesqui-pushout (SqPO) rewriting is a variant of transformations of graph-like and other types of structures that fit into the framework of adhesive categories where deletion in unknown context may be implemented. We provide the first account of a concurrency theorem for this important type of rewriting, and we demonstrate the additional mathematical property of a form of associativity for these theories. Associativity may then be exploited to construct so-called rule algebras (of SqPO type), based upon which in particular a universal framework of continuous-time Markov chains for stochastic SqPO rewriting systems may be realized.http://arxiv.org/pdf/1904.08357v2
collection DOAJ
language English
format Article
sources DOAJ
author Nicolas Behr
spellingShingle Nicolas Behr
Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework
Electronic Proceedings in Theoretical Computer Science
author_facet Nicolas Behr
author_sort Nicolas Behr
title Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework
title_short Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework
title_full Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework
title_fullStr Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework
title_full_unstemmed Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework
title_sort sesqui-pushout rewriting: concurrency, associativity and rule algebra framework
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2019-12-01
description Sesqui-pushout (SqPO) rewriting is a variant of transformations of graph-like and other types of structures that fit into the framework of adhesive categories where deletion in unknown context may be implemented. We provide the first account of a concurrency theorem for this important type of rewriting, and we demonstrate the additional mathematical property of a form of associativity for these theories. Associativity may then be exploited to construct so-called rule algebras (of SqPO type), based upon which in particular a universal framework of continuous-time Markov chains for stochastic SqPO rewriting systems may be realized.
url http://arxiv.org/pdf/1904.08357v2
work_keys_str_mv AT nicolasbehr sesquipushoutrewritingconcurrencyassociativityandrulealgebraframework
_version_ 1725144350402281472

Similar Items