A short story on action refinement
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1337)
This note presents a meaningful example — concerning a communication protocol — how congruence results for action refinement should be applied.
KeywordsShared Variable Parallel Composition Firing Sequence Note Comp Action Refinement
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [BGV91]W. Brauer, R. Gold, and W. Vogler. A survey of behaviour and equivalence preserving refinement of Petri nets. In G. Rozenberg, editor, Advances in Petri Nets 1990, Lect. Notes Comp. Sci. 483, 1–46. Springer, 1991.Google Scholar
- [GG91]U. Goltz and N. Götz. Modelling a simple communication protocol in a language with action refinement, 1991. Unpublished manuscript.Google Scholar
- [Gor91]R. Gorrieri. Refinement, atomicity and transactions for process description languages. PhD thesis, Dipartimento di Informatica, Università di Pisa, 1991. Available as Technical Report TD 2/91.Google Scholar
- [Huh96]M. Huhn. Action refinement and property inheritance in systems of sequential agents. In U. Montanari and V. Sassone, editors, CONCUR '96, Lect. Notes Comp. Sci. 1119, 639–654. Springer, 1996.Google Scholar
- [Jat93]L.A. Jategaonkar. Observing ‘True’ Concurrency. PhD thesis, Laboratory for Computer Science, MIT, 1993.Google Scholar
- [Rei85]W. Reisig. Petri Nets. EATCS Monographs on Theoretical Computer Science 4. Springer, 1985.Google Scholar
- [Ren93]A. Rensink. Models and Methods for Action Refinement. PhD thesis, Faculteit der Informatica, Universiteit Twente, 1993.Google Scholar
- [Vog92]W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets. Lect. Notes Comp. Sci. 625. Springer, 1992.Google Scholar
© Springer-Verlag Berlin Heidelberg 1997