Probabilistic temporal reasoning using superposition semantics

DOI10.1145/3714427MaRDI QIDQ6975826zbMATH OpenFDO

Authors F. Maggi, Marco Montali, Rafael Peñaloza

Publication date 4 June 2025

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

temporal logicprobabilistic reasoningprocess modelling

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A logic for reasoning about time and reliability
• An analysis of first-order logics of probability
• Automata can show PSpace results for description logics
• Automata-based axiom pinpointing
• Automata-theoretic techniques for modal logics of programs
• Automated Deduction – CADE-19
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
• Enabling flexibility in process-aware information systems. Challenges, methods, technologies
• Handbook of weighted automata
• Haskell overloading is DEXPTIME-complete
• Markov Chains and Stochastic Stability
• Polynomial algorithms in linear programming
• Probabilistic Temporal Logics
• Probabilistic logic
• Reasoning about infinite computations
• Relationships between nondeterministic and deterministic tape complexities
• Specification and verification of declarative open interaction models. A logic-based approach
• The complexity of propositional linear temporal logics
• The finite satisfiability problem for PCTL is undecidable

This page was built for publication: Probabilistic temporal reasoning using superposition semantics

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