Мрежа на Петри (Bulgarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Мрежа на Петри" in Bulgarian language version.

refsWebsite

Global rank Bulgarian rank

207^th place

1,406^th place

7,215^th place

7,518^th place

1web.archive.org

1^st place

1^st place

ntnu.no

idi.ntnu.no

P. Küngas. Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies Архив на оригинала от 2012-02-09 в Wayback Machine.. In: Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation, SARA 2005, Airth Castle, Scotland, UK, July 26 – 29, 2005]

psu.edu

citeseer.ist.psu.edu

Lipton, R. "The Reachability Problem Requires Exponential Space", Technical Report 62, Yale University, 1976]

web.archive.org

P. Küngas. Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies Архив на оригинала от 2012-02-09 в Wayback Machine.. In: Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation, SARA 2005, Airth Castle, Scotland, UK, July 26 – 29, 2005]