Simulation of Spiking Neural P Systems Using Pnet Lab Authors Padmavati Metta Kamala Krithivasan Deepak Garg.

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

Distributed Snapshots: Determining Global States of Distributed Systems - K. Mani Chandy and Leslie Lamport.
Static Provenance Verification for Message Passing Programs Rupak Majumdar Roland MeyerZilong Wang MPI-SWSTU KaiserslauternMPI-SWS.
1 SE-561 Formal Methods in Software Petri Nets - I.
Knowledge Based Synthesis of Control for Distributed Systems Doron Peled.
An Introduction to Petri Nets
Principles of Engineering System Design Dr T Asokan
Introduction to Petri Nets Hugo Andrés López
A university for the world real R © 2009, Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede.
Vered Gafni – Formal Development of Real Time Systems 1 Statecharts Semantics.
Petri Nets Section 2 Roohollah Abdipur.
Based on: Petri Nets and Industrial Applications: A Tutorial
Timed Automata.
WMC8 – Thessaloniki, Greece Some Applications of Spiking Neural P Systems Mihai Ionescu 1 & Dragoş Sburlan 2 1 URV, Research Group on Mathematical Linguistics,
IE 469 Manufacturing Systems
Distributed Computing 5. Snapshot Shmuel Zaks ©
Requirements on the Execution of Kahn Process Networks Marc Geilen and Twan Basten 11 April 2003 /e.
Discrete Interaction Design Specification Prof. Dr. Matthias Rauterberg Faculty Industrial Design Technical University of Eindhoven
1 Simulator-Model Checker for Reactive Real-Time Abstract State Machines Anatol Slissenko University Paris 12 Pavel Vasilyev University Paris 12 University.
Some Characteristics of Spiking Neural P Systems with Anti-Spikes Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of.
Synthesis of Embedded Software Using Free-Choice Petri Nets.
10. Petri Nets Prof. O. Nierstrasz. Roadmap  Definition: —places, transitions, inputs, outputs —firing enabled transitions  Modelling: —concurrency.
Petri Nets Overview 1 Definition of Petri Net C = ( P, T, I, O) Places P = { p 1, p 2, p 3, …, p n } Transitions T = { t 1, t 2, t 3, …, t n } Input.
CP — Concurrent Programming 12. Petri Nets Prof. O. Nierstrasz Wintersemester 2005 / 2006.
1 Petri Nets H Plan: –Introduce basics of Petri Net models –Define notation and terminology used –Show examples of Petri Net models u Calaway Park model.
FunState – An Internal Design Representation for Codesign A model that enables representations of different types of system components. Mixture of functional.
12/07/2007Jiacun Wang1 SE-561 Math Foundations Petri Nets - II Dr. Jiacun Wang Department of Software Engineering Monmouth University.
Models of Computation for Embedded System Design Alvise Bonivento.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Petri Net Modeling for dynamic MM composite Object.
Mata kuliah :K0362/ Matematika Diskrit Tahun :2008
Regular Model Checking Ahmed Bouajjani,Benget Jonsson, Marcus Nillson and Tayssir Touili Moran Ben Tulila
PETRINETS Nipun Devlekar Zauja Lahtau. PETRINETS DEFINITION : DEFINITION :  PETRINET (place/ transition net): a formal, graphical, executable technique.
Distributed Computing 5. Snapshot Shmuel Zaks ©
A Novel Method for Formally Detecting RFID Event Using Petri Nets SEKE 2011.
An Introduction to Petri Nets Marjan Sirjani Formal Methods Laboratory University of Tehran.
CY2003 Computer Systems Lecture 7 Petri net. © LJMU, 2004CY2003- Week 72 Overview Petri net –concepts –Petri net representation –Firing a transition –Marks.
Kurt Jensen Lars M. Kristensen 1 Coloured Petri Nets Department of Computer Science Coloured Petri Nets Modelling and Validation of Concurrent Systems.
CS412/413 Introduction to Compilers Radu Rugina Lecture 4: Lexical Analyzers 28 Jan 02.
Stochastic Activity Networks ( SAN ) Sharif University of Technology,Computer Engineer Department, Winter 2013 Verification of Reactive Systems Mohammad.
C. André, J. Boucaron, A. Coadou, J. DeAntoni,
Generalized stochastic Petri nets (GSPN)
Hardware Design and The Petri Net Abhijit K. Deb SAM, LECS, IMIT, KTH Kista, Stockholm.
Petri Nets Lecturer: Roohollah Abdipour. Agenda Introduction Petri Net Modelling with Petri Net Analysis of Petri net 2.
CAP 4800/CAP 5805: Computer Simulation Concepts
Modelling by Petri nets
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
Ch5: Software Specification. 1 Petri Nets  Introduced by C. Adams Petri in  Widely used in the modeling and analysis of computer systems.  Basic.
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
School of Computer Science & Software Engineering
Capturing Requirements. Questions to Ask about Requirements 1)Are the requirements correct? 2)Consistent? 3)Unambiguous? 4)Complete? 5)Feasible? 6)Relevant?
Flowcharts C++ Lab. Algorithm An informal definition of an algorithm is: a step-by-step method for solving a problem or doing a task. Input data A step-by-step.
Petri-Nets and Other Models
Solving Numerical NP-complete Problems with Spiking Neural P Systems Dipartimento di Informatica, Sistemistica e Comunicazione Università degli Studi di.
2008/10E-Enterprise Integration - eEI1 Lecture 6 Petri Net Techniques for Modeling Workflows and Their Support of Reuse.
Matrix Representation of Spiking Neural P Systems with Delay Kamala Krithivasan and Ajeesh Ramanujan Department of Computer Science and Engineering Indian.
Concurrent Systems Modeling using Petri Nets
Dr. Eng Amr T. Abdel-Hamid
Overview of Compilation The Compiler Front End
2. Specification and Modeling
Clockless Computing COMP
Stochastic Activity Networks
CAP 4800/CAP 5805: Computer Simulation Concepts
CAP 4800/CAP 5805: Computer Simulation Concepts
CSCI1600: Embedded and Real Time Software
Dynamic Modeling Lecture # 37.
An Introduction to Petri Nets
CAP 4800/CAP 5805: Computer Simulation Concepts
CSCI1600: Embedded and Real Time Software
Petri Nets Laurie Frazier.
Presentation transcript:

