Chess Review November 21, 2005 Berkeley, CA Edited and presented by A Semantic Unit for Timed Automata Based Modeling Languages Kai Chen ISIS, Vanderbilt.

Slides:



Advertisements
Similar presentations
Models of Concurrency Manna, Pnueli.
Advertisements

The GDSE Framework A Meta-Tool for Automated Design Space Exploration Tripti Saxena Graduate Student Vanderbilt University 1.
Budapest University of Technology and EconomicsDagstuhl 2004 Department of Measurement and Information Systems 1 Towards Automated Formal Verification.
8. Introduction to Denotational Semantics. © O. Nierstrasz PS — Denotational Semantics 8.2 Roadmap Overview:  Syntax and Semantics  Semantics of Expressions.
UPPAAL Introduction Chien-Liang Chen.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 6: Process Synchronization.
UPPAAL Andreas Hadiyono Arrummaisha Adrifina Harya Iswara Aditya Wibowo Juwita Utami Putri.
CSE 522 UPPAAL – A Model Checking Tool Computer Science & Engineering Department Arizona State University Tempe, AZ Dr. Yann-Hang Lee
Presented by: Thabet Kacem Spring Outline Contributions Introduction Proposed Approach Related Work Reconception of ADLs XTEAM Tool Chain Discussion.
Automatic Verification of Component-Based Real-Time CORBA Applications Gabor Madl Sherif Abdelwahed
Formal Methods of Systems Specification Logical Specification of Hard- and Software Prof. Dr. Holger Schlingloff Institut für Informatik der.
DATAFLOW PROCESS NETWORKS Edward A. Lee Thomas M. Parks.
Faculty Of Computer Science Simon Fraser University Cmpt 880 presentation An Abstract Communication Model Uwe Glasser, Yuri Gurevich and Margus Veanes.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by New results in Platform Modeling Tivadar Szemethy ISIS, Vanderbilt University.
Irina Rychkova. 9/20061 Systemic approach towards model definition Model transformation semantics.
Chess Review May 11, 2005 Berkeley, CA Advances In MIC Tools for Networked Embedded Systems Applications Edited and Presented by Janos Sztipanovits ISIS,
Type System, March 12, Data Types and Behavioral Types Yuhong Xiong Edward A. Lee Department of Electrical Engineering and Computer Sciences University.
1 Operational Semantics Mooly Sagiv Tel Aviv University Textbook: Semantics with Applications.
Denotational Semantics Syntax-directed approach, generalization of attribute grammars: –Define context-free abstract syntax –Specify syntactic categories.
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Fundamentals (Chapter 4) Operational Semantics ICS.
Chess Review May 10, 2004 Berkeley, CA Metamodeling Infrastructure for Model-Integrated Computing Matthew J. Emerson, Kai Chen, Andrew D. Dixon, Janos.
Institute For Software Integrated Systems Vanderbilt University Applications of Model Integrated Computing to The Synchronous Language Signal Ethan Jackson.
Review of “Embedded Software” by E.A. Lee Katherine Barrow Vladimir Jakobac.
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 14 Functional Programming It is better to.
3.5 Interprocess Communication
UML CASE Tool. ABSTRACT Domain analysis enables identifying families of applications and capturing their terminology in order to assist and guide system.
Programming Language Semantics Mooly SagivEran Yahav Schrirber 317Open space html://
A Formal Foundation Supporting MDD --- ZOOM Approach Hongming Liu Lizhang Qin 11/08/2003.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Model-Based Design Overview Janos Sztipanovits and Gabor Karsai ISIS, Vanderbilt University.
Foundations of Hybrid and Embedded Software Systems UC Berkeley: Chess Vanderbilt University: ISIS University of Memphis: MSI NSF Model-Based Design DSML.
Verifying Distributed Real-time Properties of Embedded Systems via Graph Transformations and Model Checking Gabor Madl
Chess Review May 11, 2005 Berkeley, CA Formal Semantics of Metamodeling Frameworks Ethan Jackson ISIS, Vanderbilt University Semantic Anchoring Infrastructure.
Semantics with Applications Mooly Sagiv Schrirber html:// Textbooks:Winskel The.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Sensor Network Design Akos Ledeczi ISIS, Vanderbilt University.
System-Level Types for Component-Based Design Paper by: Edward A. Lee and Yuhong Xiong Presentation by: Dan Patterson.
Chess Review May 11, 2005 Berkeley, CA Platform Modeling and Analysis Presented by Tivadar Szemethy ISIS, Vanderbilt University.
Department of Electrical Engineering and Computer Sciences University of California at Berkeley The Ptolemy II Framework for Visual Languages Xiaojun Liu.
Timing analysis of an SDL subset in UPPAAL Anders Hessel Institution of Information Technology Department of Computer Systems Uppsala University M.Sc.
Chess Review October 4, 2006 Alexandria, VA Edited and presented by Model-Based Design Janos Sztipanovits Vanderbilt University.
SE-565 Software System Requirements More UML Diagrams.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Coupled Interface Modules for Heterogeneous Composition Ethan Jackson ISIS, Vanderbilt.
Timed UML State Machines Ognyana Hristova Tutor: Priv.-Doz. Dr. Thomas Noll June, 2007.
Imperative Programming
November 21, 2005 Center for Hybrid and Embedded Software Systems Tivadar Szemethy, Institute for Software Integrated Systems, Vanderbilt University A.
Introduction to ASMs Dumitru Roman Digital Enterprise Research Institute
- 1 - Embedded Systems - SDL Some general properties of languages 1. Synchronous vs. asynchronous languages Description of several processes in many languages.
Timed Use Case Maps Jameleddine Hassine Concordia University, Montreal, Canada URN Meeting, Ottawa, January 16-18, 2008.
1 Generating FSMs from Abstract State Machines Wolfgang Grieskamp Yuri Gurevich Wolfram Schulte Margus Veanes Foundations of Software Engineering Microsoft.
1 5 Nov 2002 Risto Pohjonen, Juha-Pekka Tolvanen MetaCase Consulting AUTOMATED PRODUCTION OF FAMILY MEMBERS: LESSONS LEARNED.
Semantics. Semantics is a precise definition of the meaning of a syntactically and type-wise correct program. Ideas of meaning: –Operational Semantics.
Toward a Semantic Anchoring Infrastructure for Domain-Specific Modeling Languages Kai Chen Janos Sztipanovits Sandeep Neema Matthew Emerson Sherif Abdelwahed.
Automata Based Method for Domain Specific Languages Definition Ulyana Tikhonova PhD student at St. Petersburg State Politechnical University, supervised.
Formal Methods in Software Engineering 1
Semantics for DSL Group Members: Ritu Arora, Diyang Chu, Zekai Demirezen, Jeff Gray, Jacob Gulotta, Luis Pedro, Arturo Sanchez, Greg Sullivan,Ximing Yu.
Dictionary based interchanges for iSURF -An Interoperability Service Utility for Collaborative Supply Chain Planning across Multiple Domains David Webber.
 In the java programming language, a keyword is one of 50 reserved words which have a predefined meaning in the language; because of this,
