{"id":"https://openalex.org/W7100412951","doi":null,"title":"Obtaining Memory-Ecient Reachability Graph Representations Using the Sweep-Line Method","display_name":"Obtaining Memory-Ecient Reachability Graph Representations Using the Sweep-Line Method","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7100412951"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.654.9609","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.654.9609","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://westergaard.eu/wp-content/papercite-data/pdf/patchgraph.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7100412951"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5071092440","display_name":"Thomas Mailund","orcid":"https://orcid.org/0000-0001-6206-9239","observed_orcids":["https://orcid.org/0000-0001-6206-9239"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Mailund","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5079063663","display_name":"Michael Westergaard","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Westergaard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9380000233650208,"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.9380000233650208,"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/T10142","display_name":"Formal Methods in Verification","score":0.04969999939203262,"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/T11195","display_name":"Simulation Techniques and Applications","score":0.001500000013038516,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability-graph","display_name":"reachability graph","score":0.9559999704360962},{"id":"https://openalex.org/keywords/state-enumeration","display_name":"state enumeration","score":0.5149999856948853},{"id":"https://openalex.org/keywords/petri-nets","display_name":"Petri nets","score":0.8059999942779541},{"id":"https://openalex.org/keywords/reachable-markings","display_name":"reachable markings","score":0.8080000281333923}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8860999941825867},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5702000260353088},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5220999717712402},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5141000151634216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5085999965667725},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.436599999666214},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39719998836517334},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.37369999289512634},{"id":"https://openalex.org/C2777798563","wikidata":"https://www.wikidata.org/wiki/Q7603916","display_name":"State vector","level":2,"score":0.37290000915527344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36250001192092896},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.2590999901294708}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.654.9609","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.654.9609","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://westergaard.eu/wp-content/papercite-data/pdf/patchgraph.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1820238131","https://openalex.org/W7051697789","https://openalex.org/W198355124","https://openalex.org/W7096312914","https://openalex.org/W1979520342","https://openalex.org/W2031251427","https://openalex.org/W7098210329","https://openalex.org/W2612229058","https://openalex.org/W6931518005","https://openalex.org/W3080640799"],"abstract_inverted_index":{"Abstract.":[0],"This":[1],"paper":[2],"is":[3],"concerned":[4],"with":[5],"a":[6,14,25,46],"memory-ecient":[7],"representa-tion":[8],"of":[9,27,53,69],"reachability":[10],"graphs.":[11],"We":[12],"describe":[13],"technique":[15,40,72],"that":[16],"enables":[17],"us":[18],"to":[19,30,61],"represent":[20],"each":[21,42],"reachable":[22,54],"marking":[23],"in":[24],"number":[26,47,52],"bits":[28],"close":[29],"the":[31,51,58,63,70],"the-oretical":[32],"minimum":[33],"needed":[34],"for":[35],"explicit":[36],"state":[37,43,64],"enumeration.":[38],"The":[39],"maps":[41],"vector":[44],"onto":[45],"between":[48],"zero":[49],"and":[50,56,76],"states":[55],"uses":[57],"sweep-line":[59],"method":[60],"delete":[62],"vectors":[65],"themselves.":[66],"A":[67],"prototype":[68],"proposed":[71],"has":[73],"been":[74],"im-plemented":[75],"experimental":[77],"results":[78],"are":[79],"reported.":[80]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7100412951","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}
