{"id":"https://openalex.org/W2943944650","doi":"https://doi.org/10.1109/jas.2019.1911486","title":"Verification of hypertorus communication grids by infinite petri nets and process algebra","display_name":"Verification of hypertorus communication grids by infinite petri nets and process algebra","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2943944650","doi":"https://doi.org/10.1109/jas.2019.1911486","mag":"2943944650"},"language":"en","primary_location":{"id":"doi:10.1109/jas.2019.1911486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jas.2019.1911486","pdf_url":null,"source":{"id":"https://openalex.org/S2484288132","display_name":"IEEE/CAA Journal of Automatica Sinica","issn_l":"2329-9266","issn":["2329-9266","2329-9274"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/CAA Journal of Automatica Sinica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/a647375a-9056-41ba-9031-b33e3fa64039","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033228887","display_name":"Dmitry A. Zaitsev","orcid":"https://orcid.org/0000-0001-5698-7324"},"institutions":[{"id":"https://openalex.org/I4210131605","display_name":"Vistula University","ror":"https://ror.org/044sqta95","country_code":"PL","type":"education","lineage":["https://openalex.org/I4210131605"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Dmitry A. Zaitsev","raw_affiliation_strings":["Vistula University, Warsaw 02-787, Poland"],"affiliations":[{"raw_affiliation_string":"Vistula University, Warsaw 02-787, Poland","institution_ids":["https://openalex.org/I4210131605"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053265608","display_name":"Tatiana R. Shmeleva","orcid":"https://orcid.org/0000-0002-4799-3842"},"institutions":[{"id":"https://openalex.org/I4210145845","display_name":"Odessa National O.S.Popov Academy of Telecommunication","ror":"https://ror.org/03fx0zp19","country_code":"UA","type":"education","lineage":["https://openalex.org/I4210145845"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Tatiana R. Shmeleva","raw_affiliation_strings":["A. S. Popov Odessa National Academy of Telecommunications, Odessa 65023, Ukraine"],"affiliations":[{"raw_affiliation_string":"A. S. Popov Odessa National Academy of Telecommunications, Odessa 65023, Ukraine","institution_ids":["https://openalex.org/I4210145845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032619003","display_name":"Jan Friso Groote","orcid":"https://orcid.org/0000-0003-2196-6587"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jan Friso Groote","raw_affiliation_strings":["Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033228887"],"corresponding_institution_ids":["https://openalex.org/I4210131605"],"apc_list":null,"apc_paid":null,"fwci":2.3981,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89775119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"6","issue":"3","first_page":"733","last_page":"742"},"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.9987000226974487,"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.9987000226974487,"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.970300018787384,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.965499997138977,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/petri-net","display_name":"Petri net","score":0.8287403583526611},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.8105515241622925},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.7302541732788086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6386704444885254},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.538307785987854},{"id":"https://openalex.org/keywords/diophantine-equation","display_name":"Diophantine equation","score":0.5219635367393494},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5041300058364868},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4840104281902313},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4783434569835663},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4734862744808197},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4464612603187561},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39299410581588745},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.36543503403663635},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3268299698829651},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2967732846736908},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2055787444114685},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.11573383212089539},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07588601112365723}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8287403583526611},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.8105515241622925},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.7302541732788086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6386704444885254},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.538307785987854},{"id":"https://openalex.org/C206530611","wikidata":"https://www.wikidata.org/wiki/Q905896","display_name":"Diophantine equation","level":2,"score":0.5219635367393494},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5041300058364868},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4840104281902313},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4783434569835663},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4734862744808197},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4464612603187561},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39299410581588745},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.36543503403663635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3268299698829651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2967732846736908},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2055787444114685},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.11573383212089539},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07588601112365723},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/jas.2019.1911486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jas.2019.1911486","pdf_url":null,"source":{"id":"https://openalex.org/S2484288132","display_name":"IEEE/CAA Journal of Automatica Sinica","issn_l":"2329-9266","issn":["2329-9266","2329-9274"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/CAA Journal of Automatica Sinica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/a647375a-9056-41ba-9031-b33e3fa64039","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a647375a-9056-41ba-9031-b33e3fa64039","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zaitsev, D, Shmeleva, T & Groote, J F 2019, 'Verification of hypertorus communication grids by infinite Petri nets and process algebra', IEEE/CAA Journal of Automatica Sinica, vol. 6, no. 3, 8707130, pp. 733-742. https://doi.org/10.1109/JAS.2019.1911486","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:911413","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=911413","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:2329-9266","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:911413","is_oa":false,"landing_page_url":"http://repository.tue.nl/911413","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:2329-9266","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a647375a-9056-41ba-9031-b33e3fa64039","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/a647375a-9056-41ba-9031-b33e3fa64039","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE/CAA Journal of Automatica Sinica, 6(3):8707130, 733 - 742. Institute of Electrical and Electronics Engineers","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/a647375a-9056-41ba-9031-b33e3fa64039","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a647375a-9056-41ba-9031-b33e3fa64039","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zaitsev, D, Shmeleva, T & Groote, J F 2019, 'Verification of hypertorus communication grids by infinite Petri nets and process algebra', IEEE/CAA Journal of Automatica Sinica, vol. 6, no. 3, 8707130, pp. 733-742. https://doi.org/10.1109/JAS.2019.1911486","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W67242188","https://openalex.org/W1610386828","https://openalex.org/W1624233634","https://openalex.org/W1996109622","https://openalex.org/W1996697001","https://openalex.org/W1997821888","https://openalex.org/W2008047931","https://openalex.org/W2043724003","https://openalex.org/W2056495496","https://openalex.org/W2061454845","https://openalex.org/W2070996046","https://openalex.org/W2103517364","https://openalex.org/W2138696525","https://openalex.org/W2156934291","https://openalex.org/W2279838076","https://openalex.org/W2312002461","https://openalex.org/W2423175340","https://openalex.org/W2551937259","https://openalex.org/W2737731249","https://openalex.org/W2753013927","https://openalex.org/W2798503122","https://openalex.org/W2894536886","https://openalex.org/W4205774217","https://openalex.org/W4230290951","https://openalex.org/W4233589650","https://openalex.org/W4285719527","https://openalex.org/W4300305154"],"related_works":["https://openalex.org/W4251986095","https://openalex.org/W2037143823","https://openalex.org/W1990409638","https://openalex.org/W1528153015","https://openalex.org/W1495007874","https://openalex.org/W2382668819","https://openalex.org/W3184499045","https://openalex.org/W4243213620","https://openalex.org/W1604894272","https://openalex.org/W2155852086"],"abstract_inverted_index":{"A":[0,18,31],"model":[1,115],"of":[2,13,41,49,60,89,96,146,152,155,170],"a":[3,23,28,38,90,93,144,153,160],"hypertorus":[4,91],"communication":[5,52],"grid":[6,19,99],"has":[7],"been":[8,175],"constructed":[9],"in":[10,77,159],"the":[11,71,78,103,106,131,150,156,167,171,179],"form":[12],"an":[14,42,50,56],"infinite":[15,43,57,172,180],"Petri":[16,44,83,181],"net.":[17,45],"cell":[20],"represents":[21],"either":[22],"packet":[24],"switching":[25],"device":[26],"or":[27],"bioplast":[29],"cell.":[30],"parametric":[32,161],"expression":[33],"is":[34,65,164,183],"obtained":[35,142],"to":[36,129],"allow":[37],"finite":[39],"specification":[40],"To":[46],"prove":[47],"properties":[48],"ideal":[51],"protocol,":[53],"we":[54,69],"derive":[55],"Diophantine":[58,157],"system":[59,158,173],"equations":[61],"from":[62],"it,":[63],"which":[64,81,113],"subsequently":[66],"solved.":[67],"Then":[68],"present":[70],"programs":[72],"htgen":[73],"and":[74,85,98,111,122,124,177,185,191],"ht-mcrl2-gen,":[75],"developed":[76],"C":[79],"language,":[80],"generate":[82],"net":[84,182],"process":[86],"algebra":[87],"models":[88],"with":[92],"given":[94],"number":[95],"dimensions":[97],"size.":[100],"These":[101],"are":[102,134,195],"inputs":[104],"for":[105,143],"respective":[107],"modeling":[108],"tools":[109],"Tina":[110],"mCRL2,":[112],"provide":[114],"visualization,":[116],"step":[117],"simulation,":[118],"state":[119],"space":[120],"generation":[121],"reduction,":[123],"structural":[125],"analysis":[126],"techniques.":[127],"Benchmarks":[128],"compare":[130],"two":[132],"approaches":[133],"obtained.":[135],"An":[136],"ad-hoc":[137],"induction-like":[138],"technique":[139],"on":[140],"invariants,":[141],"series":[145],"generated":[147],"models,":[148],"allows":[149],"calculation":[151],"solution":[154],"form.":[162],"It":[163],"proven":[165],"that":[166,178],"basic":[168],"solutions":[169],"have":[174],"found":[176],"bounded":[184],"conservative.":[186],"Some":[187],"remarks":[188],"regarding":[189],"liveness":[190,192],"enforcing":[193],"techniques":[194],"also":[196],"presented.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}