Coverability Trees for Petri Nets with Unordered Data

@inproceedings{Hofman2011CoverabilityTF,
  title={Coverability Trees for Petri Nets with Unordered Data},
  author={Piotr Hofman and Slawomir Lasota and Ranko Lazic and J{\'e}r{\^o}me Leroux and Sylvain Schmitz and Patrick Totzke},
  booktitle={FoSSaCS},
  year={2011}
}
We study an extension of classical Petri nets where tokens carry values from a countable data domain, that can be tested for equality upon firing transitions. These Unordered Data Petri Nets (UDPN) are well-structured and therefore allow generic decision procedures for several verification problems including coverability and boundedness. 
BETA

Figures and Topics from this paper.

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

Parallel Program Schemata

  • J. Comput. Syst. Sci.
  • 1969
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

An algorithm for the general Petri net reachability problem

E. W. Mayr
  • Proc. STOC’81. pp. 238–246. ACM
  • 1981
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Automata theory in nominal sets

  • Logical Methods in Computer Science
  • 2014
VIEW 1 EXCERPT

On selective unboundedness of VASS

  • J. Comput. Syst. Sci.
  • 2013
VIEW 1 EXCERPT