Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
In the domain of parameterized composable high-level Petri nets (M-nets), we shall combine the refinement, the synchronization and the asynchronous link operations in a unified and general setup, while keeping the expected properties of those operations. In particular, the various high-level net operations are consistent through unfolding with their low-level counterparts, and the usual commutativity and idempotency properties are fulfilled at the syntactic level up to structural equivalences.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
221--257
Opis fizyczny
Bibliogr. 21 poz., tab., wykr.
Twórcy
autor
- Departément d'informatique, CP212, Université Libre de Bruxelles, Boulevard du Triomphe, B-1050 Brussels, Belgium
autor
- LaMI - UMR 8042 CNRS Université d’Evry-Val d’Essonne Place des Terrasses, 91000 Evry, France
Bibliografia
- [1] E. Best, R. Devillers, and M. Koutny. Petri Net Algebra. EATCS SERIES of Monographs in Theoretical Computer Science (Springer, 2001) ISBN 3-540-67398-9.
- [2] E. Best, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. M-nets: an Algebra of High Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages. Acta Informatica 35 (1998) 813–857.
- [3] E. Best, R.P. Hopkins.B(PN)*2 - a Basic Petri Net Programming Notation. PARLE’93. LNCS Vol. 694, (Springer, 1993) 379–390.
- [4] C. Bui Thanh and H. Klaudel. Object-oriented modelling with high-level modular Petri nets. IFM’04, LNCS Vol. 2999, (Springer, 2004) 287 – 306.
- [5] R. Devillers, H. Klaudel and E. Pelz. An Algebraic Box Calculus. JALC (2000) Vol 2, 81–108.
- [6] R. Devillers, H. Klaudel and R.-C. Riemann. General Refinement for High Level Petri Nets. FST & TCS’97, LNCS Vol. 1346, (Springer, 1997) 297–311.
- [7] R. Devillers, H. Klaudel and R.-C. Riemann. Parameterised General Refinement in the M-net Calculus. PNSE’97. Univ. Hamburg, FBI-HH-B-205/97, (1997) 55–66.
- [8] R. Devillers, H. Klaudel and R.-C. Riemann. General Parameterised Refinement and Recursion for the M-net Calculus. TCS 300 (2003) 259–300.
- [9] H. Fleischhack and B. Grahlmann. A Petri Net Semantics for B(PN)_ with Procedures. Parallel and Distributed Software Engineering, Boston Ma. (1997) 15–27.
- [10] B. Grahlmann. The PEP Tool. CAV’97. LNCS Vol. 1254, (Springer, 1997) 440–443.
- [11] B. Grahlmann and E. Best. PEP – More than a Petri net tool. TACAS’96, LNCS Vol. 1055, (Springer, 1996) 397–401.
- [12] H. Klaudel. Compositional High-Level Petri Net Semantics of a Parallel Programming Language with Procedures. Science of Computer Programming 41, (Elsevier, 2001) 195–240.
- [13] H. Klaudel and F. Pommereau. Asynchronous links in the PBC and M-nets. ASIAN’99, LNCS vol. 1742, (Springer, 1999) 190–200.
- [14] H. Klaudel and F. Pommereau. A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems. Fundamenta Informaticae, 50(1), (IOS Press, 2002) 33 – 55.
- [15] H. Klaudel and R.-C. Riemann. Refinement-based Semantics of Parallel Procedures. PDPTA’99, Vol. 4, (CSREA Press, 1999) 1810–1816.
- [16] J. Lilius. OB(PN)_: an Object Based Petri Net Programming Notation. APN’97, LNCS Vol. 2001, (Springer, 1997) 247–275.
- [17] J. Lilius and E. Pelz. An M-net Semantics for B(PN)_ with Procedures. ISCIS XI, Antalya, Vol. I, (1996) 365–374.
- [18] Milner R. A Calculus of Communicating System. LNCS Vol. 92, Springer, 1980.
- [19] F. Pommereau.Mod`eles composables et concurrents pour le temps-r´eel. Ph.D. Thesis, Univ. Paris 12. Créteil, 2002.
- [20] R-C. Riemann. Modelling of Concurrent Systems: Structural and Semantical Methods in the High Level Petri Net Calculus. PhD Thesis, Univ. Paris XI, 1999.
- [21] C. Stehno PEP Version 2.0. Tool demonstrations at ICATPN 2001.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0007-0027