Conceptual modeling of concurrent systems through stepwise abstraction and refinement using petri net morphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2813, Issue , 2003, Pages 433-445

  Mikolajczak, Boleslaw ^a,b   Wang, Zuyan ^a  

^a UNIVERSITY OF MASSACHUSETTS DARTMOUTH   (United States)

^b POLISH JAPANESE INSTITUTE OF INFORMATION TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATA MINING;

ABSTRACTION REFINEMENT; BEHAVIORAL PROPERTIES; BOTTOM UP APPROACH; COMPLEX CONCURRENT SYSTEMS; CONCEPTUAL MODEL; CONCURRENT SYSTEMS; DISTRIBUTED SYSTEMS; MORPHISMS;

PETRI NETS;

EID: 0142187812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39648-2_34     Document Type: Article

References (16)

1. Bednarczyk, M. A.; Borzyszkowski, A. M., General Morphisms of Petri nets, Lecture Notes in Computer Science, vol. 1644: Automata, Languages and Programming, Springer-Verlag 1999.
2. Desel, J, Merceron, A., Vicinity Rrespecting Net Morphisms Lecture Notes in Computer Science, vol. 483: Advances in Petri nets, pp. 165-185, Springer-Verlag, 1991.
3. Desel, J., Merceron, A., Vicinity Rrespecting Homomorphisms for Abstracting System Requirements, Bericht 337., Karlsruhe, 1996.
4. Devillers, R., Klaudel, H., Riemann, R. C., General Refinement for High Level Petri Nets, Lecture Notes in Computer Science, vol. 1346, Foundations of Software Technology and Computer Science pp. 297-311, Springer-Verlag, 1997.
5. Fehling, R., A Concept of Hierarchical Petri nets with Building Blocks, The 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pp. 370-389, June 1991.
6. Girault, C., Valk, R., Petri Nets for Systems Engineering: a Guide to Modeling, Verification, and Applications, Springer, 2003.
7. Lakos, C., Composing Abstraction of Colored Petri nets, Lecture Notes in Computer Science, vol. 1825: Application and Theory of Petri nets, pp. 323-345, Springer-Verlag, 2000.
8. Mikolajczak, B. A Parallel Algorithm for Computing all Homomorphisms of Deterministic Finite Automata, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.22, Parallel Processing of Discrete Optimization Problems, American Mathematical Society, 1994.
9. http://www.nist.gov/dads
10. Petri, C.A., Introduction to General Net Theory Net and Applications, Lecture Notes in Computer Science, W. Brauer (ed.), pp. 1-19, Springer-Verlag, 1980.
11. Padberg, J., Gajewsky, M.;, Ermel, C., Rule-based Refinement of High-level Nets Preserving Safety Properties, Lecture Notes in Computer Science, vol. 1382, Fundamental Approaches to Software Engineering, pp. 221-238, Springer-Verlag, 1998.
12. www.renew.de
13. Reisig, W., Petri Nets,An Iintroduction, Springer-Verlag, 1985.
14. Reisig, W., Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets, Springer Verlag, 1998.
15. Wang, Zuyan, Morphisms of Petri Nets and their Role in Formal Modeling of Concurrent Systems, Master Project, UMASS Dartmouth, May 2002.
16. Winskel, G. Petri Nets, Algebras, Morphisms and Compositionality, Information and Computation, 72: pp. 197-238, 1987.