Reasoning with time and chance

DOI10.1016/S0019-9958(82)91022-1MaRDI QIDQ3674620zbMATH OpenFDO

Authors S. Shelah, Daniel Lehmann

Publication date 1982

Published in Information and Control (Search for Journal in Brave)

zbMATH Keywords

modal logictemporal logicprobabilistic parallel programs

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cited in

(24)

• Automated temporal reasoning about reactive systems
• Probabilistic temporal logic with countably additive semantics
• Towards logical foundations for probabilistic computation
• To be fair, use bundles
• A logic for reasoning about time and reliability
• A probabilistic PDL
• The satisfiability problem for a quantitative fragment of PCTL
• Using probabilistic Kleene algebra pKA for protocol verification
• Interleaving set temporal logic
• A propositional linear time logic with time flow isomorphic to ^2
• Probabilistic logics based on Riesz spaces
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• On counting propositional logic and Wagner's hierarchy
• A logic for reasoning about probabilities
• A logic of time, chance, and action for representing plans
• Branching versus linear logics yet again
• Alternating nonzero automata
• Curry and Howard meet Borel
• Verification of multiprocess probabilistic protocols
• A probabilistic approach to navigation in Hypertext
• The satisfiability problem for a quantitative fragment of PCTL
• Satisfiability of quantitative probabilistic CTL: rise to the challenge
• Probabilistic Temporal Logics
• Knowledge, belief and time

This page was built for publication: Reasoning with time and chance

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