cyber physical systems and events author carolyn talcott n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Cyber Physical Systems and Events Author: Carolyn Talcott PowerPoint Presentation
Download Presentation
Cyber Physical Systems and Events Author: Carolyn Talcott

Loading in 2 Seconds...

play fullscreen
1 / 24

Cyber Physical Systems and Events Author: Carolyn Talcott - PowerPoint PPT Presentation


  • 117 Views
  • Uploaded on

Cyber Physical Systems and Events Author: Carolyn Talcott. Presented By Tejaswee B Pasumarti. Abstract.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Cyber Physical Systems and Events Author: Carolyn Talcott' - moshe


Download Now An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
abstract
Abstract
  • This paper discusses event-based semantics in the context of the emerging concept of Cyber Physical Systems and describes two related formal models concerning policy-based coordination and Interactive Agents.
introduction
Introduction
  • CPS – integrate computing and communication, control of entities in physical world.
  • Examples
  • Automobiles
  • aircraft
  • air traffic control
  • power grids, oil refineries
  • medical devices
  • patient monitoring
  • smart structures.
introduction1
Introduction
  • QoS requirements
  • CPSs are stringent
  • traditional embedded and distributed systems are flexible.
  • Traditional systems are closed.
  • Now shifting towards openness.
  • QoS requirements include timing properties, fault-tolerance, security, etc.,
  • Solid semantic foundation is crucial.
event based semantics
Event-Based Semantics

Event

  • Different notions for different purposes.

Classifications

  • Punctual Vs. durative
  • Single Vs. stream
  • Change Vs. action

Key features

  • Interactions between components and observations.
  • Casual partial order.
event based semantics1
Event-Based Semantics
  • Think about reactive systems.
  • Global and Local states can be abstracted.
  • Gives semantics to specifications.
  • Associated with evidence.

Challenge Areas

Identifying, Modeling and Reasoning About Interdependencies.

  • Example: power grid versus a transportation system.

Dealing with Time, Space, Scale, and Uncertainty.

  • Examples: Sub second control on a power grid.
event based semantics2
Event-Based Semantics
  • Different aircraft flight modes—takeoff, landing, or cruising.
  • Traffic control for high density landing.

Privacy Issues for Human Centric CPS.

Examples:

  • Water company monitoring patterns of water usage.

Composition

  • Provide means of interactions and means of constraining interactions.
  • Composing evidence.

New Models for Thinking About Things Top to Bottom.

New Languages Based on New Models of Computation and Interaction.

related work
Related Work

Events Vs. State, Partial Order Vs. Interleaving.

  • State based models incurs difficulty.
  • Tag based signal model.
  • Events are tag-value pairs.
  • Components in terms of signals.
  • Clinger proves a form of event partial order corresponds to interleaving.
  • Rewriting logic.

Event Models for Actors

  • Actor model: Concurrent and distributed computation based on asynchronous message passing.
related work1
Related Work
  • Events are basis of semantics of actor languages.
  • Grief’s event diagram captures linear order of events and casual order.

PastTime Distributed Temporal Logic (PtDTL)

  • A variant of PastTime Temporal logic.
  • Logic reasons over partially ordered sets.
  • Introduces epistemic operators.

Causal Logic of Events

  • Logic for distributed computing.
  • Supports correct by construction programming.
  • Message Automata(MAs).
related work2
Related Work

Strand Spaces as an Event Model for Security and Location

  • Location protocols have quantitative goals.
  • Models considers transmission properties and uses geometry.
  • Strand spaces are mathematical model.
  • Provides special-purpose execution semantics, Bundles.
  • Secure location protocols combine cryptography.

Event Streams and Uncertainty.

  • Real-time embedded applications.
  • Temporal uncertainty from inherent restrictions.
  • PTMON (Probabilistic Timing MONitor)
  • Monitor task is formulated by timing constraints.
related work3
Related Work
  • Applications:
  • remote monitoring
  • Teleconference

Grounding High-Level Event Definition.

  • Requires precise notion of events.
  • Logic of Events and Conditions(LEC).
  • LEC is two sorted logic bridging gap between state-based formalisms.
  • Use of LEC developed in the context of run-time verification.
  • Reduces size and complexity of the model.
related work4
Related Work

Event Models for Pervasive Spaces

  • Responsphere Infrastructure at University of California at

Irvine.

  • Dense sensing in few chosen buildings monitoring corridors, entries, exits etc.,
  • Mixture of video and RFID technologies.

