Bisimulation relations for weighted automata (Q2481957): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075690166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304869 / 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: Iteration 2-theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A notion of equivalence for stochastic Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact performance equivalence: An equivalence relation for stochastic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation and representation of large reachability sets for composed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation for probabilistic transition systems: A coalgebraic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal state-space lumping in Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation for labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance evaluation of (max,+) automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional minimisation of finite state systems using interface specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compositional Approach to Performance Modelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Continuous Time Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324960 / rank
 
Normal rank

Latest revision as of 20:30, 27 June 2024

scientific article
Language Label Description Also known as
English
Bisimulation relations for weighted automata
scientific article

    Statements

    Bisimulation relations for weighted automata (English)
    0 references
    0 references
    15 April 2008
    0 references
    finite automata
    0 references
    weighted automata
    0 references
    equivalence
    0 references
    bisimulation
    0 references
    congruence
    0 references
    aggregation
    0 references

    Identifiers