Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

APN
2010
Springer

favoriteEmaildiscussreport

117views Artificial Intelligence» more APN 2010»

Separability in Persistent Petri Nets

13 years 9 months ago

Separability in Persistent Petri Nets

Download parsys.informatik.uni-oldenburg.de

We prove that plain, bounded, reversible and persistent Petri nets are weakly and strongly separable.

Eike Best, Philippe Darondeau

Real-time Traffic

APN 2010 | Artificial Intelligence | Persistent Petri Nets |

claim paper

Related Content

» Independence and Concurrent Separation Logic

» Wellstructured languages

» Analyzing Separation of Duties in Petri Net Workflows

» Interpreted Nets

» SynchNet A Petri Net Based Coordination Language for Distributed Objects

» Evolving Systems Modeling and Simulation through Reflective Petri Nets

» From Process Models to Business Landscapes

» Petri Nets as Executable Specifications of HighLevel Timed Parallel Systems

» Persistence Results for Chemical Reaction Networks with TimeDependent Kinetics and No Glob...

Post Info
More Details (n/a)

Added	18 Jul 2010
Updated	18 Jul 2010
Type	Conference
Year	2010
Where	APN
Authors	Eike Best, Philippe Darondeau

Comments (0)