=b 2)if (a==0) GCD is in b 3)ensure that a>=b 4)let a:=a-b 5)goto 2)  RuleBlocks  Port bindings  Initial matches  UML Patterns  Actions (match,create,delete)  AttributeMapping boxes GReAT task B task A frequencies → time slots"> =b 2)if (a==0) GCD is in b 3)ensure that a>=b 4)let a:=a-b 5)goto 2)  RuleBlocks  Port bindings  Initial matches  UML Patterns  Actions (match,create,delete)  AttributeMapping boxes GReAT task B task A frequencies → time slots">

Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chess Review November 21, 2005 Berkeley, CA Edited and presented by New results in Platform Modeling Tivadar Szemethy ISIS, Vanderbilt University.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Chess Review November 21, 2005 Berkeley, CA Edited and presented by New results in Platform Modeling Tivadar Szemethy ISIS, Vanderbilt University."— Presentation transcript:

1 Chess Review November 21, 2005 Berkeley, CA Edited and presented by New results in Platform Modeling Tivadar Szemethy ISIS, Vanderbilt University

2 Chess Review, Nov. 21, 2005"New Results in Platform Modeling", Tivadar Szemethy2 Model Transformation for Hard Real- Time Systems I. 1)“Proof of concept” for a declarative approach using GME/GReAT 2)Part of the DSML → Platform → Analysis model mapping chain Giotto → E-code mapping using UML-based metamodels and graph rewriting techniques Giotto meta and model E-code meta and model GReAT transformation

3 Chess Review, Nov. 21, 2005"New Results in Platform Modeling", Tivadar Szemethy3 Model Transformation for Hard Real- Time Systems II. Giotto Tasks, drivers Ports Program: set of timing constraints E-Code Tasks, drivers, guards Ports Program: sequence of instructions Euclid’s GCD algorithm 1)choose (a,b) s.t. a>=b 2)if (a==0) GCD is in b 3)ensure that a>=b 4)let a:=a-b 5)goto 2)  RuleBlocks  Port bindings  Initial matches  UML Patterns  Actions (match,create,delete)  AttributeMapping boxes GReAT 0 100200300400500 task B task A frequencies → time slots

4 Chess Review, Nov. 21, 2005"New Results in Platform Modeling", Tivadar Szemethy4 Platform Modeling Language Node: Node Node_proc :process_decl _ initInstances: integer=0 Method :Method Node: Node Node Proc RunMethod :state RM Method Idle :state goIdle :transition Idle :state Match A2A2 Actio n 1 Each Block has one Filter condition. “Downstream” elements refer to the objects matched by the Filter. Hierarchical Blocks Filter Conditions Actions Associations The Platform Modeling Language (PML) is a declarative formalism to capture platform entity → analysis automaton structure mappings PML Semantics while (exists i such that GFC i is true) Execute Action i end GFC i (Global Filter Condition) Chain of filter conditions for Action i PML Example DFK (Dataflow Kernel) to IF (timed FSM) mapping

Download ppt "Chess Review November 21, 2005 Berkeley, CA Edited and presented by New results in Platform Modeling Tivadar Szemethy ISIS, Vanderbilt University."

Similar presentations

IAY 0600 Digitaalsüsteemide disain Register Transfer Level Design. FSM Synthesis. Alexander Sudnitson Tallinn University of Technology.

IAY 0600 Digitaalsüsteemide disain Register Transfer Level Design. FSM Synthesis. Alexander Sudnitson Tallinn University of Technology.
McGill University School of Computer Science ‘07 Eugene Syriani and Hans Vangheluwe McGill University School of Computer Science 1.

McGill University School of Computer Science ‘07 Eugene Syriani and Hans Vangheluwe McGill University School of Computer Science 1.
Optimizing single thread performance Dependence Loop transformations.

Optimizing single thread performance Dependence Loop transformations.
Budapest University of Technology and EconomicsDagstuhl 2004 Department of Measurement and Information Systems 1 Towards Automated Formal Verification.

Budapest University of Technology and EconomicsDagstuhl 2004 Department of Measurement and Information Systems 1 Towards Automated Formal Verification.
Semantic Translation of Simulink/Stateflow Models to Hybrid Automata using Graph Transformations A. Agarwal, Gy. Simon, G. Karsai ISIS, Vanderbilt University.