Simulation of Spiking Neural P Systems Using Pnet Lab Authors Padmavati Metta Kamala Krithivasan Deepak Garg

Outline CMC-122 Spiking Neural P (or SN P) system without delay Petri net SN P system without delay to Petri net Simulation using PNetLab

Spiking Neural P system Ionescu, M., P ă un, Gh., Yokomori, T.: Spiking Neural P Systems, Fund. Infor. 71, (2006). Spiking Neural P system is a computational model that has been inspired by neurobiology Distributed and parallel computing model Variant of Membrane System (P System) Uses one type of object called spike (a) Computationally complete CMC-123

O = { a }, the alphabet. a is called spike and ā is called anti-spike. m neurons - σ 1, σ 2, σ 3,..., σ m Syn - Synapses among the neurons. Spike emitted by a neuron i will pass immediately to all neurons j connected to i through synapses. i 0 – Output neuron Spiking Neural P system without delay (Contd.) Π =(O, σ 1, σ 2, σ 3,..., σ m, syn, i 0 ) CMC-124

5 Each neuron σi contains – n i -- initial number of spikes – R i -- finite set of rules of the form 1.Spiking Rules E / a r → a – used when a neuron has n spikes/anti-spikes such that a n ∈ L(E) and n ≥ r where E is a regular expression over { a} r ≥ 0, number of spikes are consumed and a spike is sent to all neighbouring neurons. E is omitted if L(E)=a r SN P systems without delay (contd.)

CMC-126 SN P system without delay (contd.) 2.Forgetting Rules a s →λ - used when a neuron has s number of spikes s ≥ 0, number of spikes are forgotten by the neuron. a s should not be in L(E) for any spiking rule E/a r → a in R i. Configuration of SN P system The configuration of a system at any time is, where n i is the number of spikes present in neuron σ i

a 2 r11 : a 2 / a  a r12 : a 2  a r13: a  λ a 3 r31 : a 3  a r32 : a 2  λ r33: a  a An SN P System without delay п 2 a r21: a  a 3 7CMC-12 1 Initial Configuration

Working of an SN P System CMC-128 A global clock is there and all neurons work in parallel but each neuron can use one rule at a time. There can be more than one rule enabled at any time in a neuron, then a rule is chosen in a non-deterministic way. Using the rules, we pass from one configuration of the system to another configuration. Such a step is called transition. A computation of an SN P system is finite or infinite sequence of transitions starting from the initial configuration.

