Petr nets, algebras, morphisms, and compositionality
Information and Computation
Petri nets in software engineering
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Information and Computation
Vicinity respecting net morphisms
APN 90 Proceedings on Advances in Petri nets 1990
Morphisms to preserve structural properties of Petri nets
Proceedings of the 13th international conference on Computer science 2 : research and applications: research and applications
Information systems engineering: a formal approach
Information systems engineering: a formal approach
Specification and Analysis of System Architecture Using Rapide
IEEE Transactions on Software Engineering - Special issue on software architecture
Free choice Petri nets
Primer in Petri Net Design
Introduction to General Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
A Dictionary of Some Basic Notions of Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Elements of General Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
Refinement of Actions in Causality Based Models
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Composing abstractions of coloured Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
| Hi-index | 0.00 |
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.