Petri Nets
- 1 September 1977
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 9 (3), 223-252
- https://doi.org/10.1145/356698.356702
Abstract
Summary:The organizational structure is usually defined using the best experience and there is a minimum of formal approach involved. This paper shows the possibilities of the theory of concept analysis that can help to understand organizational structure based on solid mathematical foundations. This theory is extended by the concept of knowledge sharing and diversity that enables to evaluate the organizational structure. The alternative approach based on the hierarchical methods of cluster analysis is employed for the purposes of comparisonKeywords
This publication has 13 references indexed in Scilit:
- The decidability of the reachability problem for vector addition systems (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1977
- Computation sequence setsJournal of Computer and System Sciences, 1976
- Formal verification of parallel programsCommunications of the ACM, 1976
- Look-Ahead ProcessorsACM Computing Surveys, 1975
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975
- A partial solution to the reachability-problem for vector-addition systemsPublished by Association for Computing Machinery (ACM) ,1974
- Petri nets and speed independent designCommunications of the ACM, 1973
- A Survey of Some Theoretical Aspects of MultiprocessingACM Computing Surveys, 1973
- Marked directed graphsJournal of Computer and System Sciences, 1971
- Analysis of Programs for Parallel ProcessingIEEE Transactions on Electronic Computers, 1966