379 research outputs found
A representable approach to finite nondeterminism
AbstractWe reformulate denotational semantics for nondeterminism, taking a nondeterministic operation V on programs, and sequential composition, as primitive. This gives rise to binary trees. We analyse semantics for both type and program constructors such as products and exponential types, conditionals and recursion, in this setting. In doing so, we define new category-theoretic structures, in particular premonoidal categories. We also account for equivalences of programs such as those induced by associativity, symmetry and idempotence of V, and we study finite approximation by enrichment over the category of ω-cpos with least element. We also show how to recover the classical powerdomains, especially the convex powerdomain, as three instances of a general, computationally natural, construction
On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation
Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm that needs to check a polynomial number of linear programming problems encoding weak transitions. It is hence polynomial, but not guaranteed to be strongly polynomial. In this paper we show that for polynomial rational proba- bilistic automata strong polynomial complexity can be ensured. We further discuss complexity bounds for generic probabilistic automata. Then we consider several practical algorithms and LP transformations that enable an efficient solution for the concrete weak transition problem. This sets the ground for effective compositional minimisation approaches for probabilistic automata and Markov decision processes
Domain and range for angelic and demonic compositions
We give finite axiomatizations for the varieties generated by representable
domain--range algebras when the semigroup operation is interpreted as angelic
or demonic composition, respectively
Soft Concurrent Constraint Programming
Soft constraints extend classical constraints to represent multiple
consistency levels, and thus provide a way to express preferences, fuzziness,
and uncertainty. While there are many soft constraint solving formalisms, even
distributed ones, by now there seems to be no concurrent programming framework
where soft constraints can be handled. In this paper we show how the classical
concurrent constraint (cc) programming framework can work with soft
constraints, and we also propose an extension of cc languages which can use
soft constraints to prune and direct the search for a solution. We believe that
this new programming paradigm, called soft cc (scc), can be also very useful in
many web-related scenarios. In fact, the language level allows web agents to
express their interaction and negotiation protocols, and also to post their
requests in terms of preferences, and the underlying soft constraint solver can
find an agreement among the agents even if their requests are incompatible.Comment: 25 pages, 4 figures, submitted to the ACM Transactions on
Computational Logic (TOCL), zipped file
- …