36 Hits in 5.7 sec

Topological Cones: Foundations for a Domain Theoretical Semantics Combining Probability and Nondeterminism

Klaus Keimel
2006 Electronical Notes in Theoretical Computer Science  
Tix [18], domain theoretical tools for combining probability with nondeterminism were developed in [19] .  ...  In dealing with domain theoretical versions of probabilities and spaces of probabilities (and, more generally, spaces of measures), domain theoretical variants of functional analytic concepts and tools  ...  Tix [18] , domain theoretical tools for combining probability with nondeterminism were developed in [19] .  ... 
doi:10.1016/j.entcs.2005.11.066 fatcat:m73opjnzajc75jcdunbkkf7ku4

Topology, domain theory and theoretical computer science

Michael W. Mislove
1998 Topology and its Applications  
Our focus is on the applications of domain-theoretic methods in programming language semantics, and on problems of potential interest to topologists that stem from concerns that semantics generates. 0  ...  In this paper, we survey the use of order-theoretic topology in theoretical computer science, with an emphasis on applications of domain theory.  ...  Acknowledgements This paper arose from a series of lectures the author delivered at the Summer Topology Conference held in Portland, Maine in August, 1995.  ... 
doi:10.1016/s0166-8641(97)00222-8 fatcat:53vlsbi555cl7bt2rz3ly5twh4

Page 3773 of Mathematical Reviews Vol. , Issue 2003e [page]

2003 Mathematical Reviews  
(English summary) Mathematical foundations of programming semantics (Boulder, CO, 1996). Theoret. Comput. Sci. 278 (2002), no. 1-2, 141-158.  ...  (English summary) Domains (Munich, 1997). Theoret. Comput. Sci. 264 (2001), no. 2, 205-218.  ... 

Mixed powerdomains for probability and nondeterminism [article]

