A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
An algebraic framework for the transformation of attributed graphs
Term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A Formal Semantics of UML State Machines Based on Structured Graph Transformation
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
Graph Transformation with Time: Causality and Logical Clocks
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Towards Dynamic Meta Modeling of UML Extensions: An Extensible Semantics for UML Sequence Diagrams
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
UML'00 Proceedings of the 3rd international conference on The unified modeling language: advancing the standard
Graph transformation for domain-specific discrete event time simulation
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Formal real-time model transformations in MOMENT2
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Temporal graph queries to support software evolution
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude
Science of Computer Programming
Hi-index | 0.00 |
Following TER nets, an approach to the modeling of time in high-level Petri nets, we propose a model of time within (attributed) graph transformation systems where logical clocks are represented as distinguished node attributes. Corresponding axioms for the time model in TER nets are generalized to graph transformation systems and semantic variations are discussed. They are summarized by a general theorem ensuring the consistency of temporal order and casual dependencies.The resulting notions of typed graph transformation with time specialize the algebraic double-pushout (DPO) approach to typed graph transformation. In particular, the concurrency theory of the DPO approach can be used in the transfer of the basic theory of TER nets.