Algebra of Parametrised Graphs

  1. Lookup NU author(s)
  2. Dr Andrey Mokhov
  3. Dr Victor Khomenko
  4. Arseniy Alekseyev
  5. Professor Alex Yakovlev
Author(s)Yakovlev A; Khomenko V; Mokhov A; Alekseyev A
Publication type Report
Series TitleSchool of Computing Science Technical Report Series
DateDecember 2011
Report Number1307
Full text is available for this publication:
One of the difficulties in designing modern hardware systems is the necessity to comprehend and to deal with a very large number of system configurations, operational modes, and behavioural scenarios. It is often infeasible to consider and specify each individual mode explicitly, and one needs methodologies and tools to exploit similarities between the individual modes and work with groups of modes rather than individual ones. The modes and groups of modes have to be managed in a compositional way: the specification of the system should be composed from specifications of its blocks. This includes both structural and behavioural composition. Furthermore, one should be able to transform and optimise the specifications in a fully formal and natural way. In this paper we propose a new formalism, called Parametrised Graphs. It extends the existing Conditional Partial Order Graphs (CPOGs) formalism in several ways. First, it deals with general graphs rather than just partial orders. Moreover, it is fully compositional. To achieve this we introduce an algebra of Parametrised Graphs by specifying the equivalence relation by a set of axioms, which is proved to be sound, minimal and complete. This allows one to manipulate the specifications as algebraic expressions using the rules of this algebra. We demonstrate the usefulness of the developed formalism on two case studies coming from the area of microelectronics design.
InstitutionSchool of Computing Science, University of Newcastle upon Tyne
Place PublishedNewcastle upon Tyne
ActionsLink to this publication