References

  1. Sandie Balaguer, Thomas Chatain & Stefan Haar (2011): Building Tight Occurrence Nets from Reveals Relations. In: Proc. ACSD.
  2. Albert Benveniste, Eric Fabre, Stefan Haar & Claude Jard (2003): Diagnosis of asynchronous discrete-event systems: a net unfolding approach. IEEE Transactions on Automatic Control 48(5), pp. 714–727, doi:10.1109/TAC.2003.811249.
  3. Joost Engelfriet (1991): Branching Processes of Petri Nets. Acta Informatica 28(6), pp. 575–591, doi:10.1007/BF01463946.
  4. Javier Esparza, Stefan Römer & Walter Vogler (2002): An Improvement of McMillan's Unfolding Algorithm. Formal Methods in System Design 20(3), pp. 285–310.
  5. Eric Fabre & Albert Benveniste (2007): Partial Order Techniques for Distributed Discrete Event Systems: Why You Cannot Avoid Using Them. Discrete Event Dynamic Systems 17(3), pp. 355–403, doi:10.1007/s10626-007-0016-1.
  6. Eric Fabre, Albert Benveniste, Stefan Haar & Claude Jard (2005): Distributed Monitoring of Concurrent and Asynchronous Systems. Discrete Event Dynamic Systems 15(1), pp. 33–84, doi:10.1007/s10626-005-5238-5.
  7. Ursula Goltz (1987): Synchronic distance. In: Advances in Petri nets 1986, part I on Petri nets: central models and their properties. Springer-Verlag, London, UK, pp. 338–358, doi:10.1007/BFb0046844. Available at http://portal.acm.org/citation.cfm?id=28641.28652.
  8. Bernd Grahlmann (1997): The PEP tool. In: Computer Aided Verification, LNCS 1254, pp. 440–443, doi:10.1007/3-540-63166-6_43.
  9. Stefan Haar (2007): Unfold and cover: Qualitative Diagnosability for Petri Nets. In: Proc. CDC. IEEE, pp. 1886–1891, doi:10.1109/CDC.2007.4434691.
  10. Stefan Haar (2009): Qualitative Diagnosability of labeled Petri nets revisited. In: Proc. CDC. IEEE, pp. 1248–1253, doi:10.1109/CDC.2009.5400917.
  11. Stefan Haar (2010): Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets. IEEE Transactions on Automatic Control 55(10), pp. 2310–2320, doi:10.1109/TAC.2010.2063490.
  12. Victor Khomenko, Maciej Koutny & Walter Vogler (2003): Canonical Prefixes of Petri Net Unfoldings. Acta Informatica 40(2), pp. 95–118, doi:10.1007/s00236-003-0122-y.
  13. Kenneth L. McMillan (1992): Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits. In: Proc. CAV, LNCS 663. Springer, pp. 164–177, doi:10.1007/3-540-56496-9_14.
  14. Tadao Murata (1989): Petri nets: Properties, analysis and applications. Proc. IEEE 77(4), pp. 541–580, doi:10.1109/5.24143.
  15. James L. Peterson (1981): Petri Net Theory and the Modeling of Systems. Prentice-Hall.
  16. Wolfgang Reisig (1985): Petri Nets: An Introduction. Monographs in Theoretical Computer Science. An EATCS Series 4. Springer.
  17. Stefan Schwoon: The Mole tool.. http://www.lsv.ens-cachan.fr/ schwoon/tools/mole/.
  18. Wen Zhao, Yu Huang & Chong-Yi Yuan (2008): Synchronic Distance Based Workflow Logic Specification. In: Proc. HPCC, pp. 819–824, doi:10.1109/HPCC.2008.48.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org