scientific article; zbMATH DE number 3814961

MaRDI QIDQ3662610zbMATHFDO

Authors Rocco De Nicola, Matthew Hennessy

Publication date 1983

zbMATH Keywords

CCScomplete proof systemsrepresentation treessemantic theory for processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited in

(14)

• General refinement. I: Interfaces, determinism and special refinement
• A coinductive calculus for asynchronous side-effecting processes
• Refusal testing
• Synchronization trees
• A proof-theoretic characterization of observational equivalence
• Observation equivalence as a testing equivalence
• On bisimilarity in lambda calculi with continuous probabilistic choice
• Axiomatising finite delay operators
• Non-deterministic data types: Models and implementations
• Testing probabilistic equivalence through reinforcement learning
• On powerdomains and modality
• (Bi)simulations up-to characterise process semantics
• Typing access control and secure information flow in sessions
• Simulations up-to and canonical preorders (extended abstract)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3662610)