@inproceedings{504b440d014f432c87324d9d6a4bfaec,
title = "Reachability in reversible free choice systems",
abstract = "We give a structural characterisation of reachable states for a subclass of marked Free Choice Petri Nets. The nets of this subclass are those enjoying three properties (liveness, boundedness, reversibility) which are frequently part of the specification of reactive systems. We show that the reachability problem for this subclass can be solved in polynomial time in the size of the net.",
author = "J{\"o}rg Desel and Javier Esparza",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 8th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1991 ; Conference date: 14-02-1991 Through 16-02-1991",
year = "1991",
doi = "10.1007/BFb0020814",
language = "English",
isbn = "9783540537090",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "384--397",
editor = "Christian Choffrut and Matthias Jantzen",
booktitle = "STACS 1991 - 8th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",
}