Pages that link to "Item:Q1898113"
From MaRDI portal
The following pages link to Reactive, generative, and stratified models of probabilistic processes (Q1898113):
Displaying 47 items.
- Non-bisimulation-based Markovian behavioral equivalences (Q2373649) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms (Q2453112) (← links)
- Modular construction of complete coalgebraic logics (Q2464936) (← links)
- A modular approach to defining and characterising notions of simulation (Q2495641) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- A theory of stochastic systems. I: Stochastic automata (Q2575854) (← links)
- Quantitative information in the tuple space coordination model (Q2576948) (← links)
- On the verification of qualitative properties of probabilistic processes under fairness constraints. (Q2583540) (← links)
- A general SOS theory for the specification of probabilistic transition systems (Q2629851) (← links)
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC (Q2633503) (← links)
- Determining asynchronous test equivalence for probabilistic processes (Q2671816) (← links)
- Probabilistic model of software approximate correctness (Q2825263) (← links)
- Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations (Q2830042) (← links)
- GSOS for probabilistic transition systems (extended abstract) (Q2842551) (← links)
- Notes on generative probabilistic bisimulation (Q2866317) (← links)
- On probabilistic techniques for data flow analysis (Q2870284) (← links)
- Coalgebraic trace semantics via forgetful logics (Q2974794) (← links)
- The compositional construction of Markov processes II (Q3006162) (← links)
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC (Q3021957) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers (Q3184684) (← links)
- From Gene Regulation to Stochastic Fusion (Q3543333) (← links)
- Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems (Q3613092) (← links)
- Weighted versus Probabilistic Logics (Q3637211) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q4571977) (← links)
- (Q4580323) (← links)
- A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Q4917062) (← links)
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice (Q4923369) (← links)
- Linear Structures for Concurrency in Probabilistic Programming Languages (Q4923370) (← links)
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
- Bisimulation as a logical relation (Q5058364) (← links)
- Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
- Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity (Q5262954) (← links)
- Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders (Q5428916) (← links)
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems (Q5458058) (← links)
- Non Expansive ε-Bisimulations (Q5505435) (← links)
- Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems (Q5739363) (← links)
- Equivalence relations for modular performance evaluation in dtsPBC (Q5740349) (← links)
- Corrigendum to ``A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time'' (Q5941736) (← links)
- Process algebra for performance evaluation (Q5958464) (← links)
- A framework to measure the robustness of programs in the unpredictable environment (Q6135769) (← links)
- Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)
- Probabilistic weak bisimulation and axiomatization for probabilistic models (Q6161460) (← links)
- Uniform random process model revisited (Q6536319) (← links)
- Performance preserving equivalence for stochastic process algebra dtsdPBC (Q6587404) (← links)
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)