Klaus Keimel, Gordon D. Plotkin
2017 arXiv   pre-print
(An alternative approach to combining the two forms of nondeterminism would be to resolve probabilistic choice first, arriving at a domain-theoretic version of random sets.  ...  We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism.  ...  Acknowledgements We are very grateful to Jean Goubault-Larrecq for his many helpful comments and suggestions.  ... 
arXiv:1612.01005v6 fatcat:2tuhxgaepvgp5c2ihwbucwktse

Contents and abstracts of the electronic notes in theoretical computer science vol. 6

1998 Theoretical Computer Science  
Abbas Edalat and Peter John Potts A new representation for exact real numbers We develop the theoretical foundation of a new representation of real numbers  ...  The combination of procedures and communicating parallelism raises significant semantic problems.  ...  Failures, finiteness and full abstraction For a simple CCS-like language a trace semantics and a failure semantics are presented.  ... 
doi:10.1016/s0304-3975(98)90019-6 fatcat:cmxyrjlnjjae7gtbakg6dufkya

Healthiness from Duality

Wataru Hino, Hiroki Kobayashi, Ichiro Hasuo, Bart Jacobs
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
This R induces a predicate transformer (wp for "weakest precondition") for each f : Y → 2 (thought of as a predicate and more specifically as a postcondition) and each x ∈ X. 2.  ...  The latter notion seems interesting in its own right in the context of monads, Lawvere theories and enriched categories. Theorem 1.1 (healthiness under the "may"-nondeterminism). 1.  ...  Acknowledgments We thank Toshiki Kataoka for helpful discussions, and the anonymous referees for useful comments.  ... 
doi:10.1145/2933575.2935319 dblp:conf/lics/HinoKH016 fatcat:odnri772tnhkpfcneqj23idskq

Healthiness from Duality [article]

Wataru Hino, Hiroki Kobayashi, Ichiro Hasuo, Bart Jacobs
2016 arXiv   pre-print
Building upon our previous works on so-called state-and-effect triangles, we contribute a unified categorical framework for investigating healthiness conditions.  ...  It asks for an intrinsic characterization of those predicate transformers which arise as the (backward) interpretation of a certain class of programs.  ...  Acknowledgments We thank Toshiki Kataoka for helpful discussions, and the anonymous referees for useful comments.  ... 
arXiv:1605.00381v1 fatcat:xj45obcdujg2ph6ljwdeprqgsy

Subject index volumes 1–200

1999 Theoretical Computer Science  
topological entropy of a TMH, 3228 systems, 1272 topological equivalence, 938 field of real numbers, 3355 filling, 2766 flavor, 2 154 formulation, 2313 framework for &languages, 476 graphs, 2994  ...  a production, 202 topological conjugacy of dynamical systems, 1757 topological dynamics, 860, 3228 of Turing machines, 3228 toolc of -. 860 topological entropies, 1272 topological entropy, 3228  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

A Formal Framework for User Centric Control of Probabilistic Multi-agent Cyber-Physical Systems [chapter]

Marius C. Bujorianu, Manuela L. Bujorianu, Howard Barringer
2009 Lecture Notes in Computer Science  
We define symmetry reduction semantics and a new concept of bisimulation for agents.  ...  A foundational study is carried out for model checking SafAL formulae against Markov models. A fundamental result states that the bisimulation preserves the probabilities of the reachable state sets.  ...  We thank the anonymous reviewers for useful comments.  ... 
doi:10.1007/978-3-642-02734-5_7 fatcat:3o7daoiiu5eazkpzppd6l7ix4u

Preservation of probabilistic information flow under refinement

Thomas Santen
2008 Information and Computation  
The refinement relation considers the abstract and concrete models as views on the same stochastic process. Probabilistic CSP provides the semantic basis for this investigation.  ...  In particular, it uses information-theoretic concepts to investigate the refinement of a probabilistic, entropy-based information flow property.  ...  the cone of a finite process is Scott-open, the following relationship between the probability of refining a finite process and probabilistic choice holds.  ... 
doi:10.1016/j.ic.2007.07.008 fatcat:ingbz52rbrdizjujdm4ws7dqha

Index—Volumes 1–89

1997 Artificial Intelligence  
for inheritance 898 for knowledge representation 282 foundational issues in DA1 603 foundations for commonsense models 29 1 for DA1 604 of AI 6OO of ILP 1187 of mathematics 247 four-valued semantics  ...  boundaries 1204 of a phase portrait, automatic analysis of the -1215 topologically equivalent views 571 topology 376,470,935,954 belief network -1175 of a path 268 of boundaries 1204 of the constraint  ... 
doi:10.1016/s0004-3702(97)80122-1 fatcat:6az7xycuifaerl7kmv7l3x6rpm

Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems [article]

Miguel E. Andrés
2011 arXiv   pre-print
This thesis addresses the foundational aspects of formal methods for applications in security and in particular in anonymity.  ...  The main contribution of this thesis is cpCTL, the first temporal logic that allows for the specification and verification of conditional probabilities (which are the key ingredient of most anonymity properties  ...  There, the authors combine global nondeterminism (arising from the interleaving of the components) and local nondeterminism (arising from the internal parallelism of the components).  ... 
arXiv:1111.2760v1 fatcat:bga6xxx3knhwzmhhsbudcslm7y

Stochastic Reachability: From Markov Chains to Stochastic Hybrid Systems

Manuela L. Bujorianu
2011 IFAC Proceedings Volumes  
Stochastic reachability analysis is a key factor in the verification and deployment of stochastic hybrid systems.  ...  Using the connection between stochastic reachability and optimal stopping, the reach probabilities are estimated using only the probabilistic parameters (transition probabilities, infinitesimal generator  ...  From the theoretical viewpoint these are difficult to deal with and, they involve managing a very complex mathematical apparatus with hidden subtleties (at least for SHS).  ... 
doi:10.3182/20110828-6-it-1002.03148 fatcat:hznsoxcl6vgo7guayhcbcq54ne

Formal approaches to information hiding: An analysis of interactive systems, statistical disclosure control, and refinement of specifications [article]

Mário S. Alvim
2012 arXiv   pre-print
We show that, in the presence of nondeterminism, this approach may rely on the assumption that the scheduler "works for the benefit of the protocol", and this is often not a safe assumption.  ...  We apply quantitative approaches to information flow in the first two cases, and we propose improvements for the usual solutions based on process equivalences for the third case.  ...  As we have argued in the introduction, this definition assumes an angelic interpretation of nondeterminism. We want to combine the above notions so to cope with both probability and nondeterminism.  ... 
arXiv:1111.3013v3 fatcat:g65h6p4xsfe6xnxbhpwkksyjaq

Integral biomathics: A post-Newtonian view into the logos of bios

Plamen L. Simeonov
2010 Progress in Biophysics and Molecular Biology  
This work is an attempt for a state-of-the-art survey of natural and life sciences with the goal to define the scope and address the central questions of an original research program.  ...  It is focused on the phenomena of emergence, adaptive dynamics and evolution of self-assembling, self-organizing, self-maintaining and self-replicating biosynthetic systems viewed from a newly-arranged  ...  Indeed, this finding originates from Rashevsky's biological topology (1954) and Rosen's relational biology (1958) which became the foundations of modern theoretical systems biology.  ... 
doi:10.1016/j.pbiomolbio.2010.01.005 pmid:20146929 fatcat:ukagr4ftyjaqvknyjorvewxavm
« Previous Showing results 1 — 15 out of 36 results