{"id":"https://openalex.org/W2143679847","doi":"https://doi.org/10.2168/lmcs-3(1:1)2007","title":"Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness","display_name":"Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness","publication_year":2007,"publication_date":"2007-02-07","ids":{"openalex":"https://openalex.org/W2143679847","doi":"https://doi.org/10.2168/lmcs-3(1:1)2007","mag":"2143679847"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-3(1:1)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(1:1)2007","pdf_url":"https://lmcs.episciences.org/2223/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2223/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Parosh Abdulla","raw_affiliation_strings":["Uppsala University, Department of Information Technology, Box 337, SE-751 05 Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Department of Information Technology, Box 337, SE-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002581878","display_name":"Pritha Mahata","orcid":null},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Pritha Mahata","raw_affiliation_strings":["University of Newcastle, School of Electrical Engineering and Computer Science, University Drive, Callaghan NSW 2308, Australia"],"affiliations":[{"raw_affiliation_string":"University of Newcastle, School of Electrical Engineering and Computer Science, University Drive, Callaghan NSW 2308, Australia","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Mayr","raw_affiliation_strings":["North Carolina State University, Department of Computer Science, Campus Box 8206, Raleigh, NC 27695, USA","School of Informatics, Laboratory for Foundations of Computer Science"],"affiliations":[{"raw_affiliation_string":"North Carolina State University, Department of Computer Science, Campus Box 8206, Raleigh, NC 27695, USA","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"School of Informatics, Laboratory for Foundations of Computer Science","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002478680"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":null,"apc_paid":null,"fwci":2.6203,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":{"value":0.89885611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"Volume 3, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T11125","display_name":"Petri Nets in System Modeling","score":0.9994999766349792,"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.9925000071525574,"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/decidability","display_name":"Decidability","score":0.9019680023193359},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8098123669624329},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.7962338328361511},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7798303365707397},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.7444596886634827},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.60532546043396},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5454497933387756},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.508723795413971},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5040656328201294},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4313780963420868},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4271843433380127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36279040575027466},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3378816843032837},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30385828018188477},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25562846660614014}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9019680023193359},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8098123669624329},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.7962338328361511},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7798303365707397},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.7444596886634827},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.60532546043396},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5454497933387756},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.508723795413971},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5040656328201294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4313780963420868},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4271843433380127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36279040575027466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3378816843032837},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30385828018188477},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25562846660614014},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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":6,"locations":[{"id":"doi:10.2168/lmcs-3(1:1)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(1:1)2007","pdf_url":"https://lmcs.episciences.org/2223/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/a79befcd-cf27-4af2-b463-b7cc7474fc89","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/a79befcd-cf27-4af2-b463-b7cc7474fc89","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"Abdulla, P A, Mahata, P & Mayr, R 2007, 'Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness', Logical Methods in Computer Science, vol. 3, no. 1. https://doi.org/10.2168/LMCS-3(1:1)2007","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:cs/0611048","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0611048","pdf_url":"https://arxiv.org/pdf/cs/0611048","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.758","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0611048v1.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:f5cb5ee2e93848da9510cf52f51c6112","is_oa":true,"landing_page_url":"https://doaj.org/article/f5cb5ee2e93848da9510cf52f51c6112","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 3, Issue 1 (2007)","raw_type":"article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/a79befcd-cf27-4af2-b463-b7cc7474fc89","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/densetimed-petri-nets-checking-zenoness-token-liveness-and-boundedness(a79befcd-cf27-4af2-b463-b7cc7474fc89).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"","raw_type":""}],"best_oa_location":{"id":"doi:10.2168/lmcs-3(1:1)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(1:1)2007","pdf_url":"https://lmcs.episciences.org/2223/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2143679847.pdf","grobid_xml":"https://content.openalex.org/works/W2143679847.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W117556101","https://openalex.org/W299519334","https://openalex.org/W619223895","https://openalex.org/W1487936617","https://openalex.org/W1504874300","https://openalex.org/W1509829312","https://openalex.org/W1529681579","https://openalex.org/W1543145547","https://openalex.org/W1561267729","https://openalex.org/W1577477354","https://openalex.org/W1582650717","https://openalex.org/W1590992459","https://openalex.org/W1595979400","https://openalex.org/W1605243065","https://openalex.org/W1763122816","https://openalex.org/W1964874178","https://openalex.org/W1967174286","https://openalex.org/W2003796615","https://openalex.org/W2021255060","https://openalex.org/W2062995800","https://openalex.org/W2076508310","https://openalex.org/W2101508170","https://openalex.org/W2106001218","https://openalex.org/W2148224873","https://openalex.org/W2151720555","https://openalex.org/W2157390113","https://openalex.org/W2160527279","https://openalex.org/W2169601056","https://openalex.org/W2316437449","https://openalex.org/W4231228921","https://openalex.org/W4298236051","https://openalex.org/W6651230024"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2124283471","https://openalex.org/W2004753716","https://openalex.org/W2330065971","https://openalex.org/W2066603162","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2031305780","https://openalex.org/W2107690674","https://openalex.org/W2120541137"],"abstract_inverted_index":{"We":[0,39,70,149,178,208],"consider":[1,40,179],"Dense-Timed":[2],"Petri":[3,9],"Nets":[4],"(TPN),":[5],"an":[6,59,79,223],"extension":[7,224],"of":[8,68,73,152,172,182,211,225],"nets":[10],"in":[11,132,196],"which":[12,62,144,162],"each":[13],"token":[14,129],"is":[15,25,100,122,130,138,163,176,220],"equipped":[16],"with":[17],"a":[18,52,55,65,97,117,128,133,139],"real-valued":[19],"clock":[20],"and":[21,36,199],"where":[22,188,202],"the":[23,41,87,104,110,142,147,153,159,170,173,183,197,226],"semantics":[24],"lazy":[26],"(i.e.,":[27],"enabled":[28],"transitions":[29],"need":[30],"not":[31],"fire;":[32],"time":[33],"can":[34],"pass":[35],"disable":[37],"transitions).":[38],"following":[42],"verification":[43],"problems":[44],"for":[45,75,165],"TPNs.":[46,166],"(i)":[47],"Zenoness:":[48],"whether":[49,127,136,169],"there":[50,91,137],"exists":[51],"zeno-computation":[53],"from":[54,82,96,116,141],"given":[56,98,118],"marking,":[57,134],"i.e.,":[58,109,135],"infinite":[60,114],"computation":[61,140],"takes":[63],"only":[64,189],"finite":[66],"amount":[67],"time.":[69],"show":[71,150,209],"decidability":[72,151],"zenoness":[74],"TPNs,":[76],"thus":[77],"solving":[78],"open":[80],"problem":[81,154],"[Escrig":[83],"et":[84],"al.].":[85],"Furthermore,":[86],"related":[88],"question":[89,111],"if":[90,112],"exist":[92],"arbitrarily":[93],"fast":[94],"computations":[95,115],"marking":[99,119,143],"also":[101,203],"decidable.":[102],"On":[103],"other":[105],"hand,":[106],"universal":[107],"zenoness,":[108],"all":[113],"are":[120,192,206],"zeno,":[121],"undecidable.":[123],"(ii)":[124],"Token":[125],"liveness:":[126],"alive":[131],"eventually":[145],"consumes":[146],"token.":[148],"by":[155],"reducing":[156],"it":[157],"to":[158],"coverability":[160],"problem,":[161],"decidable":[164,221],"(iii)":[167],"Boundedness:":[168],"size":[171],"reachable":[174],"markings":[175],"bounded.":[177],"two":[180],"versions":[181],"problem;":[184],"namely":[185],"semantic":[186,212],"boundedness":[187,201,219],"live":[190],"tokens":[191,205],"taken":[193],"into":[194],"consideration":[195],"markings,":[198],"syntactic":[200,218],"dead":[204],"considered.":[207],"undecidability":[210],"boundedness,":[213],"while":[214],"we":[215],"prove":[216],"that":[217],"through":[222],"Karp-Miller":[227],"algorithm.":[228]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2020-11-23T00:00:00"}