{"id":"https://openalex.org/W2110309174","doi":"https://doi.org/10.2168/lmcs-9(4:10)2013","title":"Priced Timed Petri Nets","display_name":"Priced Timed Petri Nets","publication_year":2013,"publication_date":"2013-11-12","ids":{"openalex":"https://openalex.org/W2110309174","doi":"https://doi.org/10.2168/lmcs-9(4:10)2013","mag":"2110309174"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-9(4:10)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(4:10)2013","pdf_url":"https://lmcs.episciences.org/874/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/874/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Richard M. Mayr","raw_affiliation_strings":["University of Edinburgh, School of Informatics, 10 Crichton Street, Edinburgh EH89AB, UK","University of Edinburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh, School of Informatics, 10 Crichton Street, Edinburgh EH89AB, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","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":false,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["Uppsala University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Uppsala University ,","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3645,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.66772245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"Volume 9, Issue 4","issue":null,"first_page":null,"last_page":null},"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.9998000264167786,"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.9998000264167786,"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.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/T10772","display_name":"Distributed systems and fault tolerance","score":0.996399998664856,"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.8753626346588135},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.7568744421005249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6828922629356384},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6445629596710205},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.6200039386749268},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5681284666061401},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5202363729476929},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5147097706794739},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.46839118003845215},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41055572032928467},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2996675372123718},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29054802656173706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23244842886924744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2208418846130371},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.18711018562316895},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11806216835975647}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8753626346588135},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.7568744421005249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6828922629356384},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6445629596710205},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.6200039386749268},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5681284666061401},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5202363729476929},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5147097706794739},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.46839118003845215},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41055572032928467},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2996675372123718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29054802656173706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23244842886924744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2208418846130371},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.18711018562316895},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11806216835975647},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.2168/lmcs-9(4:10)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(4:10)2013","pdf_url":"https://lmcs.episciences.org/874/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/397c6c68-bd09-4d80-837f-1874b0fbd9ed","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/397c6c68-bd09-4d80-837f-1874b0fbd9ed","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 & Mayr, R 2013, 'Priced Timed Petri Nets', Logical Methods in Computer Science, vol. 9, no. 4. https://doi.org/10.2168/LMCS-9(4:10)2013","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1307.2570","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1307.2570","pdf_url":"https://arxiv.org/pdf/1307.2570","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:doaj.org/article:793cebdf226b4efbbf235e27f253f7b9","is_oa":true,"landing_page_url":"https://doaj.org/article/793cebdf226b4efbbf235e27f253f7b9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"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 9, Issue 4 (2013)","raw_type":"article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/397c6c68-bd09-4d80-837f-1874b0fbd9ed","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/priced-timed-petri-nets(397c6c68-bd09-4d80-837f-1874b0fbd9ed).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-9(4:10)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(4:10)2013","pdf_url":"https://lmcs.episciences.org/874/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/W2110309174.pdf","grobid_xml":"https://content.openalex.org/works/W2110309174.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W62188582","https://openalex.org/W1540737511","https://openalex.org/W1543145547","https://openalex.org/W1561267729","https://openalex.org/W1569998753","https://openalex.org/W1573865009","https://openalex.org/W1577477354","https://openalex.org/W1605243065","https://openalex.org/W1659060819","https://openalex.org/W1763122816","https://openalex.org/W1842622063","https://openalex.org/W1967174286","https://openalex.org/W1968143987","https://openalex.org/W1985536269","https://openalex.org/W1985925577","https://openalex.org/W2012140001","https://openalex.org/W2052306562","https://openalex.org/W2056957549","https://openalex.org/W2062995800","https://openalex.org/W2065323166","https://openalex.org/W2076508310","https://openalex.org/W2080316200","https://openalex.org/W2090401819","https://openalex.org/W2097118908","https://openalex.org/W2101508170","https://openalex.org/W2117101148","https://openalex.org/W2123160677","https://openalex.org/W2130664212","https://openalex.org/W2143679847","https://openalex.org/W2151720555","https://openalex.org/W2164003033","https://openalex.org/W2169601056","https://openalex.org/W2316437449","https://openalex.org/W2595833503","https://openalex.org/W2950354888","https://openalex.org/W4245606633","https://openalex.org/W4247648311"],"related_works":["https://openalex.org/W2120230527","https://openalex.org/W1536365843","https://openalex.org/W2125797022","https://openalex.org/W1802268423","https://openalex.org/W1993963635","https://openalex.org/W4252689011","https://openalex.org/W2084570980","https://openalex.org/W2126080849","https://openalex.org/W2136992253","https://openalex.org/W1971232640"],"abstract_inverted_index":{"We":[0,64],"consider":[1],"priced":[2,56,61],"timed":[3,57],"Petri":[4,8,62],"nets,":[5],"i.e.,":[6],"unbounded":[7,60],"nets":[9],"where":[10,112],"each":[11],"token":[12,37],"carries":[13],"a":[14,72,77,104,133],"real-valued":[15],"clock.":[16],"Transition":[17],"arcs":[18],"are":[19,118,127],"labeled":[20],"with":[21,79,138],"time":[22,41,91,157],"intervals,":[23],"which":[24],"specify":[25],"constraints":[26],"on":[27],"the":[28,66,90,97,100,110,121,130,152],"ages":[29],"of":[30,68,99,155],"tokens.":[31],"Furthermore,":[32],"our":[33],"cost":[34,67,81,141],"model":[35,52],"assigns":[36],"storage":[38],"costs":[39,47,101,117,126],"per":[40],"unit":[42],"to":[43,48,86,102],"places,":[44],"and":[45,59,115],"firing":[46],"transitions.":[49],"This":[50],"general":[51],"strictly":[53],"subsumes":[54],"both":[55],"automata":[58],"nets.":[63],"study":[65],"computations":[69],"that":[70,96],"reach":[71,103],"given":[73,105,134],"control-state.":[74],"In":[75,144],"general,":[76],"computation":[78],"minimal":[80],"may":[82],"not":[83],"exist,":[84],"due":[85],"strict":[87],"inequalities":[88],"in":[89,109,151],"constraints.":[92],"However,":[93],"we":[94],"show":[95],"infimum":[98],"control-state":[106,135],"is":[107,136],"computable":[108],"case":[111,154],"all":[113],"place":[114],"transition":[116],"non-negative.":[119],"On":[120],"other":[122],"hand,":[123],"if":[124],"negative":[125,147],"allowed,":[128],"then":[129],"question":[131],"whether":[132],"reachable":[137],"zero":[139],"overall":[140],"becomes":[142],"undecidable.":[143],"fact,":[145],"this":[146],"result":[148],"holds":[149],"even":[150],"simpler":[153],"discrete":[156],"(i.e.,":[158],"integer-valued":[159],"clocks).":[160]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}