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

completenessconcurrent programsdecidabilityMarkov chainprobabilistic programspropositional probabilistic temporal logicssatisfiabilitysequential programs

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Probability and inductive logic (03B48) Logic in computer science (03B70) General topics in the theory of software (68N01) 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

(39)

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

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)