{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:41:21Z","timestamp":1775054481743,"version":"3.50.1"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T00:00:00Z","timestamp":1482537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2016,12,24]]},"abstract":"<jats:p> The intention of the paper is towards a framework for developing, studying and comparing observational equivalences in the setting of a real-time true concurrent model. In particular, we introduce a family of trace and bisimulation equivalences in interleaving, step, partial order and causal net semantics in the setting of time Petri nets (elementary net systems whose transitions are labeled with time firing intervals, can fire only if their lower time bounds are attained, and are forced to fire when their upper time bounds are reached) [3]. We deal with the relationships between the equivalences showing the discriminating power of the approaches of the linear-time \u2013 branching-time and interleaving \u2013 partial order spectra and construct a hierarchy of equivalent classes of time Petri nets. This allows studying in complete detail the timing behaviour in addition to the degrees of relative concurrency and nondeterminism of processes. <\/jats:p>","DOI":"10.3233\/fi-2016-1454","type":"journal-article","created":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T16:00:19Z","timestamp":1482854419000},"page":"401-418","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["True Concurrent Equivalences in Time Petri Nets"],"prefix":"10.1177","volume":"149","author":[{"given":"Irina","family":"Virbitskaite","sequence":"first","affiliation":[{"name":"A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia; Novosibirsk State University, 2, Pirogova st., Novosibirsk, 630090, Russia."}]},{"given":"Dmitry","family":"Bushin","sequence":"additional","affiliation":[{"name":"A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia"}]},{"given":"Eike","family":"Best","sequence":"additional","affiliation":[{"name":"Carl von Ossietzky University of Oldenburg, Ammerlaender Heerstrasse 114-118, 26129 Oldenburg, Germany"}]}],"member":"179","published-online":{"date-parts":[[2016,12,24]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2016-1454","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2016-1454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:50:07Z","timestamp":1751367007000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2016-1454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,24]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12,24]]}},"alternative-id":["10.3233\/FI-2016-1454"],"URL":"https:\/\/doi.org\/10.3233\/fi-2016-1454","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,24]]}}}