{"id":"https://openalex.org/W2115853595","doi":"https://doi.org/10.1142/s0129626406002502","title":"New Efficient Petri Nets Reductions for Parallel Programs Verification","display_name":"New Efficient Petri Nets Reductions for Parallel Programs Verification","publication_year":2006,"publication_date":"2006-03-01","ids":{"openalex":"https://openalex.org/W2115853595","doi":"https://doi.org/10.1142/s0129626406002502","mag":"2115853595"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626406002502","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626406002502","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","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/A5006881035","display_name":"Serge Haddad","orcid":"https://orcid.org/0000-0002-1759-1201"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Serge HADDAD","raw_affiliation_strings":["LAMSA DE-CNRS UMR 7024 Universit\u00e9 Paris-Dauphine, Place du Mar\u00e9chal de Lattre de Tassigny, 75775 Paris Cedex 16, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSA DE-CNRS UMR 7024 Universit\u00e9 Paris-Dauphine, Place du Mar\u00e9chal de Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110712605","display_name":"Jean\u2010Fran\u00e7ois Pradat\u2010Peyre","orcid":null},"institutions":[{"id":"https://openalex.org/I124158823","display_name":"Conservatoire National des Arts et M\u00e9tiers","ror":"https://ror.org/0175hh227","country_code":"FR","type":"education","lineage":["https://openalex.org/I124158823","https://openalex.org/I4210134562"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Fran\u00e7ois PRADAT-PEYRE","raw_affiliation_strings":["CEDRIC EA 1395, Conservatoire National des Arts et M\u00e9tiers, 292 rue Saint Martin, 75141 Paris Cedex 03, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CEDRIC EA 1395, Conservatoire National des Arts et M\u00e9tiers, 292 rue Saint Martin, 75141 Paris Cedex 03, France","institution_ids":["https://openalex.org/I124158823"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0356,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.91420367,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"01","first_page":"101","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9995999932289124,"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.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.916603147983551},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.880510687828064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7162213325500488},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6396646499633789},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.5048795342445374},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4962771534919739},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.49311563372612},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4841609597206116},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4588220417499542},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39742305874824524},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3590599298477173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24952206015586853}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.916603147983551},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.880510687828064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7162213325500488},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6396646499633789},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.5048795342445374},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4962771534919739},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.49311563372612},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4841609597206116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4588220417499542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39742305874824524},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3590599298477173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24952206015586853},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129626406002502","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626406002502","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.151.5461","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.5461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HP-ppl06.pdf","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":17,"referenced_works":["https://openalex.org/W1493186690","https://openalex.org/W1513309337","https://openalex.org/W1534926211","https://openalex.org/W1953761882","https://openalex.org/W2072062729","https://openalex.org/W2080593426","https://openalex.org/W2102640269","https://openalex.org/W2104508180","https://openalex.org/W2114346176","https://openalex.org/W2120599823","https://openalex.org/W2125165081","https://openalex.org/W2147351452","https://openalex.org/W2168704035","https://openalex.org/W2179661259","https://openalex.org/W2618896829","https://openalex.org/W2664559385","https://openalex.org/W2912676451"],"related_works":["https://openalex.org/W2124283471","https://openalex.org/W2004753716","https://openalex.org/W2330065971","https://openalex.org/W2066603162","https://openalex.org/W2031305780","https://openalex.org/W2107690674","https://openalex.org/W2120541137","https://openalex.org/W2391817608","https://openalex.org/W2380939061","https://openalex.org/W2382668819"],"abstract_inverted_index":{"Structural":[0],"model":[1],"abstraction":[2],"is":[3],"a":[4,12,45,49,109,115],"powerful":[5],"technique":[6],"for":[7],"reducing":[8],"the":[9,38,41,57,69,95,99],"complexity":[10],"of":[11,40,48,56,68,98,114,118],"state":[13],"based":[14,33],"enumeration":[15],"analysis.":[16],"We":[17,71],"present":[18],"in":[19],"this":[20],"paper":[21],"new":[22],"efficient":[23],"Petri":[24],"nets":[25],"reductions.":[26,101],"First,":[27],"we":[28,104],"define":[29],"\"behavioural\"":[30],"reductions":[31,85],"(i.e.":[32,51],"on":[34,108],"conditions":[35,77],"related":[36],"to":[37,74,84],"language":[39],"net)":[42],"which":[43],"preserve":[44],"fundamental":[46],"property":[47],"net":[50],"liveness)":[52],"and":[53,91,111],"any":[54],"formula":[55],"(action-based)":[58],"linear":[59],"time":[60],"logic":[61],"that":[62,86],"does":[63],"not":[64],"observe":[65],"reduced":[66],"transitions":[67],"net.":[70],"show":[72],"how":[73],"replace":[75],"these":[76],"by":[78],"structural":[79],"or":[80],"algebraical":[81],"ones":[82],"leading":[83],"can":[87],"be":[88],"efficiently":[89],"checked":[90],"applied":[92],"whereas":[93],"enlarging":[94],"application":[96],"spectrum":[97],"previous":[100],"At":[102],"last,":[103],"illustrate":[105],"our":[106],"method":[107],"significant":[110],"typical":[112],"example":[113],"synchronisation":[116],"pattern":[117],"parallel":[119],"programs.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}