scientific article; zbMATH DE number 1759619

MaRDI QIDQ4536610zbMATH OpenFDO

Authors Marco Bernardo, Rance Cleaveland

Publication date 25 June 2002

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Approximating Markovian testing equivalence
• scientific article; zbMATH DE number 7311343
• Testing preorders for probabilistic processes.
• scientific article; zbMATH DE number 2086650
• Algebraic theory of probabilistic processes.

Cited in

(19)

• Comparative branching-time semantics for Markov chains
• Determining asynchronous test equivalence for probabilistic processes
• Approximating Markovian testing equivalence
• Logical characterization of fluid equivalences
• scientific article; zbMATH DE number 1863172 (Why is no real title available?)
• On real reward testing
• Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
• Twistor spaces and harmonic maps
• Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders
• Non-bisimulation-based Markovian behavioral equivalences
• Parameter estimation and model testing for Markov processes via conditional characteristic functions
• Testing hypothesis on transition distributions of a Markov sequence
• scientific article; zbMATH DE number 1869949 (Why is no real title available?)
• Testing processes for efficiency
• scientific article; zbMATH DE number 5717653 (Why is no real title available?)
• Domain theory, testing and simulation for labelled Markov processes
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• scientific article; zbMATH DE number 3973993 (Why is no real title available?)
• Bisimulation and Simulation Relations for Markov Chains

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536610)