Abstract
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic semantics of graph transformation systems is not able to express constrained behaviour we introduce - in analogy to other approaches - a coalgebraic semantics which associates with each system a category of models (deterministic transition systems). Such category has a final object, which includes all finite and infinite transition sequences. The coalgebraic framework makes it possible to introduce a general notion of `logic of behavioural constraints'. Instances include, for example, graphical consistency constraints and temporal logic constraints. We show that the considered semantics can be restricted to a final coalgebra semantics for systems with behavioural constraints. This result can be instantiated in order to obtain a final coalgebra semantics for graph grammars with temporal logic constraints.KeywordsTransition SystemTemporal LogicGraph TransformationLabel Transition SystemDerivation StepThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.