Paulo Mateus, Amílcar Sernadas Cristina Sernadas  Home/Search
Context
Related
| cs.math.ist.utl.pt/...98MSSprobaut.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.math.ist.utl.pt/s84....publist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Adopting the categorial approach to aggregating, interconnecting and constraining probabilistic automata, we start by looking for the notion of morphism that will lead to the characterization of aggregation as product and of interconnection and constraining as cartesian lifting. Having established the suitable notion of morphism between (presentations of countable) probability spaces and shown that such morphisms do not always compose, we are conducted to the new notion of precategory where... (Update)
Similar documents (at the sentence level):
51.4%: Precategories for Combining Probabilistic Automata - Mateus, Sernadas, Sernadas (1999) (Correct)
Active bibliography (related documents): More All
0.5: Model Checking Expected Time and Expected Reward.. - Kwiatkowska, Norman.. (2002) (Correct)
0.5: Sorting Out Signature Schemes - Pfitzmann (1995) (Correct)
0.4: Category Theory in Coq - Carvalho (1998) (Correct)
Similar documents based on text: More All
0.6: Paracategories II: Adjunctions, fibrations and examples from.. - Hermida, Mateus (2002) (Correct)
0.5: Probabilistic Situation Calculus - Mateus, Pacheco, Pinto, Sernadas.. (2000) (Correct)
0.5: Systems, 15(1):37--59, 1990. [151] C. Sernadas, J. Fiadeiro, and .. - The Role (Correct)
BibTeX entry: (Update)
@techreport{ mateus98combining,
author = "P. Mateus and A. Sernadas and C. Sernadas",
title = "Combining Probabilistic Automata:
Categorial Characterization",
address = "1096 Lisboa, Portugal",
year = "1998",
url = "citeseer.ist.psu.edu/351175.html" }
Citations (may not include all citations):144 Models of concurrency - Winskel, Nielsen - 1995
74 Symbolic model checking for probabilistic processes - Baier, Clarke et al. - 1997
52 Information and Control (context) - Rabin - 1963
50 Bisimulation for labelled Markov processes - Blute, Desharnais et al. - 1997
38 and compositional verification (context) - Long, abstraction - 1993
37 Proving time bounds for randomized distributed algorithms - Lynch, Saias et al. - 1994
20 Modelling and Verification of Randomized Distributed Real-Ti.. (context) - Segala - 1995
20 A categorical manifesto - Goguen - 1991
12 Prentice-Hall International Series in Computer Science (context) - Barr, Wells et al. - 1990
7 Automatic verification of liveness properties of randomized .. - Baier, Kwiatkowska - 1997
3 North-Holland Publishing Company (context) - Revuz - 1975
3 and compositionality (context) - Winskel, algebras - 1987
3 Some aspects of probabalistic automata (context) - Paz - 1966
3 Abstract and concrete categories: the joy of cats (context) - Ad'amek, Herrlich et al. - 1990
2 New York (context) - Lamperti, Benjamin - 1966
2 Chapman and Hall (context) - Kulkarni, Analysis et al. - 1995
Documents on the same site (http://www.cs.math.ist.utl.pt/s84.www/cs/lcg/publist/publist.html): More
A Theory-based Topological Notion of Institution - Sernadas, Sernadas.. (Correct)
Operational Semantics and Type System for GNOME on Typed.. - Ravara, Vasconcelos (1996) (Correct)
Behavioural Types for a Calculus of Concurrent Objects - Ravara, Vasconcelos (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC