Architectural abstraction as transformation of poset labelled graphs

Denford, M; Solomon, A; Leaney, J; O'Neill, T

Architectural abstraction as transformation of poset labelled graphs

Denford, M Solomon, A Leaney, J

O'Neill, T

Permalink

Publication Type:: Journal Article
Citation:: Journal of Universal Computer Science, 2004, 10 (10), pp. 1408 - 1428
Issue Date:: 2004-12-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (130.15 kB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Denford, M	en_US
dc.contributor.author	Solomon, A	en_US
dc.contributor.author	Leaney, J https://orcid.org/0000-0001-5009-0401	en_US
dc.contributor.author	O'Neill, T	en_US
dc.date.issued	2004-12-01	en_US
dc.identifier.citation	Journal of Universal Computer Science, 2004, 10 (10), pp. 1408 - 1428	en_US
dc.identifier.uri	http://hdl.handle.net/10453/8302
dc.description.abstract	The design of large, complex computer based systems, based on their architecture, will benefit from a formal system that is intuitive, scalable and accessible to practitioners. The work herein is based in graphs which are an efficient and intuitive way of encoding structure, the essence of architecture. A model of system architectures and architectural abstraction is proposed, using poset labelled graphs and their transformations. The poset labelled graph formalism closely models several important aspects of architectures, namely topology, type and levels of abstraction. The technical merits of the formalism are discussed in terms of the ability to express and use domain knowledge to ensure sensible refinements. An abstraction / refinement calculus is introduced and illustrated with a detailed usage scenario. The paper concludes with an evaluation of the formalism in terms of its rigour, expressiveness, simplicity and practicality. © J.UCS.	en_US
dc.relation.ispartof	Journal of Universal Computer Science	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Architectural abstraction as transformation of poset labelled graphs	en_US
dc.type	Journal Article
utslib.citation.volume	10	en_US
utslib.for	080302 Computer System Architecture	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	08 Information and Computing Sciences	en_US
dc.location.activity	ISI:000231433800004	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - HCTD - Human Centred Technology Design
utslib.copyright.status	open_access
pubs.issue	10	en_US
pubs.publication-status	Published	en_US
pubs.volume	10	en_US

Abstract:

The design of large, complex computer based systems, based on their architecture, will benefit from a formal system that is intuitive, scalable and accessible to practitioners. The work herein is based in graphs which are an efficient and intuitive way of encoding structure, the essence of architecture. A model of system architectures and architectural abstraction is proposed, using poset labelled graphs and their transformations. The poset labelled graph formalism closely models several important aspects of architectures, namely topology, type and levels of abstraction. The technical merits of the formalism are discussed in terms of the ability to express and use domain knowledge to ensure sensible refinements. An abstraction / refinement calculus is introduced and illustrated with a detailed usage scenario. The paper concludes with an evaluation of the formalism in terms of its rigour, expressiveness, simplicity and practicality. © J.UCS.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/8302