Testing equivalences for processes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3810889 (Why is no real title available?)
- scientific article; zbMATH DE number 3688686 (Why is no real title available?)
- scientific article; zbMATH DE number 3694577 (Why is no real title available?)
- scientific article; zbMATH DE number 3754002 (Why is no real title available?)
- scientific article; zbMATH DE number 3757685 (Why is no real title available?)
- scientific article; zbMATH DE number 3765109 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3640837 (Why is no real title available?)
- A Powerdomain Construction
- A Theory of Communicating Sequential Processes
- A calculus of communicating systems
- A calculus of total correctness for communicating processes
- A term model for synchronous processes
- Algebraic semantics
- Communicating sequential processes
- Data Types as Lattices
- Distributed processes
- Initial Algebra Semantics and Continuous Algebras
- Power domains
- Semantics of nondeterminism, concurrency, and communication
- Universal types in concurrent Pascal
- Varieties of ordered algebras
Cited in
(only showing first 100 items - show all)- Measuring the confinement of probabilistic systems
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
- Process behaviour: formulae vs. tests (extended abstract)
- A hierarchy of failures-based models: theory and application
- A logical view of composition
- A partial ordering semantics for CCS
- Unique decomposition of processes
- Modal logics for communicating systems
- Theory of interaction
- Refusal testing
- Step failures semantics and a complete proof system
- Synthesising correct concurrent runtime monitors
- Specification styles in distributed systems design and verification
- Model independent approach to probabilistic models
- Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Just testing
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- LOTOS extended with probabilistic behaviours
- Divergence in testing and readiness semantics
- Contexts, refinement and determinism
- scientific article; zbMATH DE number 3903949 (Why is no real title available?)
- Fast asynchronous systems in dense time
- Distributability of mobile ambients
- Composition and behaviors of probabilistic I/O automata
- On deciding some equivalences for concurrent processes
- Concurrent transition systems
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Linearity, persistence and testing semantics in the asynchronous pi-calculus
- Deciding observational congruence of finite-state CCS expressions by rewriting
- A logical process calculus
- Faster asynchronous systems.
- Concurrent testing of processes
- On the relative expressive power of calculi for mobility
- From rewrite rules to bisimulation congruences
- Model-based testing of probabilistic systems
- Trace and testing equivalence on asynchronous processes
- Measuring the performance of asynchronous systems with PAFAS
- Ensuring liveness properties of distributed systems: open problems
- Concurrency and atomicity
- Infinite streams and finite observations in the semantics of uniform concurrency
- Modelling causality via action dependencies in branching time semantics
- Performance of pipelined asynchronous systems
- A fully abstract denotational semantics for the \(\pi\)-calculus
- On deciding trace equivalences for processes
- A formal abstract framework for modelling and testing complex software systems
- The calculus of context-aware ambients
- On implementations and semantics of a concurrent programming language
- Testing preorders for probabilistic processes
- Secure implementation of channel abstractions
- A taxonomy of process calculi for distribution and mobility
- A distributed operational semantics of CCS based on condition/event systems
- Tau laws for pi calculus
- Ready to preorder: the case of weak process semantics
- Finite axiom systems for testing preorder and De Simone process languages
- Axiomatizing weak simulation semantics over BCCSP
- A theory of contracts for strong service compliance
- On the operational semantics of nondeterminism and divergence
- An algebraic theory of multiple clocks
- Abstract interface behavior of object-oriented languages with monitors
- The security pi-calculus and non-interference
- Vertical implementation
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
- Observational structures and their logic
- Proof systems for infinite behaviours
- Basic observables for a calculus for global computing
- Bisimulation on speed: Lower time bounds
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- Bisimulation on speed: Worst-case efficiency
- Testing equivalence for mobile processes
- A comparison of three authentication properties.
- On performance congruences for process algebras
- Typed behavioural equivalences for processes in the presence of subtyping
- Type theory and concurrency
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
- Efficiency of asynchronous systems and read arcs in petri nets
- On reduction-based process semantics
- Model-checking process equivalences
- Modelling session types using contracts
- From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
- Fair testing
- Impossible futures and determinism
- Deciding equivalence-based properties using constraint solving
- Name-passing calculi: from fusions to preorders and types
- Mutation testing in UTP
- On the expressiveness of interaction
- Specification, testing and implementation relations for symbolic-probabilistic systems
- Connectors as designs: modeling, refinement and test case generation
- Testing preorders for probabilistic processes.
- A hierarchy of equivalences for asynchronous calculi
- Additive models of probabilistic processes
- Structured operational semantics and bisimulation as a congruence
- Bisimulation through probabilistic testing
- Real-reward testing for probabilistic processes
- Trace, failure and testing equivalences for communicating processes
- Specification-oriented semantics for communicating processes
- Strategies as concurrent processes
- Essential concepts of algebraic specification and program development
- Weighted Bisimulation in Linear Algebraic Form
- Quantifying information leakage in process calculi
This page was built for publication: Testing equivalences for processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348526)
