Towards a Formal Model of Context Awareness Mikkel Baun Kjærgaard Jonathan Bunde-Pedersen Department of Computer Science University of Aarhus.

Slides:



Advertisements
Similar presentations
1 Verification by Model Checking. 2 Part 1 : Motivation.
Advertisements

The Quest for Correctness Joseph Sifakis VERIMAG Laboratory 2nd Sogeti Testing Academy April 29th 2009.
Limitations of the relational model 1. 2 Overview application areas for which the relational model is inadequate - reasons drawbacks of relational DBMSs.
Traffic Control and the Problem of Congestion within the Internet By Liz Brown and Nadine Sur.
Auto-Generation of Test Cases for Infinite States Reactive Systems Based on Symbolic Execution and Formula Rewriting Donghuo Chen School of Computer Science.
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Project Proposal.
Prototyping of Real-time Component Based Systems by the use of Timed Automata Trevor Jones Lancaster University, UK
May 14, May 14, 2015May 14, 2015May 14, 2015 Azusa, CA Sheldon X. Liang Ph. D. Software Engineering in CS at APU Azusa Pacific University, Azusa,
ISBN Chapter 3 Describing Syntax and Semantics.
Train Control Language Teaching Computers Interlocking By: J. Endresen, E. Carlson, T. Moen1, K. J. Alme, Haugen, G. K. Olsen & A. Svendsen Synthesizing.
Towards Security and Privacy for Pervasive Computing Author : Roy Campbell,Jalal Al-Muhtadi, Prasad Naldurg,Geetanjali Sampemane M. Dennis Mickunas.(2002)
Software Requirements
© Siemens AG 2001 Software & Systems Architectures - Mobile Computing Proposed Research Topics Cooperation between Siemens and UCB March 27, 2001 Visit.
LEARNING FROM OBSERVATIONS Yılmaz KILIÇASLAN. Definition Learning takes place as the agent observes its interactions with the world and its own decision-making.
Lecture 4&5: Model Checking: A quick introduction Professor Aditya Ghose Director, Decision Systems Lab School of IT and Computer Science University of.
Introduction to CSE 591: Autonomous agents - theory and practice. Chitta Baral Professor Department of Computer Sc. & Engg. Arizona State University.
Software Requirements
Consistency/Reliability
Modelling with Coloured Petri Nets Søren Christensen Department of Computer Science University of Aarhus.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
CSE5610 Intelligent Software Systems Semester 1 Enabling Intelligent Systems in Pervasive Computing.
ISIS Katrinebjerg i n t e r a c t i v e s p a c e s. n e t 1 Frank Allan Hansen, Representing Context in Hypermedia Data Models International.
Describing Syntax and Semantics
Department of Computer Science & Engineering College of Engineering Dr. Betty H.C. Cheng, Laura A. Campbell, Sascha Konrad The demand for distributed real-time.
International User Group Information Delivery Manuals: General Overview Courtesy:This presentation is based on material provided by AEC3 and AEC Infosystems.
ANALYSIS OF SOFTWARE REQUIREMENTS S.Gnesi IEI-CNR Pisa Joint work with F.Fabbrini, M.Fusani, G.Lami.
A Survey on Context-Aware Computing Center for E-Business Technology Seoul National University Seoul, Korea 이상근, 이동주, 강승석, Babar Tareen Intelligent Database.
Chapter 7 Requirement Modeling : Flow, Behaviour, Patterns And WebApps.
Towards an activity-oriented and context-aware collaborative working environments Presented by: Ince T Wangsa Supervised by:
USING METADATA TO FACILITATE UNDERSTANDING AND CERTIFICATION ABOUT THE PRESERVATION PROPERTIES OF A PRESERVATION SYSTEM Jewel H. Ward, Hao Xu, Mike C.
Database Design - Lecture 2
The Architecture of Secure Systems Jim Alves-Foss Laboratory for Applied Logic Department of Computer Science University of Idaho By, Nagaashwini Katta.
A Z Approach in Validating ORA-SS Data Models Scott Uk-Jin Lee Jing Sun Gillian Dobbie Yuan Fang Li.
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Towards a Programming Paradigm for Pervasive.
What is the Next Generation of Human-Computer Interaction? Introduction.
CSE S. Tanimoto Lambda Calculus 1 Lambda Calculus What is the simplest functional language that is still Turing complete? Where do functional languages.
Author: Graham Hughes, Tevfik Bultan Computer Science Department, University of California, Santa Barbara, CA 93106, USA Source: International Journal.
UT DALLAS Erik Jonsson School of Engineering & Computer Science FEARLESS engineering Semantic Web Services CS - 6V81 University of Texas at Dallas November.
ISBN Chapter 3 Describing Semantics -Attribute Grammars -Dynamic Semantics.
1 Introduction to Software Engineering Lecture 1.
Formal Verification Lecture 9. Formal Verification Formal verification relies on Descriptions of the properties or requirements Descriptions of systems.
Extending Traditional Algorithms for Cyber-Physical Systems Sumeet Gujrati and Gurdip Singh Kansas State University.
Extending context models for privacy in pervasive computing environments Jadwiga Indulska The School of Information Technology and Electrical Engineering,
Cerberus: A Context-Aware Security Scheme for Smart Spaces presented by L.X.Hung u-Security Research Group The First IEEE International Conference.
A Context Model based on Ontological Languages: a Proposal for Information Visualization School of Informatics Castilla-La Mancha University Ramón Hervás.
Haptic Interfaces and Force-Control Robotic Application in Medical and Industrial Contexts Applicants Prof. Doo Yong Lee, KAIST Prof. Rolf Johansson,
Designing Pervasive Services for Physical Hypermedia Cecilia Challiol, Silvia Gordillo, Gustavo Rossi (LIFIA, Universidad Nacional de La Plata, Argentina)
A Universe-Type-Based Verification Technique for Mutable Static Fields and Methods Alexander J Summers Sophia Drossopoulou Imperial College London Peter.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
IS550: Software requirements engineering Dr. Azeddine Chikh 2. Functional and non-functional requirements.
ISBN Chapter 3 Describing Semantics.
The Nature of Computing INEL 4206 – Microprocessors Lecture 2 Bienvenido Vélez Ph. D. School of Engineering University of Puerto Rico - Mayagüez.
Formal Methods and Testing: Possible Attributes for Success A. J. Cowling Department of Computer Science University of Sheffield.
1 / 48 Formal a Language Theory and Describing Semantics Principles of Programming Languages 4.
Quality Assurance in the Presence of Variability Kim Lauenroth, Andreas Metzger, Klaus Pohl Institute for Computer Science and Business Information Systems.
Privacy-Enhanced Web Service Composition. Abstract Data as a Service (DaaS) builds on service-oriented technologies to enable fast access to data resources.
Lyon Research Center for Images and Intelligent Information Systems IEEE International Conference on Pervasive Services 2006 FRE 2672 INSA Lyon ICPS, 27.
CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University
CIMA and Semantic Interoperability for Networked Instruments and Sensors Donald F. (Rick) McMullen Pervasive Technology Labs at Indiana University
INTRODUCTION TO COGNITIVE SCIENCE NURSING INFORMATICS CHAPTER 3 1.
Dude, Where's My Car? And Other Questions in Context-Awareness Jason I. Hong James A. Landay Group for User Interface Research University of California.
MDD-Kurs / MDA Cortex Brainware Consulting & Training GmbH Copyright © 2007 Cortex Brainware GmbH Bild 1Ver.: 1.0 How does intelligent functionality implemented.
1 Software Requirements Descriptions and specifications of a system.
Certifying and Synthesizing Membership Equational Proofs Patrick Lincoln (SRI) joint work with Steven Eker (SRI), Jose Meseguer (Urbana) and Grigore Rosu.
Formal methods its uses and limitations. A little about formality Objective knowledge / information Objective knowledge / information Information brought.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Chapter 4 – Requirements Engineering
CSE S. Tanimoto Lambda Calculus
Presentation transcript:

