Testing equivalences for processes
From MaRDI portal
Recommendations
Cites work
- A calculus of communicating systems
- A calculus of total correctness for communicating processes
- A Powerdomain Construction
- A term model for synchronous processes
- A Theory of Communicating Sequential Processes
- Algebraic semantics
- Communicating sequential processes
- Data Types as Lattices
- Distributed processes
- 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?)
- 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)- Revivals, stuckness and the hierarchy of CSP models
- Generating priority rewrite systems for OSOS process languages
- Abstract interface behavior of object-oriented languages with monitors
- Mutation testing in UTP
- Quantifying information leakage in process calculi
- Specification-oriented semantics for communicating processes
- An algebraic theory of fair asynchronous communicating processes
- A context dependent equivalence between processes
- On observational equivalence and algebraic specification
- Toward formal development of programs from algebraic specifications: Implementations revisited
- Infinite streams and finite observations in the semantics of uniform concurrency
- An introduction to the regular theory of fairness
- Trace, failure and testing equivalences for communicating processes
- A distributed operational semantics of CCS based on condition/event systems
- Concurrent transition systems
- Type theory and concurrency
- Concurrency and atomicity
- A process algebraic view of Linda coordination primitives
- Bisimulation through probabilistic testing
- Correctness of concurrent processes
- The equivalence in the DCP model
- Specification styles in distributed systems design and verification
- The chemical abstract machine
- Observational structures and their logic
- Proof systems for infinite behaviours
- Experimenting with process equivalence
- Structured operational semantics and bisimulation as a congruence
- Complete sets of axioms for finite basic LOTOS behavioural equivalences
- Enriched categorical semantics for distributed calculi
- Unique decomposition of processes
- TIC: a tImed calculus
- LOTOS extended with probabilistic behaviours
- Liveness in timed and untimed systems
- An invitation to friendly testing
- On performance congruences for process algebras
- On the expressiveness of internal mobility in name-passing calculi
- A calculus for cryptographic protocols: The spi calculus
- Exact performance equivalence: An equivalence relation for stochastic automata
- A behavioural theory of first-order CML
- Basic observables for processes
- On deciding trace equivalences for processes
- An exercise in the automatic verification of asynchronous designs
- A fully abstract trace model for dataflow and asynchronous networks
- When is partial trace equivalence adequate?
- On reduction-based process semantics
- On the operational semantics of nondeterminism and divergence
- Quiescence, fairness, testing, and the notion of implementation
- Essential concepts of algebraic specification and program development
- Composition and behaviors of probabilistic I/O automata
- Semantics for finite delay
- The power of reachability testing for timed automata
- Algebraic theory of probabilistic and nondeterministic processes.
- Algebraic theory of probabilistic processes.
- Faster asynchronous systems.
- Linda-based applicative and imperative process algebras
- Finite axiom systems for testing preorder and De Simone process languages
- Analysis of equivalence relations of event structures with continuous time
- Testing congruence for mobile processes
- Testing preorders for probabilistic processes can be characterized by simulations
- A fully abstract denotational semantics for the \(\pi\)-calculus
- Truly concurrent constraint programming
- Impossible futures and determinism
- Additive models of probabilistic processes
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- On the validity of encodings of the synchronous in the asynchronous -calculus
- Probabilistic bisimilarity as testing equivalence
- Verification of asynchronous systems with an unspecified component
- Unifying behavioral equivalences of timed transition systems
- A hierarchy of failures-based models: theory and application
- The security pi-calculus and non-interference
- A hierarchy of equivalences for asynchronous calculi
- A framework for specifying and verifying the behaviour of open systems
- Measuring the performance of asynchronous systems with PAFAS
- Observational congruences for dynamically reconfigurable tile systems
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Modular specification of process algebras
- Performance measure sensitive congruences for Markovian process algebras
- A comparison of three authentication properties.
- Testing preorders for probabilistic processes.
- Vertical implementation
- Trace and testing equivalence on asynchronous processes
- Secure implementation of channel abstractions
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Tau laws for pi calculus
- Testing equivalence for mobile processes
- Asynchronous communication model based on linear logic
- Concurrent testing of processes
- Compositional failure-based semantic models for basic LOTOS
- Composition methods for constructing characteristic formulas for dense-time models
- Temporal-logic property preservation under Z refinement
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Towards a unified approach to encodability and separation results for process calculi
- Deciding bisimilarity and similarity for probabilistic processes.
- Process calculi as a tool for studying coordination, contracts and session types
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- Ensuring liveness properties of distributed systems: open problems
- A fixed-points based framework for compliance of behavioural contracts
- A theory of monitors
- Processes against tests: on defining contextual equivalences
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)
