Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
27
click to vote
AC
2003
Springer
favorite
Email
discuss
report
147
views
Software Engineering
»
more
AC 2003
»
Unbounded Petri Net Synthesis
14 years 1 months ago
Download
www.irisa.fr
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable markings may be infinite.
Philippe Darondeau
Real-time Traffic
AC 2003
|
Software Engineering
|
Unlabelled Place-transition Nets
|
claim paper
Related Content
»
A Petri Net Synthesis Method
»
A structural encoding technique for the synthesis of asynchronous circuits
»
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
»
How to synthesize nets from languages a survey
»
Computing Optimal Coverability Costs in Priced Timed Petri Nets
»
Diagnosability analysis of unbounded Petri nets
»
A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms
»
Petri nets design based on neural networks
»
Variants of the Language Based Synthesis Problem for Petri Nets
more »
Post Info
More Details (n/a)
Added
06 Jul 2010
Updated
06 Jul 2010
Type
Conference
Year
2003
Where
AC
Authors
Philippe Darondeau
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision