Probabilistic propositional temporal logics

DOI10.1016/S0019-9958(86)80001-8MaRDI QIDQ4722046zbMATH OpenFDO

Authors Sergiu Hart, Micha Sharir

Publication date 1986

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

Full work available at URL https://doi.org/10.1016/S0019-9958(86)80001-8

zbMATH Keywords

Markov chaincompletenessdecidabilitysatisfiabilityprobabilistic programsconcurrent programssequential programspropositional probabilistic temporal logics

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Probability and inductive logic (03B48) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Recommendations

• A logic for reasoning about time and reliability
• scientific article; zbMATH DE number 3869302
• Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
• A decidable probability logic for timed probabilistic systems
• scientific article; zbMATH DE number 1330140

Cited in

(36)

• Some simulation results as to weakly correlated processes
• Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
• scientific article; zbMATH DE number 4029518 (Why is no real title available?)
• SLAP: specification logic of actions with probability
• scientific article; zbMATH DE number 7319046 (Why is no real title available?)
• Metrics for labelled Markov processes
• Context-Aware Temporal Logic for Probabilistic Systems
• A temporal logic for proving properties of topologically general executions
• Almost-certain eventualities and abstract probabilities in the temporal logic PTL
• Approximating labelled Markov processes
• The satisfiability problem for unbounded fragments of probabilistic CTL
• A logic for reasoning about time and reliability
• A probabilistic logic for pTiMo
• Annotated probabilistic temporal logic
• Super-Solutions
• Decidability and complexity for \(\omega \)-regular properties of stochastic systems
• On the satisfiability of some simple probabilistic logics
• Theoretical Aspects of Computing – ICTAC 2005
• Making prophecies with decision predicates
• Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
• Probabilistic concurrent constraint programming
• Obligation Blackwell games and p-automata
• A propositional dense time logic
• PDT logic: a probabilistic doxastic temporal logic for reasoning about beliefs in multi-agent systems
• A probabilistic temporal epistemic logic: decidability
• Temporalization of Probabilistic Propositional Logic
• A decidable probability logic for timed probabilistic systems
• scientific article; zbMATH DE number 3869302 (Why is no real title available?)
• Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
• A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems
• On frequency LTL in probabilistic systems
• Satisfiability of quantitative probabilistic CTL: rise to the challenge
• Annotated probabilistic temporal logic: approximate fixpoint implementation
• Quantitative model checking of linear-time properties based on generalized possibility measures
• scientific article; zbMATH DE number 2129913 (Why is no real title available?)
• Computation tree logic model checking based on possibility measures

This page was built for publication: Probabilistic propositional temporal logics

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