Resource-Bound Quantification for Graph Transformation

Details Resource-Bound Quantification for Graph Transformation Resource-Bound Quantification for Graph Transformation

2010-03-29

arxiv.org/abs/1003.5512v1

EPTCS 22, 2010, pp. 14-25

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.22.2

Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can be characterised algebraically as construction of a double-pushout (DPO) diagram in the category of graphs. We show how intuitionistic linear logic can be extended with resource-bound quantification, allowing for an implicit handling of the DPO conditions, and how resource logic can be used to reason about graph transformation systems.

Affiliated with

Also associated with

No associations

Rating

Resource-Bound Quantification for Graph Transformation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Resource-Bound Quantification for Graph Transformation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Resource-Bound Quantification for Graph Transformation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499669