Discrete Simulation of Behavioural Hybrid Process Calculus Tomas Krilavičius Helen Shonenberg University of Twente.

Slides:



Advertisements
Similar presentations
Process Algebra Book: Chapter 8. The Main Issue Q: When are two models equivalent? A: When they satisfy different properties. Q: Does this mean that the.
Advertisements

CommUnity, Tiles and Connectors joint work with Roberto Bruni José Luiz Fiadeiro Antónia Lopes Ugo Montanari Ivan Lanese Dipartimento di Informatica Università.
Connectors and Concurrency joint work with Ugo Montanari Roberto Bruni Dipartimento di Informatica Università di Pisa Dagstuhl Seminar #04241, September.
ECOE 560 Design Methodologies and Tools for Software/Hardware Systems Spring 2004 Serdar Taşıran.
Process Algebra (2IF45) Abstraction in Process Algebra Suzana Andova.
Hybrid Systems Presented by: Arnab De Anand S. An Intuitive Introduction to Hybrid Systems Discrete program with an analog environment. What does it mean?
Goal and Scenario Validation: a Fluent Combination Chin-Yi Tsai.
Process Algebra (2IF45) Probabilistic Process Algebra Suzana Andova.
Process Algebra (2IF45) Probabilistic Process Algebra Suzana Andova.
Process Algebra (2IF45) Probabilistic extension: semantics Parallel composition Dr. Suzana Andova.
1 Towards formal manipulations of scenarios represented by High-level Message Sequence Charts Loïc Hélouet Claude Jard Benoît Caillaud IRISA/PAMPA (INRIA/CNRS/Univ.
ISBN Chapter 3 Describing Syntax and Semantics.
Course on Probabilistic Methods in Concurrency (Concurrent Languages for Probabilistic Asynchronous Communication) Lecture 1 The pi-calculus and the asynchronous.
Comp 205: Comparative Programming Languages Semantics of Imperative Programming Languages denotational semantics operational semantics logical semantics.
1 CALCULUS Even more graphing problems
School of Computing and Mathematics, University of Huddersfield CAS810: WEEK 3 LECTURE: LAMBDA CALCULUS PRACTICAL/TUTORIAL: (i) Do exercises given out.
1 Synchronization strategies for global computing models Ivan Lanese Computer Science Department University of Bologna.
1 Ivan Lanese Computer Science Department University of Bologna Roberto Bruni Computer Science Department University of Pisa A mobile calculus with parametric.
1212 Models of Computation: Automata and Processes Jos Baeten.
New insights on architectural connectors joint work with Roberto Bruni University of Pisa, Italy Ugo Montanari University of Pisa, Italy José Luiz Fiadeiro.
07/06/98 知的インタフェース特論 1 Operational Semantics Again, the question? Operational Model = Labeled Transition System If P and Q yields a same LTS. How to define.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Embedded Systems Laboratory Department of Computer and Information Science Linköping University Sweden Formal Verification and Model Checking Traian Pop.
System Design Research Laboratory Model-based Testing and Monitoring for Hybrid Embedded Systems Li Tan Jesung Kim Oleg Sokolsky Insup Lee University of.
Semantics with Applications Mooly Sagiv Schrirber html:// Textbooks:Winskel The.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
Describing Syntax and Semantics
Testing and Monitoring at Penn An Integrated Framework for Validating Model-based Embedded Software Li Tan University of Pennsylvania September, 2003.
Tool Integration of Ptolemy II EE290N Class Project Haiyang Zheng May
1212 Models of Computation: Automata and Processes Jos Baeten.
Model Checking LTL over (discrete time) Controllable Linear System is Decidable P. Tabuada and G. J. Pappas Michael, Roozbeh Ph.D. Course November 2005.
Mathematical Operational Semantics and Finitary System Behaviour Stefan Milius, Marcello Bonsangue, Robert Myers, Jurriaan Rot.
BY MISS FARAH ADIBAH ADNAN IMK
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
1 Discrete Structures ICS-252 Dr. Ahmed Youssef 1.
Structure of Study Programmes
Mathematics in Computer Science at Loras College Steve Mosiman.
Structure of Study Programmes Bachelor of Computer Science Bachelor of Information Technology Master of Computer Science Master of Information Technology.
Benjamin Gamble. What is Time?  Can mean many different things to a computer Dynamic Equation Variable System State 2.
SDS Foil no 1 Process Algebra Process Algebra – calculating with behaviours.
Mathematical Operational Semantics and Finitary System Behaviour Stefan Milius, Marcello Bonsangue, Robert Myers, Jurriaan Rot.
Advanced Topics in SE Spring Process Algebra Hossein Hojjat Formal Methods Lab University of Tehran.
Discrete Structures for Computing
Reactive systems – general
Integrating Exponential Functions TS: Making decisions after reflection and review.
Mathematical Modeling: Intro Patrice Koehl Department of Biological Sciences National University of Singapore
Weak Bisimilarity Coalgebraically Andrei Popescu Department of Computer Science University of Illinois.
Systems Biology Markup Language Ranjit Randhawa Department of Computer Science Virginia Tech.
Chia Y. Han ECECS Department University of Cincinnati Kai Liao College of DAAP University of Cincinnati Collective Pavilions A Generative Architectural.
2G1516 Formal Methods2005 Mads Dam IMIT, KTH 1 CCS: Processes and Equivalences Mads Dam Reading: Peled 8.5.
Properties as Processes : FORTE slide Properties as Processes: their Specification and Verification Joel Kelso and George Milne School of Computer.
Engineers and Engineering Design 1. Seven Engineering Resources 1. People 2. Information 3. Time 4. Capital 5. Machines & Tools 6. Materials 7. Energy.
Pathway Chart Algebra II Geometry HS Algebra I Math III Math II Math I Courses in higher level mathematics: Precalculus, Calculus, Advanced Statistics,
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
Process Algebra (2IF45) Abstraction Parallel composition (short intro) Suzana Andova.
Process Algebra (2IF45) Basic Process Algebra Dr. Suzana Andova.
New Curricula Proposal at FSMN by Miroslav Ćirić & Predrag Krtolica.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Formal Language & Automata Theory
Process Algebra (2IF45) Extending Process Algebra: Abstraction
Process Algebra (2IF45) Expressiveness of BPArec
Algebra 1 Section 2.3 Subtract real numbers
Discrete Math (2) Haiming Chen Associate Professor, PhD
Integrating Rational Functions
Discrete Math (2) Haiming Chen Associate Professor, PhD
Compositional Refinement for Hierarchical Hybrid Systems
Department of Mathematics
Introduction to verification
Algebra Substitution a = 3 ; b = 4 and c = -1 2a + c b2 – a2 2b2
Presentation transcript:

Discrete Simulation of Behavioural Hybrid Process Calculus Tomas Krilavičius Helen Shonenberg University of Twente

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 1 Outline Motivation Behavioural Hybrid Process Calculus Discrete simulation Future plans Conclusions Motivation Behavioural Hybrid Process Calculus Discrete simulation Future plans Conclusions

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 2 Motivation Formal languages Hybrid systems: embedded systems, models in natural and social sciences Main analysis technique for hybrid systems Formal languages Hybrid systems: embedded systems, models in natural and social sciences Main analysis technique for hybrid systems

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 3 Behavioural Hybrid Process Calculus Process algebraic theory concurrency, communication, discrete actions Process algebraic theory concurrency, communication, discrete actions Behavioural theory continuous realm J.W.Polderman, J.C.Willems Introduction to Mathematical Systems Theory Behavioural theory continuous realm J.W.Polderman, J.C.Willems Introduction to Mathematical Systems Theory

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 4 Behavioural Hybrid Process Calculus Trajectory-prefix Superposition Parallel composition Separation of concerns Bisimulation is congruence Trajectory-prefix Superposition Parallel composition Separation of concerns Bisimulation is congruence Trajectories and their continuations Choice is made when it is really time to do it Synchronisation on specified actions&signals Discrete and continuous behaviours can be separated syntactically Bisimilar processes can be substituted

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 5 Simulation of Hybrid Systems Main analysis technique for hybrid systems Discrete simulation Provides interesting information First step to simulation of hybrid systems

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 6 Discrete Simulation of BHPC Technique Application of SOS rules Expansion law Technique Application of SOS rules Expansion law Abstraction From Continuous Behaviour Trajectory-prefix Guard Superposition Parallel composition Abstraction From Continuous Behaviour Trajectory-prefix Guard Superposition Parallel composition

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 7 Trajectory-prefix Special type of action-prefix silent action special action to denote trajectory-prefix special action name for each trajectory-prefix Special type of action-prefix silent action special action to denote trajectory-prefix special action name for each trajectory-prefix

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 8 Guard false true assign evaluation for each guard individually

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 9 Superposition, Parallel Composition trajectory-prefix is treated as action-prefix trajectory-prefix is treated as action-prefix

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 10 Application of SOS

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 11 Expansion Law

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 12 Future Plans (I) Simulation of hybrid systems Simulation of continuous behaviour using ODE/DAE Solvers Resolving guard and parameterised action- prefix expressions Application of Expansion Law Simulation of hybrid systems Simulation of continuous behaviour using ODE/DAE Solvers Resolving guard and parameterised action- prefix expressions Application of Expansion Law

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 13 Future Plans (II) “Sand-box” tool playground for hybrid phenomena investigation testing algorithms changes in language (BHPC) co-simulation “Sand-box” tool playground for hybrid phenomena investigation testing algorithms changes in language (BHPC) co-simulation

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 14 Future Plans (III): Visualisation Process 1 Process 2 q1q2q3q1q2q3 □□□□□□ v v q1q2q4q1q2q4 □□□□□□ v v a1a1 a2a2 a3a3 a3a3 Message Sequence Charts for discrete behaviour Graphs for continuous behaviour

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 15 Future Plans (IV) Model-based testing Theory for model-based testing of hybrid systems Integration with TorX (H. Bohnenkamp & A. Belinfante. Timed testing with TorX. 2005) Model-based testing Theory for model-based testing of hybrid systems Integration with TorX (H. Bohnenkamp & A. Belinfante. Timed testing with TorX. 2005)

Tomas Krilavičius and Helen Schonenberg Discrete Simulation of BHPC 16 Conclusions Work in progress Abstractions of continuous behaviour Evaluation of Behavioural Hybrid Process Calculus Work in progress Abstractions of continuous behaviour Evaluation of Behavioural Hybrid Process Calculus