ILF and DAWN for Verifying Distributed Algorithms

For the most recent entries see the Petri Nets Newsletter.

ILF and DAWN for Verifying Distributed Algorithms - An Idea for a Tool.

In: Burkhard, H.-D.; Czaja, L.; Starke, P.: Informatik-Berichte, No. 110: Workshop Concurrency, Specification and Programming, 28-30 September 1998, pages 1-8. Berlin: Humboldt-Universität, 1998.

Also in: Fundamenta Informaticae, Vol. 37, No. 3, pages 201-211. February 1999.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography