Results 1 
5 of
5
Possibilistic and Probabilistic AbstractionBased Model Checking
 Process Algebra and Probabilistic Methods, Performance Modeling and Veri Second Joint International Workshop PAPMPROBMIV 2002, volume 2399 of Lecture Notes in Computer Science
, 2002
"... models whose verification results transfer to the abstracted models for a logic with unrestricted use of negation and quantification. This framework is novel in that its models have quantitative or probabilistic observables and state transitions. Properties of a quantitative temporal logic have meas ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
models whose verification results transfer to the abstracted models for a logic with unrestricted use of negation and quantification. This framework is novel in that its models have quantitative or probabilistic observables and state transitions. Properties of a quantitative temporal logic have measurable denotations in these models. For probabilistic models such denotations approximate the probabilistic semantics of full LTL. We show how predicatebased abstractions specify abstract quantitative and probabilistic models with finite state space. 1
The Demonic Product of Probabilistic Relations
, 2001
"... The demonic product of two probabilistic relations is defined and investigated. It is shown that the product is stable under bisimulations when the mediating object is probabilistic, and that under some mild conditions the nondeterministic fringe of the probabilistic relations behaves properly: the ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The demonic product of two probabilistic relations is defined and investigated. It is shown that the product is stable under bisimulations when the mediating object is probabilistic, and that under some mild conditions the nondeterministic fringe of the probabilistic relations behaves properly: the fringe of the product equals the demonic product of the fringes.
Congruences for Stochastic Relations
, 2003
"... We discuss congruences for stochastic relations, stressing the equivalence of smooth equivalence relations and countably generated σalgebras. Factor spaces are constructed for congruences and for morphisms. Semipullbacks are needed when investigating the interplay between congruences and bisimul ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We discuss congruences for stochastic relations, stressing the equivalence of smooth equivalence relations and countably generated σalgebras. Factor spaces are constructed for congruences and for morphisms. Semipullbacks are needed when investigating the interplay between congruences and bisimulations, and it is shown that semipullbacks exist for stochastic relations over analytic spaces, generalizing a previous result and answering an open question. Equivalent congruences are investigated, and it is shown that stochastic relations that have equivalent congruences are bisimilar. The wellknown equivalence relation coming from a HennessyMilner logic for labelled Markov transition systems is shown to be a special case in this development.
Pipes and Filters: Modelling a Software Architecture Through Relations
, 2002
"... A pipeline is a popular architecture which connects computational components/filers) through connectors (pipes) so that computations are performed in a stream like fashion. The data are transported through the pipes between filers, gradually transforming inputs to outputs. This kind of stream proces ..."
Abstract
 Add to MetaCart
A pipeline is a popular architecture which connects computational components/filers) through connectors (pipes) so that computations are performed in a stream like fashion. The data are transported through the pipes between filers, gradually transforming inputs to outputs. This kind of stream processing has been made popular through UNIX pipes that serially connect independent components for performing a sequence of tasks. We show in this paper how to formalize this architecture in terms of monads, hereby including relational specifications as special cases. The system is given through a directed acyclic graph the nodes of which carry the computational structure by being labelled with morphisms from the monad, and the edges provide the data for these operations. It is shown how fundamental compositional operations like combining pipes and filers, and refining a system by replacing simple parts through more elaborate ones, are supported through this construction.
in a probabilistic logic
, 2002
"... Reasoning about probabilistic sequential programs ..."
(Show Context)