Towards a Formal Model of Context Awareness Mikkel Baun Kjærgaard Jonathan Bunde-Pedersen Department of Computer Science University of Aarhus

May 2006Mikkel Baun Kjærgaard2 Motivation Pervasive computing vision: –Move computation from the desktop computer to a number of devices embedded in the environment of the user. Context-awareness –However the task of handling all these devices should not overwhelm the human user. –Therefore the devices and applications need to become aware of the context they are situated in. –The context of interest could here both be the physical, social and computational environment. Modeling Context Information –Complex A lot of different factors where some of them can only be described probabilistically. –Interwoven The different types of information depend and relate to each other in many ways.

May 2006Mikkel Baun Kjærgaard3 Example Pervasive Healthcare –Context information types Personal Status Activities Location Staff Patients

May 2006Mikkel Baun Kjærgaard4 Motivation Contextual information Context-aware applications

May 2006Mikkel Baun Kjærgaard5 Motivation Application areas –Healthcare,... –A lot of the applications are critical in some way –At build time / online validation? For interesting properties: consistency, privacy, … Formal foundation –Should be expressive enough to model complex and interwoven context-information. Goal –How can the Ambient Calculus be extended to allow us to model complex and interwoven sets of context information?

May 2006Mikkel Baun Kjærgaard6 Ambient Calculus The Ambient Calculus –deals with ambients which are tree-structured recursively defined entities. –An ambient may be situated in another ambient and itself contain ambients, and –Information between ambients may only flow between nearby ambients, i.e. parents or siblings. Modeling Context using Ambients –If context-information should be made available for an ambient it must be positioned near the ambient in the tree.