Examples:

  • Remainder to switch of coffee machines.
  • SATware System runs on Responsphere.
  • Virtual Sensor allows to define and detect semantic concepts.
  • Mapped to graph of operators at run time
policy and goal based operation of autonomous agents
Policy- and Goal-Based Operation of Autonomous Agents
  • Designed for interactive autonomous systems.
  • Collection of PAGODA nodes to achieve mutual goal.
  • PAGODA node (agent) interacts with its environment by sensing.
  • Software for deep space missions must be:
  • Autonomous
  • Robust
  • Dependable

Two levels

Local modular combination of components.

Coordination of distributed system of agents.

policy and goal based operation of autonomous agents1
Policy- and Goal-Based Operation of Autonomous Agents
  • Objective

Develop techniques for specification and analysis that take advantage of the modularity and the declarative nature of policy- and goal-based systems.

  • Approach

Based on the Reflective Russian Dolls (RRD) model of distributed object reflection

PAGODA Nodes

Components:

Knowledge base (KB),Reasoner (R), Monitor (M), Learner (L), and ‘hardware’ abstraction layer (HAL).

policy and goal based operation of autonomous agents3
Policy- and Goal-Based Operation of Autonomous Agents

Knowledgebase (KB) is the centerpiece.

It contains knowledge that is shared & updated by the remaining components. The information about:

  • Goals - Specify what the node or system is trying to achieve.
  • Policies - constrain the allowed actions / interactions of a node.
  • Device model - specifies the HAL interface.
  • Environment model - represents relevant features of the environment.
  • Node state - includes values of variables determined by sensor readings.
  • History - Log of events.
policy and goal based operation of autonomous agents4
Policy- and Goal-Based Operation of Autonomous Agents
  • R - determines proper parameter settings in response to goals requests.
  • M - Receives monitoring tasks from the reasoner.
  • L - Improve the model used by the reasoner.
  • HAL - interface to the sensors and effectors used by the node.
  • C - controls message semantics for internal components and mediates interactions with the external world.
  • This architecture provides a simple means of plugging in different component instances.
  • PAGODA node components interact with other node components based on component type
interactive agents
Interactive Agents
  • Focus on capabilities enabled by interactivity.
  • An interactive agent must be aware of its surroundings, and it may also affect its environment.
  • Framework for interactive agents consider some features:
  • Boundary
  • Actions
  • Multiple concurrent activities
  • Interactivity.

Aims of the framework include:

– Higher level means of specifying and understanding agent behavior.

– Place to classify agents with different ‘skills’.

interactive agents1
Interactive Agents

– a formal design space to represent a variety of design decisions and to study tradeoffs resulting from decisions such as adaptability vs. predictability;

Advantage:

  • Specifications are executable.
  • Interaction path - sequence of interactions.
  • Each computation of agent gives set of paths.
  • Semantics of interaction agent are set of interaction paths.
  • Interaction semantics are both vertical and horizontal compositional.
conclusion
Conclusion
  • Cyber physical systems (CPSs) are an emerging phenomena.
  • CPS systems are software intensive as well as integrated with physical systems.
  • Many challenges for design and development.
  • Event-Based Semantics.
  • Notions of events, essential features.
  • Two compositional models one for autonomous agents, other for interactive agents.
references
References
  • Cyber-Physical Systems and Events, Carolyn Talcott, SRI International.
  • Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press,
  • Cambridge (1986)
  • Agha, G.: Concurrent object-oriented programming. Communications of the ACM 33(9),
  • 125–141 (1990)
  • Allen, S., Constable, R., Eaton, R., Kreitz, C., Lorigo, L.: The Nuprl open logical environment. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 170–176. Springer,
  • Heidelberg (2000)
  • Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing,
  • M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 34–55. Springer,
  • Heidelberg (2003)
  • Baker, H.G., Hewitt, C.: Laws for communicating parallel processes. In: IFIP Congress, pp.
  • 987–992 (August 1977)
  • Bickford, M.: Specification and derivation of distributed programs using a logic of events
  • (2007), Invited lecture for Worshop on Event-based Semantics 2007,
  • http://blackforest.stanford.edu/eventsemantics
  • Bickford, M.: Abstract sequential programs and a logic of events (2008), Invited lecture for
  • Worshop on Event-based Semantics (2008),
