{"id":"https://openalex.org/W2030810725","doi":"https://doi.org/10.1016/s1571-0661(05)80293-2","title":"Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding","display_name":"Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2030810725","doi":"https://doi.org/10.1016/s1571-0661(05)80293-2","mag":"2030810725"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80293-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80293-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80293-2","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014945719","display_name":"Rom Langerak","orcid":"https://orcid.org/0000-0002-1955-5183"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Rom Langerak","raw_affiliation_strings":["Department of Computer Science University of Twente PO Box 217, 7500 AE Enschede The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Twente PO Box 217, 7500 AE Enschede The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014945719"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":null,"apc_paid":null,"fwci":0.977,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7536637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":null,"first_page":"25","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9988999962806702,"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/rewriting","display_name":"Rewriting","score":0.9138827919960022},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7552667856216431},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.7541342377662659},{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.6751566529273987},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.6745724081993103},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5573477149009705},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4644235670566559},{"id":"https://openalex.org/keywords/graph-algebra","display_name":"Graph algebra","score":0.45024797320365906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40933287143707275},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3855782151222229},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30672818422317505},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.201808899641037},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15933194756507874},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10385525226593018}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.9138827919960022},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7552667856216431},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.7541342377662659},{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.6751566529273987},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.6745724081993103},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5573477149009705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4644235670566559},{"id":"https://openalex.org/C45961005","wikidata":"https://www.wikidata.org/wiki/Q5597072","display_name":"Graph algebra","level":5,"score":0.45024797320365906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40933287143707275},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3855782151222229},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30672818422317505},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.201808899641037},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15933194756507874},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10385525226593018},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s1571-0661(05)80293-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80293-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire/676b737a-0e60-4573-a474-3829af865985","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/676b737a-0e60-4573-a474-3829af865985","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Langerak, R 1999, Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding. in I Castellani & B Victor (eds), EXPRESS'99 : 6th International Workshop on Expressiveness in Concurrency. Electronic Notes in Theoretical Computer Science, vol. 27, Elsevier, pp. 24-41, 6th International Workshop on Expressiveness in Concurrency, EXPRESS 1999, Eindhoven, Netherlands, 23/08/99. https://doi.org/10.1016/S1571-0661(05)80293-2","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.3657","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.3657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://extranet.telin.nl/dscgi/ds.py/Get/File-8326/rom2.ps.Z","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80293-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80293-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W25765579","https://openalex.org/W1501210080","https://openalex.org/W1547086068","https://openalex.org/W1570626776","https://openalex.org/W1601028213","https://openalex.org/W1780296805","https://openalex.org/W1880480814","https://openalex.org/W1937565299","https://openalex.org/W1965237160","https://openalex.org/W1991052229","https://openalex.org/W2031124364","https://openalex.org/W2040633651","https://openalex.org/W2087409327","https://openalex.org/W2099620341","https://openalex.org/W2104316803","https://openalex.org/W2121005961","https://openalex.org/W2121372686","https://openalex.org/W2159758671","https://openalex.org/W2277041087","https://openalex.org/W2476617865","https://openalex.org/W2486098144","https://openalex.org/W3144368627","https://openalex.org/W4210886820","https://openalex.org/W6629897196","https://openalex.org/W6634110849","https://openalex.org/W6635887675","https://openalex.org/W6638125342","https://openalex.org/W6640673617","https://openalex.org/W6674946643","https://openalex.org/W7034239431"],"related_works":["https://openalex.org/W1761458962","https://openalex.org/W2463026518","https://openalex.org/W1515515243","https://openalex.org/W4206221271","https://openalex.org/W3172487478","https://openalex.org/W2504157767","https://openalex.org/W2475418661","https://openalex.org/W1504820687","https://openalex.org/W2491573813","https://openalex.org/W1569493237"],"abstract_inverted_index":{"The":[0,27],"starting":[1],"point":[2],"of":[3,11,32],"this":[4],"paper":[5,28],"is":[6,48,68,81,90],"McMillan's":[7],"complete":[8,43],"finite":[9,44],"prefix":[10,54],"an":[12,85],"unfolding":[13],"that":[14,59,101],"has":[15],"been":[16],"obtained":[17],"from":[18,41,52,75],"a":[19,23,55,98],"Petri":[20],"net":[21],"or":[22],"process":[24],"algebra":[25],"expression.":[26],"addresses":[29],"the":[30,36,42,53,65,76,93],"question":[31],"how":[33,70,92],"to":[34,50,63,71],"obtain":[35],"(possibly":[37],"infinite)":[38],"system":[39,58,79,96,100],"behaviour":[40],"prefix.":[45],"An":[46],"algorithm":[47],"presented":[49],"derive":[51],"graph":[56,77,94],"rewriting":[57,78,95],"can":[60,102],"be":[61,103],"used":[62,104],"construct":[64],"unfolding.":[66],"It":[67],"shown":[69],"generate":[72],"event":[73],"sequences":[74],"which":[80],"important":[82],"for":[83,105],"constructing":[84],"interactive":[86],"simulator.":[87],"Finally":[88],"it":[89],"indicated":[91],"yields":[97],"transition":[99],"model":[106],"checking":[107],"and":[108],"test":[109],"derivation.":[110]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}