Dynamic Hierarchical Machines

• Autorzy: Lanotte R. , Maggiolo-Schettini A. , Peron A. , Tini S.
• Języki publikacji: EN

Abstrakty

EN

We present Dynamic Hierarchical Machines (DHMs), an extension of Communicating Hierarchical Automata allowing dynamic activation of components. We give an operational semantics of DHMs and we provide examples of modeling in the context of security. We characterize a fragment of DHMs which are equivalent to Recursive Hierarchical Machines and therefore to Pushdown Machines.

Słowa kluczowe

EN

Dynamic Hierarchical Machines (DHMs)

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2003
• Tom: Vol. 54, nr 2,3
• Strony: 237--252
• Opis fizyczny: bibliogr. 17 poz.

Twórcy

autor

Lanotte R.

autor

Maggiolo-Schettini A.

autor

Peron A.

autor

Tini S.

• Dipartimento di Informatica, Universita di Pisa, Via F. Buonarroti, 2, I- 56127 Pisa, Italy,

Bibliografia

• [1] R. Alur, S. Kannan, and M. Yannakakis, Model Checking of Hierarchical State Machines. Proc. ACM Symposium on Foundation of Software Engineering, 1998, 175-188.
• [2] R. Alur, S. Kannan, and M. Yannakakis, Communicating Hierarchical Automata. Proc. ICALP’99, Springer LNCS 1644, 1999, 169-178.
• [3] R. Alur, K. Etessami, and M. Yannakakis, Analysis of Recursive State Machines. Proc. CAV’01, Springer LNCS 2102, 2001, 207-220.
• [4] G. Booch, L. Jacobson, and J. Rumbaugh, Unifying Modeling Language User Guide. Addison-Wesley, Boston, 1997.
• [5] A. Boujjani, J. Esparza, and O. Maler, Reachability Analysis of Pushdown Automata: Applications to Model Checking. Proc. CONCUR’97, Springer LNCS 1243, 1997, 135-150.
• [6] L. Cardelli and A. Gordon, Mobile Ambients. Theor. Comp. Science 240, 2000, 177-213.
• [7] J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon, Efficient Algorithms for Model Checking Pushdown Systems. Proc. CAV’00, Springer LNCS 1855, 2000, 232-247.
• [8] C. Fournet, G. Gonthier, J.J. L´evy, L. Maranget, and D. R´emy, A Calculus of Mobile Agents. Proc. CONCUR ’96, Springer LNCS 1119, 1996, 406-421.
• [9] D. Harel, Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming 8, 1987, 231-274.
• [10] M. Hennessy and J. Riely, Resource Access Control in Systems of Mobile Agents. Information and Computation 173, 2002, 82-120.
• [11] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.
• [12] D. Kozen, Language-based Security. Proc. MFCS’99, Springer LNCS 1672, 1999, 284-298.
• [13] F.B. Schneider, Enforceable Security Policies. Technical Report TR98-1664, Computer Science Department, Cornell University, 1998.
• [14] B. Selic, G. Gullekson, and P.T. Ward, Real Time Object Oriented Modeling and Design. J. Wiley, New York, 1994.
• [15] R. de Simone, Higher Level Synchronization Devices in SCCS-Meije. Theoretical Computer Science 37, 1985, 245-267.
• [16] J. Vitek and G. Castagna, Seal: a Framework for Secure Mobile Computations. Proc. ICCL’98 Workshop, Springer LNCS 1686, 1999, 47-77.
• [17] P.T. Wojciechowski and P. Sewell, Nomadic Pict: Languages and Infrastructure Design for Mobile Agents. IEEE Concurrency 8, 2000.