references1
References
  • http://blackforest.stanford.edu/eventsemantics
  • Bickford, M., Constable, R.L.: A causal logic of events in formalized computational type
  • theory. Technical Report Technical Report 2005-2010, Cornell University (2005)
  • Clinger, W.D.: Foundations of actor semantics. AI-TR- 633, MIT Artificial Intelligence Laboratory (May 1981)
  • de Alfaro, L., Henzinger, T.A.: Interface automata. In: Ninth Annual Symposium on Foundations of Software Engineering (FSE), pp. 109–120. ACM Press, New York (2001)
  • de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: Henzinger,
  • T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, p. 148. Springer, Heidelberg (2001)
  • Denker, G., Meseguer, J., Talcott, C.L.: Rewriting semantics of distributed meta objects
  • and composable communication services. In: Third International Workshop on Rewriting
  • Logic and Its Applications (WRLA 2000). Electronic Notes in Theoretical Computer Science, vol. 36. Elsevier, Amsterdam (2000)
  • Denker, G., Talcott, C.L.: Formal checklists for remote agent dependability. In: Fifth International Workshop on Rewriting Logic and Its Applications (WRLA 2004). Electronic Notes
  • in Theoretical Computer Science. Elsevier, Amsterdam (2004)
  • Denker, G., Talcott, C.L.: A formal framework for goal net analysis. In: Workshop on Verifi-
  • cation and Validation of Planning Systems. AAAI Press, Menlo Park (2005)
  • Dvorak, D., Rasmussen, R., Reeves, G., Sacks, A.: Software Architecture Themes In JPL’s
  • Mission Data System. In: IEEE Aerospace Conference, USA (2000)
references2
References
  • F´abrega, F.J.T., Herzog, J.C., Guttman, J.D.: Strand spaces: Proving cryptographic protocols
  • correct. Journal of Computer Security, 191–230 (1999)
  • Goldin, D., Smolka, S., Attie, P., Sonderegger, E.: Turing machines, transition systems, and
  • interaction. Information and Computation Journal 194(2), 101–128 (2004)
  • Greif, I.: Semantics of communicating parallel processes. Technical Report 154, MIT, Project MAC (1975)
  • Guttman, J.: Strand spaces: From key exchange to secure location, Invited lecture for Worshop on Event-based Semantics 2008 (2008),
  • http://blackforest.stanford.edu/eventsemantics
  • Hewitt, C., Bishop, P., Steiger, R.: A universal modular actor formalism for artificial intelligence. In: Proceedings of 1973 International Joint Conference on Artificial Intelligence, pp.235–245 (August 1973) Hore, B., Jafarpour, H., Jain, R., Ji, S., Massaguer, D., Mehrotra, S., Venkatasubramanian,
  • N., Westermann, U.: Design and implementation of a middleware for sentient spaces. In:
  • Proceedings of ISI 2007 (2007)
  • Kim, M., Kannan, S., Lee, I., Sokolsky, O., Viswanathan, M.: Java-MaC: A run-time assurance approach for Java programs. Formal Methods in Systems Design 24(2), 129–155
  • (2004)
  • Lee, E.A.: Concurrent semantics without the notions of state or state transitions. In: Formal
  • Modeling and Analysis of Timed Systems. LNCS, pp. 18–31. Springer, Heidelberg (2006)
references3
References
  • Lee, E.A., Sangiovanni-Vincentelli, A.: A framework for comparing models of computation.
  • IEEE Transactions on Computer-Aided Design of Circuits and Systems 17(12), 1217–1229
  • (1998)
  • Lee, E.A.: Concurrent semantics without the notions of state or state transitions. In: Formal
  • Modeling and Analysis of Timed Systems. LNCS, pp. 18–31 (2006)
  • Lee, E.A.: The problem with threads. IEEE Computer 39(5), 33–42 (2006)
  • Liu, X., Matsikoudis, E., Lee, E.A.: Modeling timed concurrent systems. In: CONCUR (2006)
  • Meseguer, J.: Conditional Rewriting Logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73–155 (1992)
  • Meseguer, J., Talcott, C.L.: Semantic models for distributed object reflection (invited paper).
  • In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 1–36. Springer, Heidelberg (2002)
  • Meseguer, J.: A rewriting logic sampler. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005.
  • LNCS, vol. 3722, pp. 1–28. Springer, Heidelberg (2005)
  • Woo, H., Mok, A.K., Chen, D.: Realizing the potential of monitoring uncertain event streams in real-time embedded applications. Position paper for Worshop on Event-based Semantics,2007 (2007), http://blackforest.stanford.edu/eventsemantics
  • Woo, H., Mok, A.K., Lee, C.-G.: A generic framework for monitoring timing constraints

over uncertain events. In: 27th IEEE International Real-Time Systems Symposium (2006)