r12 : a 2  a r13: a  λ r32 : a 2  λ r33: a  a CMC r11:a 2 / a →a a3a3 r21 :a →a a r31 : a 3 →a Evolution 11, 21, 31 a a a a2a2 STEP - 1 a a An SN P System without delay п

Thus as long as neuron 1 uses the rule a 2 /a →a, it sends a spike to other two neurons. One spikes will remains in it and receives one spike from neurons 2 thus a total of 2 spikes in it and the system will be in the same configuration. Evolution 10CMC-12 11, 21, 31 An SN P System without delay п 11, 21, 32

At any moment, neuron 1 can choose the rule a 2 →a, This means all spikes of neuron 1 are consumed so in the next step, it will have one spike instead of two reaching a configuration Evolution 11CMC-12 11, 21, 31 12, 21, 31 12, 21, 32 An SN P System without delay п 11, 21, 32

CMC-1212 r11:a 2 / a →a r12 : a 2  a r31 : a 3 →a r33: a  a r13: a  λ a2a2 r21 :a →a a r32 : a 2  λ Evolution a NEXT STEP a 11, 21, 31 12, 21, 31 12, 21, 32 13, 21, 32 An SN P System without delay п 11, 21, 32

CMC-1213 r11:a 2 / a →a r12 : a 2  a r31 : a 3 →a r32 : a 2  λ r13: a  λ r21 :a →a a r33: a  a Evolution LAST STEP a 11, 21, 31 12, 21, 31 12, 21, 32 13, 21, 32 13, 20, 33 An SN P System without delay п 11, 21, 32

Petri net with guard Petri Nets are formal and graphical models to represent concurrent events Consists of set of places and transitions. Arcs connecting transitions and places, have weights Transitions are associated with enabling conditions called guard functions P1 P3 P2 T G(T)=true if #(P1)=3 14CMC-12

Petri Net Marking A transition t j  T is enabled when each input place has at least a number of tokens equal to the weight of the arc and guard function associated with t i returns true. When a transition fires it removes a number of tokens (equal to the weight of each input arc) from each input place and deposits a number of tokens (equal to the weight of each output arc) to each output place. A marking is an m (no. of places)-vector, containing number of tokens each place. 15CMC-12

Objective of the Paper To design algorithm for translating SN P systems into equivalent Petri net model. To simulate the obtained model using a Java based Petri net tool called PNetLab. 16CMC-12

Translation - SN P system and Petri net 17CMC-12 SN P SystemPetri Net Neurons and EnvironmentPlaces SpikesTokens SynapsesArcs Forgetting RulesSink Transitions (no output place) Spiking RulesTransitions Regular ExpressionGuard function ConfigurationMarking

Translation- Execution Semantics 18CMC-12 SN P SystemPetri Net Sequential at neuron level Synchronizing place is maintained for each place corresponding neuron, so that only one transition is enabled from each input place. Parallel at System LevelParallel execution of transitions

(SN P System to Petri net) a 2 r11: a 2 / a →a Petri Net 1 32 P1 P3 P2 P11-synchronizing place for P1 T11 - Transition corresponding to rule r11 Methodology G(T11)=true if #(P1)=2 19CMC-12 P11

About PNetLab CMC-1220 Java based Petri net tool Allows parallel execution of transitions after resolving conflicts. We can write user defined guard functions in C/C++ Provides step-by-step execution of net in a graphical way It can find Transition-invariants, Place-invariants, minimal siphons, traps, pre-incidence, post-incidence and incidence matrices and coverability tree.

CMC-1221 Petri net in PnetLab for SN P System п

CMC-1222 Specifying conflict management in PnetLab

CMC-1223 Simulation in PnetLab – Step 1

CMC-1224 Simulation in PnetLab – Step 2

CMC-1225 Simulation in PnetLab – Step 4

CMC-1226 Simulation in PnetLab – Step 5

CMC-1227 Markings during Simulation in PnetLab

CMC-1228 If we consider the sub marking-the marking of first three place we get Evolution of SN P System 11, 21, 31 12, 21, 31 12, 21, 32 13, 21, 32 13, 20, 33 11, 21, 32 Which is same as the evolution of the SN P systems

The Significance of the Study To verify and analyze the working of SN P systems without delay. Petri nets can aid in the analysis and verification of SN P systems. Other analytical and verification techniques developed for Petri nets can be deployed to deal with SN P systems. 29CMC-12

30 Thank You