Decidability of a partial order based temporal logic

DOI10.1007/3-540-56939-1_104MaRDI QIDQ4630294zbMATH OpenOpenAlexFDO

Authors Kamal Lodaya, P. S. Thiagarajan, Ramaswamy Ramanujam

Publication date 29 March 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56939-1_104

zbMATH Keywords

decision procedureevent occurrencemodal logicpartial ordertemporal logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44)

Cites work

• A Perspective in Theoretical Computer Science
• Automata-theoretic techniques for modal logics of programs
• Decidability for branching time
• Decidability of Second-Order Theories and Automata on Infinite Trees
• scientific article; zbMATH DE number 4108727 (Why is no real title available?)
• scientific article; zbMATH DE number 1032009 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• scientific article; zbMATH DE number 4119603 (Why is no real title available?)
• Models and logics for true concurrency.
• TEMPORAL LOGICS FOR COMMUNICATING SEQUENTIAL AGENTS: I
• Ten Years of Hoare's Logic: A Survey—Part I
• Time, clocks, and the ordering of events in a distributed system

Cited in

(1)

• Reasoning about layered message passing systems

Describes a project that uses

Uses Software

• UNITY

This page was built for publication: Decidability of a partial order based temporal logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630294)