|
Vol: 59(73) No: 2 / December 2014 Mobile Ubiquitous Services: A layered Reference Model in the context of Disappearing Hardware Sebastian Gliţa Catina Politehnica University of Timisoara, Faculty of Automation and Computers, 300223 Timisoara, Romania, phone: (+40) 256-403281, e-mail: sebastian.glita-catina@upt.ro Keywords: Pervasive Computing, OSI Reference Model, Formal Derivation, Reflection, Components, Causation, Algebraic Equivalence, Coalgebric Bisimilarity, Adequacy, Wireless Networks Abstract Novel patterns of emergent behavior; safety critical environments for developing Real Time systems; simulations of featured probabilistic networks – stand atop modern research. However, acquiring with models in reality or purging computerized implementations – that provided for data – do not share an equal standpoint. This paper, motivated by the success of embedding central processors in mobile devices – wireless transceivers as well –, layouts a Reference Model for pervasive computation and communication – to provide for the above data –, by just formally specifying requirements for models and applying formal derivation downto the source code – aside “infrastructure” components mixed in (via reflection). The Reference Model does neither present results nor finds solutions. It fixes key concepts and presents several functions that its instances need comply with. In this paper, “MUSæ” (the term “services” names its instances also) are similar with distributed architectures, but lack the client server paradigm. They resemble packet networking too, yet such data loads (herein referred to as “units”) perform computation or enact communication, while mobile. By further refining intents in MUSæ formal specifications (or infrastructure), it introduces purposes, goals, characteristics, and layers of services: two major aspects – at the prior to bottom integration layer – are the identification of units and their coordination in services, herein previewed probabilistically. At bottom reification layer – an instance where adequacy (a higher notion of semantics) contributed –, it details how derivation ends in executable source code (by / as components). References [1] S. Sorce and A. Genco, Pervasive Systems and Ubiquitous Computing. WIT Press, 2010. [2] B. Nordström, K. Petersson, and J.M. Smith. Programming in Martin Löf’s Type Theory: An Introduction. Oxford U. Press, 1990. [3] João Marcos, “Logics of Formal Inconsistency,” PhD dissertation, Universidade Técnica de Lisboa, 2005. [4] J.J.M.M. Rutten, “Coalgebra, Concurrency, and Control,” Centrum voor Wiskunde en Informatica, Tech. Rep. SEN R9921, 1999. [5] Bart Jacobs. “Categorical Type Theory,” PhD dissertation, Radboud Universiteit Nijmegen, 1991. [6] Torben Braüner, “An Axiomatic Approach to Adequacy,” PhD dissertation, BRICS, Tech. Rep. BRICS RS 96 4, 1996. [7] R. Maes, “Concepts and Experiments in Computational Reflection”, in The International Conference on Object Oriented Programming, Systems, Languages and Applications (OOPSLA’87), ACM Press. [8] I. Şora, P. Verbaeten and Y. Berbers, “CCDL: The Composable Components Description Language”, International Journal for Software Tools for Technology Transfer, Vol. 9, No. 2, 2007. [9] Inf.Tech. – Open Systems Interconnection – Basic Reference Model: The Basic Model, ISO 7498-1:1994(E), ISO IEC C. Office, 1994. [10] ANSI IEEE 802.2 Standard, Institute of Electrical and Electronics Engineers, Standards I.E.E.E. Association, May 1998. [11] R. Sharp, Principles of Protocol Design, Springer Verlag, 2008. [12] A.W. Brown, Large Scale Component Based Development, Prentice Hall, Inc., 2000. [13] Martinus Maria Fokkinga, “Law and Order in Algorithmics,” PhD dissertation, Universiteit Twente, 1992. [14] St. Russel, J. Binder, and D. Koller, “Adaptive Probabilistic Networks,” University of California, Berkeley, Tech. Rep. CSD 94 824, July 1994. |