Overview of meta-modeling works for multi-clocked environments Christian Brunette IRISA/INRIA Rennes – ESPRESSO Synchron 2005.
From Natural Language to LTL: Difficulties Capturing Natural Language Specification in Formal Languages for Automatic Analysis Elsa L Gunter NJIT.
Operational Semantics Mooly Sagiv Tel Aviv University Sunday Scrieber 8 Monday Schrieber.
T imed Languages for Embedded Software Ethan Jackson Advisor: Dr. Janos Szitpanovits Institute for Software Integrated Systems Vanderbilt University.
Automaton-Based Approach for Defining Dynamic Semantics of DSLs Ulyana Tikhonova St. Petersburg State Polytechnical University,
Operational Semantics Mooly Sagiv Reference: Semantics with Applications Chapter 2 H. Nielson and F. Nielson
Operational Semantics Mooly Sagiv Reference: Semantics with Applications Chapter 2 H. Nielson and F. Nielson
CS5270 Lecture 41 Timed Automata I CS 5270 Lecture 4.
Fundamentals of Fault-Tolerant Distributed Computing In Asynchronous Environments Paper by Felix C. Gartner Graeme Coakley COEN 317 November 23, 2003.
UPPAAL Real-Time Systems Lab. Seolyoung, Jeong.
SysML v2 Formalism: Requirements & Benefits
TIOA-to-UPPAAL Translator & Front-End Integration
البرمجة بلغة فيجول بيسك ستوديو
OOPSLA Workshop on Domain-Specific Modeling Tools Workgroup
Presentation transcript:

Chess Review November 21, 2005 Berkeley, CA Edited and presented by A Semantic Unit for Timed Automata Based Modeling Languages Kai Chen ISIS, Vanderbilt University

Chess Review, Nov. 21, 2005"A Semantic Unit for TA Based...", K. Chen2 Semantic Units Semantic units capture the semantics of basic behavioral categories, such as FSM, DE, TA and SR. One basic behavior category may have various tool-defined variants that have similar but different syntax and semantics. –Timed Automata variants: the U PPAAL, IF and Kronos languages. –They extend the basic Timed Automata to express Interaction among a network of automata Action (transition) priorities. What kind of semantics is needed to be captured by a semantic unit? Do deep analysis on different language variants and make clear what is the essential semantics for this behavioral category. Abstract Data Model Semantic Anchoring Rules (M A ) Transition Engine DSML Metamdoel (A) GME Toolset GReAT Tool Mc XSLT Semantic Unit Spec. Instance Generate Domain Model (C) AsmL Model (XML Format) AsmL Metamodel Data Model Operational Semantic Spec Instance ASM Semantic Framework Core Semantics in the Definition Full Semantics L3 L1 L2 Basic Behavior Definition

