VivekSingh - n ) time complex Algorithms from [yy] - Linear...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Petri Net based semantic engine Vivek Singh, SEECS, UCF Feb 7, 2002
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Motivation Structural Description GUI based Standard XML Representation
Background image of page 2
Associated Work Elsewhere PNML at Humboldt University at Berlin Petri Net Kernel - GUI Osaka University, Japan - Algorithms Javier Esparza’s work Dr. Marinescu’s paper[xx]
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Bird’s Eye View Design the petri net in graphical interface using the Petri Net Kernel Is the petri net Free Choice Decompose the net into it's S-Components Convert the S-Components into FSM s. Write the FSM in the blueprint language No Yes 1 2 3 4 5
Background image of page 4
Description of Blocks . .. GUI PNK framework Complete Java implementation XML intermediate form Complete as already existing
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Is it FC ? Brute force check Within PNK framework Complete - minimal coding … Description of Blocks . ..
Background image of page 6
S-Decomposition Naïve is O(m
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n ) time complex Algorithms from [yy] - Linear (quadratic) In progress Description of Blocks . .. S-Components to FSM Dr. Marinescu paper [xx] Dummy transitions Adding Synchronization to p-state strategies Work not started yet Description of Blocks . .. FSM to Blueprint Fairly straightforward All states (p and t) in FSM to blueprint states State transitions Strategies of p- states to be altered for synchronization Work not started Description of Blocks . .. References [1]K. Palacz, L. Boloni, and Dan C. Marinescu. The isomorphism between a Class of lace Transition Nets and a Multi_plane State Machine Agent Model. [2]Polynomial Order decomposition algorithms for free choice systems. T. Nishimura, D. S. Lee, S. Kungai...
View Full Document

This note was uploaded on 07/30/2011 for the course COP 5600 taught by Professor Staff during the Summer '11 term at University of Central Florida.

Page1 / 10

VivekSingh - n ) time complex Algorithms from [yy] - Linear...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online