May 2006Mikkel Baun Kjærgaard7 Idea Multiple Contexts –Ambients which can be present in one or more trees. Two types of ambients –Context ambients vs. Reference ambients New capabilities which enables the reference ambients to navigate in multiple contexts.

May 2006Mikkel Baun Kjærgaard8 Example

May 2006Mikkel Baun Kjærgaard9 Example

May 2006Mikkel Baun Kjærgaard10 Example 1: out{*} 2: out{Person&Status&Entity} 3: in{Person} Doctor 4: in{Status} NotBusy 5: in{Person&Status&Location&~Entity} ?

May 2006Mikkel Baun Kjærgaard11 Extensions ambients –Context ambients Context information is represented in trees. Names of context trees are unmutable. Context ambients have limited capabilities. –Reference ambients Only one reference in a single context Reference ambients must not contain references to other reference ambients. Reference ambients are unique in the sense that all references to ambient n points to the same n. Reference ambients cannot remove themselves directly from a context.

May 2006Mikkel Baun Kjærgaard12 Extensions capabilities Navigation –Multiple contexts –Simple Boolean expressions –Wildcard name Observability –Coenter / Coexit

May 2006Mikkel Baun Kjærgaard13 Defining semantics Ambient like –Example of a simple in-rule

May 2006Mikkel Baun Kjærgaard14 Discussion Limitations –Restricts context information to a number of trees which limits the expressiveness but to a lesser degree than prior research. –Does not take probabilistic context information into account. It is important for a calculi to be able to handle such information because it is the typical output of most sensors of context information. –Is the above needed in practice?

May 2006Mikkel Baun Kjærgaard15 Discussion The present CONAWA calculus does not bridge the gap to a combined theory and systems building approach –base for simulation, verification and software prototyping –(i) Building a simulator which can interpret CONAWA descriptions –(ii) Defining a logic which make it possible to state properties which could be verified “This awarephone must never reveal my location to other people than the ones I have explicitly granted this priviledge”? –(iii) Building a code generation facility that makes it possible to build skeleton code from the models.

May 2006Mikkel Baun Kjærgaard16 Conclusion –Expressiveness of formal models of context awareness. –Here the models expressiveness should be sufficient to model complex and interwoven sets of context- information. –The CONAWA calculus was given as an example of a calculus that is a step in the direction of making such modeling possible.