The stochastic shortest path problem (SSP) is a highly expressive model for probabilistic planning. The computational hardness of SSPs has sparked interest in determinization-based planners that can quickly solve large problems. However, existing methods employ a simplistic approach to determinization. In particular, they ignore the possibility of tailoring the determinization to the specific c...

The two determinization procedures of Safra and MullerSchupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.

interpretation: Domains and surroundings. Abstract interpretation is a general theory for specifying and designing approximate semantics of program languages [10]. Approximation can be equivalently formulated either in terms of Galois connections or closure operators [11]. An upper closure operator ρ : C → C on a poset C (uco(C ) for short), representing concrete objects, is monotone, idempoten...

This is a review of those aspects of the theory of varieties of Boolean algebras with operators (BAO’s) that emphasise connections with modal logic and structural properties that are related to natural properties of logical systems. It begins with a survey of the duality that exists between BAO’s and relational structures, focusing on the notions of bounded morphisms, inner substructures, disjo...

Preconcepts are basic units of knowledge that form the basis formal concepts in concept analysis (FCA). This paper investigates relations among different kinds preconcepts, such as protoconcepts, meet and join-semiconcepts concepts. The first contribution this paper, is to present a fuzzy powerset lattice gradation, coincides with preconcept at its 1-cut. second more significant contribution, i...

A transition system can be presented either as a binary relation or as a coalgebra for the powerset functor, each representation being obtained from the other by transposition. More generally, a coalgebra for a functor F generalises transition systems in the sense that a shape for transitions is determined by F, typically encoding a signature of methods and observers. This paper explores such a...

Given a setU of alternatives, a choice (correspondence) onU is a contractive map c defined on a family Ω of nonempty subsets ofU . Semantically, a choice c associates to each menu A ∈ Ω a nonempty subset c(A) ⊆ A comprising all elements of A that are deemed selectable by an agent. A choice on U is total if its domain is the powerset of U minus the empty set, and partial otherwise. According to ...

Given a setU of alternatives, a choice (correspondence) onU is a contractive map c defined on a family Ω of nonempty subsets ofU . Semantically, a choice c associates to each menu A ∈ Ω a nonempty subset c(A) ⊆ A comprising all elements of A that are deemed selectable by an agent. A choice on U is total if its domain is the powerset of U minus the empty set, and partial otherwise. According to ...

This paper explores the relationship between simulation and the emerging topics of Lean Thinking and lean construction. The ideas which have motivated the evolution of lean construction concepts are presented. The use of simulation as a means of evaluating the benefit of using lean construction techniques is discussed. Two examples of lean thinking based re-design of common construction process...

Liftings of endofunctors on sets to relations are commonly used capture bisimulation coalgebras. Lax versions have been in those cases where strict lifting fails bisimilarity, as well modeling other notions simulation. This paper provides tools for defining and manipulating lax liftings. As a central result, we define notion distributive law functor over the powerset monad, show that there is a...