Advertisement
Published in:
2010 | OriginalPaper | Chapter
Vicinity Respecting Homomorphisms for Abstracting System Requirements
Authors : Jörg Desel, Agathe Merceron
Published in: Transactions on Petri Nets and Other Models of Concurrency IV
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper is concerned with structuring system requirements on an abstract conceptual level. Channel/Agency Petri nets are taken as a formal model. They allow to represent functional aspects as well as data aspects of the requirements in a graphical way. Vicinity respecting homomorphisms are presented as a means to refine and abstract these nets. They preserve paths, i.e., dependencies between computational elements and they preserve important structural properties of nets, such as S- and T-components, siphons and traps and the free choice property. These properties have important interpretations for marked Petri nets and can therefore be used for the analysis of system models at more concrete levels.