{"id":"https://openalex.org/W4236041865","doi":"https://doi.org/10.1109/lics.1997.614946","title":"An expressively complete linear time temporal logic for Mazurkiewicz traces","display_name":"An expressively complete linear time temporal logic for Mazurkiewicz traces","alternate_titles":[],"publication_year":2002,"publication_date":"2002-11-22","ids":{"openalex":"https://openalex.org/W4236041865","doi":"https://doi.org/10.1109/lics.1997.614946"},"language":"en","primary_location":{"id":"doi:10.1109/lics.1997.614946","doi":"https://doi.org/10.1109/lics.1997.614946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.1997.614946","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W4236041865"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111462984","display_name":"P. S. Thiagarajan","orcid":"https://orcid.org/0009-0007-6469-9243","observed_orcids":["https://orcid.org/0009-0007-6469-9243"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"P.S. Thiagarajan","raw_affiliation_strings":["Math. Inst., SPIC, Madras, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Math. Inst., SPIC, Madras, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064757019","display_name":"Igor Walukiewicz","orcid":"https://orcid.org/0000-0001-8952-7201","observed_orcids":["https://orcid.org/0000-0001-8952-7201"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"I. Walukiewicz","raw_affiliation_strings":["Institute of Informatics, University of Warmia and Mazury, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warmia and Mazury, Warsaw, Poland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1789,"has_fulltext":false,"cited_by_count":35,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.92769104,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":null,"issue":null,"first_page":"183","last_page":"194"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9086999893188477,"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.9086999893188477,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.056699998676776886,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11567","display_name":"semigroups and automata theory","score":0.01549999974668026,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"linear temporal logic","score":0.7860000133514404},{"id":"https://openalex.org/keywords/mazurkiewicz-traces","display_name":"Mazurkiewicz traces","score":0.9900000095367432},{"id":"https://openalex.org/keywords/expressive-completeness","display_name":"expressive completeness","score":0.8460000157356262},{"id":"https://openalex.org/keywords/partial-order-reduction","display_name":"partial order reduction","score":0.6919999718666077},{"id":"https://openalex.org/keywords/concurrency-theory","display_name":"concurrency theory","score":0.7639999985694885},{"id":"https://openalex.org/keywords/infinite-traces","display_name":"infinite traces","score":0.7860000133514404}],"concepts":[{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.7580486536026001},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7338674068450928},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6961778402328491},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.64809250831604},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.6289125680923462},{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.6031240224838257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6028719544410706},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4807972013950348},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.4562564492225647},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.44169652462005615},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43959861993789673},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.4371694028377533},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.43239033222198486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38544130325317383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3677557706832886},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.24897456169128418},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21415069699287415},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11897611618041992},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.1997.614946","doi":"https://doi.org/10.1109/lics.1997.614946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.1997.614946","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1482193060","https://openalex.org/W1497903619","https://openalex.org/W1499083828","https://openalex.org/W1511526676","https://openalex.org/W1591531250","https://openalex.org/W1767070588","https://openalex.org/W1934074768","https://openalex.org/W2023808162","https://openalex.org/W2093709900","https://openalex.org/W2098171268","https://openalex.org/W2132750992","https://openalex.org/W2137307988","https://openalex.org/W2157319504","https://openalex.org/W2159599065","https://openalex.org/W2180648729","https://openalex.org/W2503706302","https://openalex.org/W4232688024","https://openalex.org/W4388294872"],"related_works":["https://openalex.org/W1571373880","https://openalex.org/W1866352889","https://openalex.org/W7095996766","https://openalex.org/W1852350797","https://openalex.org/W2147311182","https://openalex.org/W4250416576","https://openalex.org/W1491661119","https://openalex.org/W2165282416","https://openalex.org/W2185620547"],"abstract_inverted_index":{"A":[0],"basic":[1],"result":[2,39,113],"concerning":[3],"LTL,":[4],"the":[5,25,41,65,71,99,119,133,155],"propositional":[6],"temporal":[7,91],"logic":[8],"of":[9,29,37,43,57,70,103,123,132,154],"linear":[10,89],"time":[11,90],"is":[12,15,19,93],"that":[13,76,86,147],"it":[14,18],"expressively":[16],"complete;":[17],"equal":[20,94],"in":[21,54,59,80,95,118],"expressive":[22,96],"power":[23,97],"to":[24,40,98,162],"first":[26,100],"order":[27,73,101,164],"theory":[28,61,102,122],"sequences.":[30],"We":[31,84],"present":[32],"here":[33],"a":[34,55,115,129],"smooth":[35],"extension":[36],"this":[38],"class":[42],"partial":[44,51,72,163],"orders":[45,52],"known":[46],"as":[47,144],"Mazurkiewicz":[48],"traces.":[49,111,125],"These":[50,140],"arise":[53],"variety":[56],"contexts":[58],"concurrency":[60],"and":[62,158],"they":[63],"provide":[64],"conceptual":[66],"basis":[67],"for":[68],"many":[69],"reduction":[74,165],"methods":[75],"have":[77],"been":[78],"developed":[79],"connection":[81],"with":[82],"LTL-specifications.":[83,139],"show":[85],"LTrL,":[87],"our":[88],"logic,":[92],"traces":[104],"when":[105],"interpreted":[106],"over":[107],"(finite":[108],"and)":[109],"infinite":[110,124],"This":[112],"fills":[114],"prominent":[116],"gap":[117],"existing":[120],"logical":[121],"LTrL":[126],"also":[127],"provides":[128],"syntactic":[130],"characterisation":[131],"so":[134],"called":[135],"trace":[136,157],"consistent":[137],"(robust)":[138],"are":[141,160],"specifications":[142],"expressed":[143],"LTL":[145],"formulas":[146],"do":[148],"not":[149],"distinguish":[150],"between":[151],"different":[152],"linearisations":[153],"same":[156],"hence":[159],"amenable":[161],"methods.":[166]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4236041865","counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2022-05-12T00:00:00"}
