IMT Institutional Repository: No conditions. Results ordered -Date Deposited. 2021-10-22T19:09:34ZEPrintshttp://eprints.imtlucca.it/images/logowhite.pnghttp://eprints.imtlucca.it/2011-06-06T09:03:49Z2011-09-19T10:00:54Zhttp://eprints.imtlucca.it/id/eprint/323This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3232011-06-06T09:03:49ZAGILE: Software Architecture for MobilityArchitecture-based approaches have been promoted as a means of controlling the complexity of system construction and evolution, in particular for providing systems with the agility required to operate in turbulent environments and to adapt very quickly to changes in the enterprise world. Recent technological advances in communication and distribution have made mobility an additional factor of complexity, one for which current architectural concepts and techniques can be hardly used. The AGILE project is developing an architectural approach in which mobility aspects can be modelled explicitly and mapped on the distribution and communication topology made available at physical levels. The whole approach is developed over a uniform mathematical framework based on graph-oriented techniques that support sound methodological principles, formal analysis, and refinement. This paper describes the AGILE project and some of the results gained during the first project year. Luis Filipe AndradePaolo BaldanHubert BaumeisterRoberto BruniAndrea CorradiniRocco De Nicolar.denicola@imtlucca.itJose Luiz FiadeiroFabio GadducciStefania GnesiPiotr HoffmanNora KochPiotr KosiuczenkoAlessandro LapadulaDiego LatellaAntonia LopesMichele LoretiMieke MassinkFranco MazzantiUgo MontanariCristóvão OliveiraRosario PuglieseAndrzej TarleckiMichel WermelingerMartin WirsingArtur Zawlocki2011-03-07T14:27:54Z2011-07-11T14:34:34Zhttp://eprints.imtlucca.it/id/eprint/159This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/1592011-03-07T14:27:54ZA Temporal Graph Logic for Verification of Graph Transformation SystemsWe extend our approach for verifying properties of graph transformation systems using suitable abstractions. In the original approach properties are specified as formulae of a propositional temporal logic whose atomic predicates are monadic second-order graph formulae. We generalize this aspect by considering more expressive logics, where edge quantifiers and temporal modalities can be interleaved, a feature which allows, e.g., to trace the history of objects in time. This requires the use of graph transition systems, a generalization of transition systems where states and transitions are mapped to graphs and graph morphisms, respectively, and of a corresponding notion of abstraction. After characterizing fragments of the logic which can be safely checked on the approximations, we show how the verification of the logic over graph transformation systems can be reduced to the verification of a logic over suitably defined Petri nets.
Paolo BaldanAndrea CorradiniBarbara KönigAlberto Lluch-Lafuentealberto.lluch@imtlucca.it