A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Extensional equivalence for transition systems
Acta Informatica
Three partition refinement algorithms
SIAM Journal on Computing
Observation equivalence as a testing equivalence
Theoretical Computer Science
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Testing equivalences and fully abstract models for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
A polynomial-time algorithm for the equivalence of probabilistic automata
SIAM Journal on Computing
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Theoretical Computer Science
Probabilistic and prioritized models of timed CSP
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
A compositional approach to performance modelling
A compositional approach to performance modelling
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Theoretical Computer Science
Testing preorders for probabilistic processes
Information and Computation
Absolute versus relative time in process algebras
Information and Computation - Special issue on EXPRESS 1997
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
A complete axiom system for finite-state probabilistic processes
Proof, language, and interaction
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Performance measure sensitive congruences for Markovian process algebras
Theoretical Computer Science
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Equational Axioms for Probabilistic Bisimilarity
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Extending Process Languages with Time
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Theory of Testing for Markovian Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Norm Functions for Probabilistic Bisimulations with Delays
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Testing and Refinement for Nondeterministic and Probabilistic Processes
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Efficient Algorithms for Verification of Equivalences for Probabilistic Processes
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Testing Semantics for a Probabilistic-Timed Process Algebra
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Specifying Performance Measures for PEPA
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Compositional Testing Preorders for Probabilistic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Equivalence notions and model minimization in Markov decision processes
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Optimal state-space lumping in Markov chains
Information Processing Letters
Axiomatization of Trace Semantics for Stochastic Nondeterministic Processes
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Branching bisimulation for probabilistic systems: characteristics and decidability
Theoretical Computer Science - Expressiveness in concurrency
Lumping Markov Chains with Silent Steps
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
Basic Observables for Probabilistic May Testing
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
Rate-Based Transition Systems for Stochastic Process Calculi
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Testing Finitary Probabilistic Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
A Process Algebraic Approach to Software Architecture Design
A Process Algebraic Approach to Software Architecture Design
On a Uniform Framework for the Definition of Stochastic Process Languages
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparative branching-time semantics for Markov chains
Information and Computation
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
On Probabilistic Automata in Continuous Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Probabilistic Logical Characterization
Information and Computation
Bisimulations meet PCTL equivalences for probabilistic automata
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
Retaining the probabilities in probabilistic testing theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Formal Methods in System Design
Exploring probabilistic bisimulations, part I
Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan
Weak markovian bisimulation congruences and exact CTMC-Level aggregations for sequential processes
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Bisimulation and logical preservation for continuous-time markov decision processes
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Efficient modelling and generation of Markov automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
On coinductive equivalences for higher-order probabilistic functional programs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.00 |
Labeled transition systems are typically used as behavioral models of concurrent processes. Their labeled transitions define a one-step state-to-state reachability relation. This model can be generalized by modifying the transition relation to associate a state reachability distribution with any pair consisting of a source state and a transition label. The state reachability distribution is a function mapping each possible target state to a value that expresses the degree of one-step reachability of that state. Values are taken from a preordered set equipped with a minimum that denotes unreachability. By selecting suitable preordered sets, the resulting model, called ULTraS from Uniform Labeled Transition System, can be specialized to capture well-known models of fully nondeterministic processes (LTS), fully probabilistic processes (ADTMC), fully stochastic processes (ACTMC), and nondeterministic and probabilistic (MDP) or nondeterministic and stochastic (CTMDP) processes. This uniform treatment of different behavioral models extends to behavioral equivalences. They can be defined on ULTraS by relying on appropriate measure functions that express the degree of reachability of a set of states when performing multi-step computations. It is shown that the specializations of bisimulation, trace, and testing equivalences for the different classes of ULTraS coincide with the behavioral equivalences defined in the literature over traditional models except when nondeterminism and probability/stochasticity coexist; then new equivalences pop up.