{"id":"https://openalex.org/W1484092460","doi":"https://doi.org/10.1007/3-540-56863-8_54","title":"Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net","display_name":"Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W1484092460","doi":"https://doi.org/10.1007/3-540-56863-8_54","mag":"1484092460"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-56863-8_54","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-56863-8_54","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108592838","display_name":"Peter Kemper","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peter Kemper","raw_affiliation_strings":["Informatik IV, Universit\u00e4t Dortmund, Postfach 50 05 00, 4600, Dortmund 50, Germany","Universit\u00e4t Dortmund"],"affiliations":[{"raw_affiliation_string":"Informatik IV, Universit\u00e4t Dortmund, Postfach 50 05 00, 4600, Dortmund 50, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Universit\u00e4t Dortmund","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108592838"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8121,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.89438944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"319","last_page":"338"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.79998379945755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7850104570388794},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.7763861417770386},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.640312135219574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49227872490882874},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4735787808895111},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4572261869907379},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32274526357650757},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.22505712509155273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1852400004863739}],"concepts":[{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.79998379945755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7850104570388794},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.7763861417770386},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.640312135219574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49227872490882874},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4735787808895111},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4572261869907379},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32274526357650757},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.22505712509155273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1852400004863739},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-56863-8_54","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-56863-8_54","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.7958","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ls4-www.informatik.uni-dortmund.de/QM/MA/pk/publication_ps_files/1993_improved_FCnet_analysis.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.6463","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://fbi-news.informatik.uni-dortmund.de/pub/ls04-info/papers/QM/1993_improved_FCnet_analysis.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1496170950","https://openalex.org/W1540043875","https://openalex.org/W1563959012","https://openalex.org/W1567314218","https://openalex.org/W1598786918","https://openalex.org/W2068247526","https://openalex.org/W2118382442","https://openalex.org/W2414573311","https://openalex.org/W2500299482","https://openalex.org/W6667550989"],"related_works":["https://openalex.org/W397120980","https://openalex.org/W1528537929","https://openalex.org/W3021060317","https://openalex.org/W2971368204","https://openalex.org/W2912321008","https://openalex.org/W3013085049","https://openalex.org/W2149817600","https://openalex.org/W1557816992","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}