Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes

Logical Methods in Computer Science - Germany
doi 10.2168/lmcs-10(1:16)2014
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Logical Methods in Computer Science e.V.

Related search

Testing Equivalences for Processes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1983English

On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Probabilistic and Nondeterministic Aspects of Anonymity

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Process Calculi

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2011English

Nondeterministic Versus Probabilistic Linear Search Algorithms

1985English

Super-Strong Representation Theorems for Nondeterministic Sequential Decision Processes

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2017English

Probabilistic Congruence for Semistochastic Generative Processes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Formal Testing of Timed and Probabilistic Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Revisiting Consumer Ethnocentrism: Review, Reconceptualization, and Empirical Testing

Journal of International Marketing
MarketingEconomicsInternational ManagementBusinessEconometrics
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy