Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-45489-3_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W106195609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching bisimulation for probabilistic systems: characteristics and decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking continuous-time Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimilarity and similarity for probabilistic processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative branching-time semantics for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3376698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the semantics of Markov automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Semantics for Every GSPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Bisimilarities on Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quest for Minimal Quotients for Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrency and Composition in a Stochastic World / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Markov chains. And the quest for quantified quality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost Preserving Bisimulations for Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3567136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous-time probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5305630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework for Probabilistic Characterizing Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Nondeterminism in Operational Models of Concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Simulations on Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations / rank
 
Normal rank

Latest revision as of 11:54, 9 July 2024

scientific article
Language Label Description Also known as
English
Computing Behavioral Relations for Probabilistic Concurrent Systems
scientific article

    Statements

    Computing Behavioral Relations for Probabilistic Concurrent Systems (English)
    0 references
    0 references
    0 references
    0 references
    12 January 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers