Pages that link to "Item:Q1348526"
From MaRDI portal
The following pages link to Testing equivalences for processes (Q1348526):
Displayed 35 items.
- Toward formal development of programs from algebraic specifications: Model-theoretic foundations (Q5204355) (← links)
- Testing preorders for probabilistic processes (Q5204359) (← links)
- Observing Success in the Pi-Calculus (Q5240185) (← links)
- Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity (Q5262954) (← links)
- Confluence Thanks to Extensional Determinism (Q5262976) (← links)
- Equations, Contractions, and Unique Solutions (Q5278202) (← links)
- Bisimulation on speed: Lower time bounds (Q5313721) (← links)
- Smooth coalgebra: testing vector analysis (Q5361142) (← links)
- (Q5376659) (← 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)
- CONFLICTS AND FAIR TESTING (Q5484903) (← links)
- A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA (Q5484905) (← links)
- Attribute-based transactions in service oriented computing (Q5740634) (← links)
- Modelling session types using contracts (Q5741570) (← links)
- Full abstraction for expressiveness: history, myths and facts (Q5741573) (← links)
- Applying a testing approach to the Calculus of Fair Ambients (Q5850754) (← links)
- Termination, deadlock and divergence (Q5887521) (← links)
- Quantales, finite observations and strong bisimulation (Q5940918) (← links)
- Algebraic characterizations of trace and decorated trace equivalences over tree-like structures (Q5940926) (← links)
- Fast asynchronous systems in dense time (Q5940928) (← links)
- From rewrite rules to bisimulation congruences (Q5958468) (← links)
- Divergence in testing and readiness semantics (Q5958758) (← links)
- Reasoning about cryptographic protocols in the spi calculus (Q6044108) (← links)
- An algebraic theory of multiple clocks (Q6044116) (← links)
- On implementations and semantics of a concurrent programming language (Q6044131) (← links)
- A survey on compositional algorithms for verification and synthesis in supervisory control (Q6080680) (← links)
- Just testing (Q6091214) (← links)
- Testing probabilistic automata (Q6104379) (← links)
- Truly concurrent constraint programming (Q6104382) (← links)
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces (Q6116581) (← links)
- On relating concurrency and nondeterminism (Q6116582) (← links)
- Equivalence checking 40 years after: a review of bisimulation tools (Q6163887) (← links)
- Fair must testing for I/O automata (Q6163902) (← links)
- Component-aware input-output conformance (Q6190183) (← links)