Real-Time Synchronised Petri Nets Giovanna Di Marzo Serugendo Dino Mandrioli, Didier Buchs, Nicolas Guelfi University of Geneva, Switzerland PN’02 / 24th.

Slides:



Advertisements
Similar presentations
From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining Nikola Trčka Mykola Pechenizkiy.
Advertisements

Petri Net1 :Abstract formal model of information flow Major use: Modeling of systems of events in which it is possible for some events to occur concurrently,
Concurrent Operational Semantics of Safe Time Petri Nets Claude Jard European University of Brittany, ENS Cachan Bretagne, IRISA Campus de Ker-Lann,
1 SE-561 Formal Methods in Software Petri Nets - I.
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.
Petri Nets Section 2 Roohollah Abdipur.
Based on: Petri Nets and Industrial Applications: A Tutorial
SATEL Semi Automatic TEsting Language University of Geneva Levi Lúcio, Didier Buchs M-TOOS, Portland 4/30/2015.
1 Mechanical Verification of Timed Automata Myla Archer and Constance Heitmeyer Presented by Rasa Bonyadlou 24 October 2002.
On the Dynamics of PB Systems with Volatile Membranes Giorgio Delzanno* and Laurent Van Begin** * Università di Genova, Italy ** Universitè Libre de Bruxelles,
IE 469 Manufacturing Systems
Simulation of Spiking Neural P Systems Using Pnet Lab Authors Padmavati Metta Kamala Krithivasan Deepak Garg.
Equivalence of open Petri nets Modeling and analysis with Petri net components. Marc Voorhoeve (AIS)
1 Flexible Subtyping Relations for Component- Oriented Formalisms and their Verification David Hurzeler PhD Examination, 9/11/2004.
Petri net modeling of biological networks Claudine Chaouiya.
Synthesis of Embedded Software Using Free-Choice Petri Nets.
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.
A Schedulability-Preserving Transformation of BDF to Petri Nets Cong Liu EECS 290n Class Project December 10, 2004.
Modeling Worldviews Activity Scanning – Petri Nets and Event Graphs Event Scheduling – Event Graphs State Machines Process Interaction –Block Flow Diagrams.
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.
A 14← department of mathematics and computer science PROSE Checking Properties of Adaptive Workflow Nets K. van Hee, I. Lomazova, O. Oanea,
Software Engineering, COMP201 Slide 1 Protocol Engineering Protocol Specification using CFSM model Lecture 30.
Models of Computation for Embedded System Design Alvise Bonivento.
SATEL Semi Automatic TEsting Language University of Geneva Levi Lúcio VALID Meeting - Besançon 10/3/06.
High-Level System Design Using Foresight Giovanna Di Marzo Serugendo IT / CE.
THE OBJECT-ORIENTED DESIGN WORKFLOW Statechart Diagrams.
Petri Net Modeling for dynamic MM composite Object.
History-Dependent Petri Nets Kees van Hee, Alexander Serebrenik, Natalia Sidorova, Wil van der Aalst ?
Mata kuliah :K0362/ Matematika Diskrit Tahun :2008
Petri Nets An Overview IE 680 Presentation April 30, 2007 Renata Kopach- Konrad.
Partial Order Semantics of Types of Nets Robert Lorenz, Gabriel Juhás, Sebastian Mauser SOFSEM 2009, Špindlerův Mlýn, CZ, 27th February 2009.
PETRINETS Nipun Devlekar Zauja Lahtau. PETRINETS DEFINITION : DEFINITION :  PETRINET (place/ transition net): a formal, graphical, executable technique.
Linear and Branching Time Safety, Liveness, and Fairness
Jorge Muñoz-Gama Universitat Politècnica de Catalunya (Barcelona, Spain) Algorithms for Process Conformance and Process Refinement.
Modeling with ordinary Petri Nets Events: Actions that take place in the system The occurrence of these events is controlled by the state of the system.
1 Levi Lúcio © A Test Selection Language for CO-OPN Specifications Levi Lúcio, Luis Pedro and Didier Buchs University of Geneva.
CY2003 Computer Systems Lecture 7 Petri net. © LJMU, 2004CY2003- Week 72 Overview Petri net –concepts –Petri net representation –Firing a transition –Marks.
Timed Use Case Maps Jameleddine Hassine Concordia University, Montreal, Canada URN Meeting, Ottawa, January 16-18, 2008.
On Reducing the Global State Graph for Verification of Distributed Computations Vijay K. Garg, Arindam Chakraborty Parallel and Distributed Systems Laboratory.
Stochastic Activity Networks ( SAN ) Sharif University of Technology,Computer Engineer Department, Winter 2013 Verification of Reactive Systems Mohammad.
Integrating UML and Petri Nets Problem with Current Software Engineering Methodology Stochastic Petri nets and their useful properties Translating UML.
Generalized stochastic Petri nets (GSPN)
Petri Nets Lecturer: Roohollah Abdipour. Agenda Introduction Petri Net Modelling with Petri Net Analysis of Petri net 2.
Modelling by Petri nets
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
School of Computer Science & Software Engineering
CAP 4800/CAP 5805: Computer Simulation Concepts
1 Petri Nets Ina Koch and Monika Heiner. 2 Petri Nets(1962) Carl Adam Petri.
/faculteit technologie management PN-1 Petri nets refresher Prof.dr.ir. Wil van der Aalst Eindhoven University of Technology, Faculty of Technology Management,
Capturing Requirements. Questions to Ask about Requirements 1)Are the requirements correct? 2)Consistent? 3)Unambiguous? 4)Complete? 5)Feasible? 6)Relevant?
Review n System dynamics : A sequence of state transition n model : A set of rules for state transition System S X Y Discrete event system FSM (Automata)
/faculteit technologie management PN-1 Petri nets refresher Prof.dr.ir. Wil van der Aalst Eindhoven University of Technology, Faculty of Technology Management,
Petri-Nets and Other Models
Technology of information systems Lecture 5 Process management.
Concurrent Systems Modeling using Petri Nets
Clockless Computing COMP
High-level System Design Using Foresight
Stochastic Activity Networks
Computation of Minimal Siphons for a Class of Generalized Petri Nets
COT 5611 Operating Systems Design Principles Spring 2012
CAP 4800/CAP 5805: Computer Simulation Concepts
CAP 4800/CAP 5805: Computer Simulation Concepts
بسمه‌تعالي فصل چهاردهم شبکه‌هاي پتري.
CSCI1600: Embedded and Real Time Software
CAP 4800/CAP 5805: Computer Simulation Concepts
Petri Net :Abstract formal model of information flow Major use:
CSCI1600: Embedded and Real Time Software
COT 5611 Operating Systems Design Principles Spring 2014
Presentation transcript:

Real-Time Synchronised Petri Nets Giovanna Di Marzo Serugendo Dino Mandrioli, Didier Buchs, Nicolas Guelfi University of Geneva, Switzerland PN’02 / 24th June 2002Giovanna Di Marzo Serugendo

2 Motivations w Synchronised Petri Nets CO-OPN w Real-Time Time interval attached to transitions w Inhibitor Arcs Maximum number of tokens in place * Real-Time Synchronised Petri Nets

3 Synchronised Petri nets w Concurrent Object-Oriented Petri Nets Object-Orientation External and Internal Transitions Synchronisation Requests simple simultaneity, sequence, alternative operators transactional semantics (all or nothing) Abstract Data Types w This paper: Object-based Time stamped mono colored token

4 Real-Time w Time Interval Attached to each transition Merlin-Farber model Instantaneous firing Time of Firing: Bound by time interval in R + Relative to time when transition becomes enabled

5 move [5..15] put [2..10] O1O2 p1p processing [1..9] Real-Time Synchronised Petri Nets Methods Transition Time Interval Synchronisation Objects

6 move [5..15] put [2..10] O1O2 p1p processing [1..9] Real-Time Synchronised Petri Nets 5X

7 move [5..15] put [2..10] O1O2 p1p processing [1..9] 5 X

8 move [5..15] put [2..10] O1O2 p1p processing [1..9] Real-Time Synchronised Petri Nets 7

9 Semantics w How to deal with: Merlin-Farber and Synchronisations Firing respecting Time interval Tokens production time w Synchronisation Intersection of time intervals for simultaneity Correct time of production of tokens for sequence Non-determinism in the case of alternative w Inhibitor Arcs Ensure inhibitor arc condition even with chains of synchronisations

10 Semantics w Structured Operational Semantics Rules (SOS) w 4 Steps Weak Transition System Strong Transition System Expanded Transition System (Synchronisation) Observable Strong Time Semantics paths starting from initial marking

11 Transition System w Events Methods and Transitions Synchronisation /Simultaneous / Sequence / Alternative w Markings Time Stamped Tokens w Time of Firing 2

12 Weak Transition System w Single Firings synchronisation is not taken into account time of firing occurs in time interval inhibitor arc condition is verified post-condition produces tokens stamped at time of firing w Elapsed Time Interval does not impose transition firing at maximal bound of interval

13 SOS Rules move [5..15] put [2..10] O1O2 p1p processing [1..9] X 5

14 Strong Transition System w Elapsed Time Interval Transition has to fire Remove transitions that prevent other transitions to fire when time elapses w Two transitions reaching maximal bound of firing at the same time: both are allowed one may still disable the other

15 Expanded Transition System w Synchronisation move and put must fire at the same time result takes into account both firings Observable Transition: only move w Simultaneity Both transitions occur at the same time Observable Transition: e1 // e2

16 Expanded Transition System w Sequence Transition e1 fires before e2 (t1 < t2) Observable transition: e1.. e2 Tokens stamped at t1 and t2 Tokens stamped at t2: not available before t2 w Alternative Transition e1 or transition e2 fires at t Observable transition: e1 + e2 Tokens stamped at t Result: due to e1 or e2

17 Synchronisation 5 5 5

18 Strong Time Semantics w Retain observable transitions reachable from initial marking w Time increases * Semantics = paths of transitions starting from initial marking

19 Strong Time Semantics {0,0,0},{} move,5 {0,0},{5} put,2 {0,0,0},{2} {0,0},{} processing,6 move,6 put,6 {0},{6} {0,0},{6}... {0,0,0},{} processing,3... {0,0},{5.5} move + put, time

20 Train w Railroad Crossing System w Specification Trains Level Crossing w Safety and Utility Properties determination of time needed to operate the bar

21 Conclusion w Syntax and Semantics of Real-time Synchronised Petri Nets w Towards: Object-Oriented Real-Time Petri Nets w True Operational Semantics already realised first step towards reachability analysis w Future Work Axiomatisation: formal verification of properties