Chess Review, Nov. 21, 2005"A Semantic Unit for TA Based...", K. Chen3 Timed Automata Semantic Unit U PPAAL Committed Location Urgent Location Location Invariants Urgent Synchronization IF Delayable Transition Lazy Transition Eager Transition Asynchronous Communication Unstable Location TA Semantic Unit Committed Location Urgent Location Location Invariants Urgent Synchronization Delayable Transition Lazy Transition Eager Transition Asynchronous Communication Unstable Location Basic Timed Automata Communication Mechanism A Generic Priority Scheme Semantic Anchoring

Chess Review, Nov. 21, 2005"A Semantic Unit for TA Based...", K. Chen4 A Priority-Oriented TA Semantic Unit Semantic Concepts –Original Timed Automata Definition –Communication among a network of automata Shared variables Synchronous communication Asynchronous communication (via mapping to the synchronous communication through model transformation ). –A generic priority scheme The bottom priority (the time progress priority) The top priority (enable modeling atomic actions) The urgent priority, which has a series of urgency degrees TA Semantic Unit Overview –A real-time system contains a set of concurrent components. –The behavior of each component is modeled by a timed automaton. –Components communicate among each other through shared variables and synchronization. –The priority of an action (transition) can be dynamically updated with respect to time progress. –Enabled actions with higher priorities will block actions with lower priorities. –Non-determinism is supported by allowing multiple enabled actions with the same priority.

Chess Review, Nov. 21, 2005"A Semantic Unit for TA Based...", K. Chen5 TA Semantic Unit Specification The Abstract Data Model captures the abstract syntax of TA Semantic Unit. A TA Semantic Unit model is an instance of the Abstract Data Model. class Clock var time as Double = 0 const CLOCKUNIT as Double var globalClocks as Set of Clock = {} var TimeBlocked as Boolean = false class Location const id as String const initial as Boolean const outTransitions as Set of Transition class Transition const id as String const blockTime as Boolean const setPrior as Boolean const dstLocationID as String enum SYNROLE SEND RECEIVE class SignalChannel const id as String const broadcast as Boolean var senders as Set of (TimedAutomaton, Transition) = {} var receivers as Set of (TimedAutomaton, Transition) = {} class RTSystem Run() step until fixpoint step RegisterSignalChannels() step let T as (TimedAutomaton?, Transition?) = GetNextTransition() step if TimeBlocked then if T.Second = null then error("The system is blocked.") else T.First.DoTransition(t.Second) else if T.Second = null then TimeProgress() else Including Operations and Transformational Rules that interpret the TA Semantic Unit Abstract Data Model. Abstract Data Model Semantic Anchoring Rules (M A ) Transition Engine DSML Metamdoel (A) GME Toolset GReAT Tool Mc XSLT Semantic Unit Spec. Instance Generate Domain Model (C) AsmL Model (XML Format) AsmL Metamodel Data Model Operational Semantic Spec Instance ASM Semantic Framework

Chess Review, Nov. 21, 2005"A Semantic Unit for TA Based...", K. Chen6 Modeling Language Specification for TA Semantic Unit TASU Metamodel A TASU Automaton (ComponentKindA) class ComponentKindA extends TimedAutomaton L0 as Location = new Location ("L0",true, {T1,TBT}) L1 as Location = new Location ("L1",false,{T2,TSP}) L2 as Location = new Location ("L2", false, {}) T1 as Transition = new Transition ("T1",false,false,“L1”) T2 as Transition = new Transition ("T2",false,false,“L2”) TBT as Transition = new Transition ("TBT",true,false,“L0”) TSP as Transition = new Transition ("TSP",false,true,“L1”) c as Clock = new Clock () override property locations as Set of Location get return {L0, L1, L2} override property transitions as Set of Transition get return {T1, T2, TBT, TSP} override property localClocks as Set of Clock get return {c} override property syns as Map of <Transition, (SignalChannel, SYNROLE)> get return { T1 -> (EXIT, SEND)} override TimeGuard (t as Transition) as Boolean match t.id "T1" : return c.time >= 10 "T2" : return c.time == 0 "TBT": return c.time >= 20 _ : return true override DataGuard (t as Transition) as Boolean match t.id _ : return true override DoAction (t as Transition) match t.id "T1": c.time := 0 _ : skip override Priority (t as Transition) as Integer match t.id _ : return 0 Generated TASU Data Model