{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:50Z","timestamp":1751429450792,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998,10]]},"abstract":"<jats:p> Modeling execution as partial orders increases the flexibility in reasoning about concurrent programs by allowing the use of alternative, equivalent execution sequences. This is a desirable feature in specifying concurrent systems which allows formalizing frequently used arguments such as \u2018in an equivalent execution sequence\u2019, or \u2018in a consistent global state, not necessarily on the execution sequence\u2019 to be formalized. However, due to the addition of structure to the model, verification of partial order properties is non-trivial and sparse. We present here a new approach which allows expressing and verifying partial order properties. It is based on modeling an execution as a linear sequence of global states, where each state is equipped with its past partial-order history. The temporal logic BPLTL (for Branching Past Linear Temporal Logic) is introduced. We provide a sound and relatively complete proof system for the logic BPLTL over transitions programs. Our proof system augments an existing proof system for LTL. <\/jats:p>","DOI":"10.3233\/fi-1998-3611","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T02:36:36Z","timestamp":1575340596000},"page":"1-21","source":"Crossref","is-referenced-by-count":3,"title":["Adding Partial Orders to Linear Temporal Logic"],"prefix":"10.1177","volume":"36","author":[{"given":"Girish","family":"Bhat","sequence":"first","affiliation":[{"name":"Make Systems, 4000 Regency Parkway, Cary, NC 27511-8502. email: girish@makesys.com"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[{"name":"Bell Laboratories, 700 Mountain Ave., Murray Hill, NJ, 07974, USA. email: doron@research.bell-labs.com"}]}],"member":"179","published-online":{"date-parts":[[1998,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-1998-3611","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-1998-3611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:50:47Z","timestamp":1751367047000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-1998-3611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["10.3233\/FI-1998-3611"],"URL":"https:\/\/doi.org\/10.3233\/fi-1998-3611","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[1998,1,1]]}}}