{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:22:52Z","timestamp":1777645372962,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-3","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p>We present Petri nets with time windows (tw-PN) where each place is\n\t\t\t associated with an interval (window). Every token which arrives at a place gets\n\t\t\t a real-valued clock which shows its \"age\". A\n\t\t\t transition can fire when all needed tokens are \"old\n\t\t\t enough\". When a token reaches an \"age\"\n\t\t\t equal to the upper bound of the place where it is situated, the\n\t\t\t \"token's age\", i.e., clock will be reset\n\t\t\t to zero. Following this we compare these time dependent Petri nets with their\n\t\t\t (timeless) skeletons. The sets of both their reachable markings are equal,\n\t\t\t their liveness behaviour is different, and neither is equivalent to Turing\n\t\t\t machines. We also prove the existence of runs where time gaps are possible in\n\t\t\t the tw-PN, which is an extraordinary feature.<\/jats:p>","DOI":"10.3233\/fi-2009-0106","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:45:35Z","timestamp":1575326735000},"page":"337-352","source":"Crossref","is-referenced-by-count":0,"title":["Petri Nets with Time Windows: A Comparison to Classical Petri\t\t\t Nets"],"prefix":"10.1177","volume":"93","author":[{"given":"Jan-Thierry","family":"Wegener","sequence":"first","affiliation":[{"name":"Department of Mathematics, Humbold University, Berlin,\r\t\t\t Germany. wegener@math.hu-berlin.de"}]},{"given":"Louchka","family":"Popova-Zeugmann","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Humboldt University,\r\t\t\t Berlin, Germany. popova@informatik.hu-berlin.de"}]}],"member":"179","published-online":{"date-parts":[[2009,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0106","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:04Z","timestamp":1777444324000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-0106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.3233\/FI-2009-0106"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-0106","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}