Semantic Translation of Simulink/Stateflow Models to Hybrid Automata using Graph Transformations A. Agarwal, Gy. Simon, G. Karsai ISIS, Vanderbilt University.
Background information Formal verification methods based on theorem proving techniques and model­checking –to prove the absence of errors (in the formal.

Background information Formal verification methods based on theorem proving techniques and model­checking –to prove the absence of errors (in the formal.
Forges: Synthesizing Verified Generators Kestrel Institute PIs: Cordell Green, John Anton CSs: Lindsay Errington, Doug Smith, Alessandro Coglio, Stephen.

Forges: Synthesizing Verified Generators Kestrel Institute PIs: Cordell Green, John Anton CSs: Lindsay Errington, Doug Smith, Alessandro Coglio, Stephen.
10.6.2008 Formal Methods of Systems Specification Logical Specification of Hard- and Software Prof. Dr. Holger Schlingloff Institut für Informatik der.

Formal Methods of Systems Specification Logical Specification of Hard- and Software Prof. Dr. Holger Schlingloff Institut für Informatik der.
Event Driven Real-Time Programming CHESS Review University of California, Berkeley, USA May 10, 2004 Arkadeb Ghosal Joint work with Marco A. Sanvido, Christoph.

Event Driven Real-Time Programming CHESS Review University of California, Berkeley, USA May 10, 2004 Arkadeb Ghosal Joint work with Marco A. Sanvido, Christoph.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Trading Latency for Composability Slobodan Matic UC Berkeley.

Chess Review November 21, 2005 Berkeley, CA Edited and presented by Trading Latency for Composability Slobodan Matic UC Berkeley.
Chess Review May 11, 2005 Berkeley, CA Advances In MIC Tools for Networked Embedded Systems Applications Edited and Presented by Janos Sztipanovits ISIS,

Chess Review May 11, 2005 Berkeley, CA Advances In MIC Tools for Networked Embedded Systems Applications Edited and Presented by Janos Sztipanovits ISIS,
Cpeg421-08S/final-review1 Course Review Tom St. John.

Cpeg421-08S/final-review1 Course Review Tom St. John.
Chess Review October 4, 2006 Alexandria, VA Edited and presented by Advanced Tool Architectures Edward A. Lee UC Berkeley.

Chess Review October 4, 2006 Alexandria, VA Edited and presented by Advanced Tool Architectures Edward A. Lee UC Berkeley.
A Review of Ontology Mapping, Merging, and Integration Presenter: Yihong Ding.

A Review of Ontology Mapping, Merging, and Integration Presenter: Yihong Ding.
Chess Review May 10, 2004 Berkeley, CA Metamodeling Infrastructure for Model-Integrated Computing Matthew J. Emerson, Kai Chen, Andrew D. Dixon, Janos.

Chess Review May 10, 2004 Berkeley, CA Metamodeling Infrastructure for Model-Integrated Computing Matthew J. Emerson, Kai Chen, Andrew D. Dixon, Janos.
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Regular.

CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Regular.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by A Semantic Unit for Timed Automata Based Modeling Languages Kai Chen ISIS, Vanderbilt.

Chess Review November 21, 2005 Berkeley, CA Edited and presented by A Semantic Unit for Timed Automata Based Modeling Languages Kai Chen ISIS, Vanderbilt.
Institute For Software Integrated Systems Vanderbilt University Applications of Model Integrated Computing to The Synchronous Language Signal Ethan Jackson.

Institute For Software Integrated Systems Vanderbilt University Applications of Model Integrated Computing to The Synchronous Language Signal Ethan Jackson.
UC Berkeley: Chess Vanderbilt University: ISIS University of Memphis: MSI CHESS Review May 10, 2004 Berkeley, CA Model-Based Design Edited by Janos Sztipanovits,

UC Berkeley: Chess Vanderbilt University: ISIS University of Memphis: MSI CHESS Review May 10, 2004 Berkeley, CA Model-Based Design Edited by Janos Sztipanovits,
C. Varela; Adapted w/permission from S. Haridi and P. Van Roy1 Declarative Computation Model Kernel language semantics Carlos Varela RPI Adapted with permission.

C. Varela; Adapted w/permission from S. Haridi and P. Van Roy1 Declarative Computation Model Kernel language semantics Carlos Varela RPI Adapted with permission.

Similar presentations

Ads by Google