A logical duality for underspecified probabilistic systems (Q532396): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2010.12.005 / rank
Normal rank
 
Property / review text
 
A simple structure, infLMP (essentially partial specification of labeled Markov processes), that encodes non-determinism and probabilistic behaviour (its transitions satisfy super-additivity instead of additivity) is introduced. A Stone-type duality between specifications and imfLMP is established. The duality puts in relation the category of infLMPs and a category of abstract representations of them based on properties only. A Galois connection between these categories is exhibited. The duality also shows that an imfLMP can be considered as a demonic representative of a system's information. Moreover, it carries forward a view where states are less important, and events, or properties, become the main characters, as it should be in probability theory. It is shown that bisimulation and simulation are naturally interpreted in this setting, and the interesting relationship between infLMPs and the usual probabilistic modal logics is exhibited.
Property / review text: A simple structure, infLMP (essentially partial specification of labeled Markov processes), that encodes non-determinism and probabilistic behaviour (its transitions satisfy super-additivity instead of additivity) is introduced. A Stone-type duality between specifications and imfLMP is established. The duality puts in relation the category of infLMPs and a category of abstract representations of them based on properties only. A Galois connection between these categories is exhibited. The duality also shows that an imfLMP can be considered as a demonic representative of a system's information. Moreover, it carries forward a view where states are less important, and events, or properties, become the main characters, as it should be in probability theory. It is shown that bisimulation and simulation are naturally interpreted in this setting, and the interesting relationship between infLMPs and the usual probabilistic modal logics is exhibited. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Damas Gruska / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q87 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5883960 / rank
 
Normal rank
Property / zbMATH Keywords
 
probabilistic processes
Property / zbMATH Keywords: probabilistic processes / rank
 
Normal rank
Property / zbMATH Keywords
 
duality
Property / zbMATH Keywords: duality / rank
 
Normal rank
Property / zbMATH Keywords
 
modal logic
Property / zbMATH Keywords: modal logic / rank
 
Normal rank
Property / zbMATH Keywords
 
underspecified processes
Property / zbMATH Keywords: underspecified processes / rank
 
Normal rank
Property / zbMATH Keywords
 
bisimulation
Property / zbMATH Keywords: bisimulation / rank
 
Normal rank
Property / zbMATH Keywords
 
Galois connection
Property / zbMATH Keywords: Galois connection / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2010.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087666725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation for labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation and cocongruence for probabilistic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic PDL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Markov Processes by Averaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme lower probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-additive measures by interval probability functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Risk, Ambiguity, and the Savage Axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Demonic Approach to Information in Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation for probabilistic transition systems: A coalgebraic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Capacities on Continuous State Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Upper Bounds for Probability Measures and Their Applications to Abstractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain equations for probabilistic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Characterizations of Bisimulations for Discrete Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585437 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2010.12.005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:42, 9 December 2024

scientific article
Language Label Description Also known as
English
A logical duality for underspecified probabilistic systems
scientific article

    Statements

    A logical duality for underspecified probabilistic systems (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2011
    0 references
    A simple structure, infLMP (essentially partial specification of labeled Markov processes), that encodes non-determinism and probabilistic behaviour (its transitions satisfy super-additivity instead of additivity) is introduced. A Stone-type duality between specifications and imfLMP is established. The duality puts in relation the category of infLMPs and a category of abstract representations of them based on properties only. A Galois connection between these categories is exhibited. The duality also shows that an imfLMP can be considered as a demonic representative of a system's information. Moreover, it carries forward a view where states are less important, and events, or properties, become the main characters, as it should be in probability theory. It is shown that bisimulation and simulation are naturally interpreted in this setting, and the interesting relationship between infLMPs and the usual probabilistic modal logics is exhibited.
    0 references
    0 references
    probabilistic processes
    0 references
    duality
    0 references
    modal logic
    0 references
    underspecified processes
    0 references
    bisimulation
    0 references
    Galois connection
    0 references

    Identifiers