A term model for synchronous processes
From MaRDI portal
Cited in
(26)- A context dependent equivalence between processes
- A fully abstract denotational semantics for the calculus of higher-order communicating systems
- Axiomatizing weak ready simulation semantics over BCCSP
- A semantic theory for value-passing processes based on the late approach
- Lifting non-finite axiomatizability results to extensions of process algebras
- A fully abstract denotational model for observational precongruence
- The equational theory of prebisimilarity over basic CCS with divergence
- A fully abstract model for the \(\pi\)-calculus.
- Merging regular processes by means of fixed-point theory
- A complete equational axiomatization for MPA with string iteration
- A characterization of finitary bisimulation
- GSOS and finite labelled transition systems
- Calculi for synchrony and asynchrony
- Algebra of communicating processes with abstraction
- Semantics for finite delay
- Axiomatizing recursion-free, regular monitors
- Testing equivalence as a bisimulation equivalence
- Axiomatising finite delay operators
- Testing equivalences for processes
- SOS rule formats for idempotent terms and idempotent unary operators
- Systems modelling via resources and processes: philosophy, calculus, semantics, and logic
- Termination, deadlock and divergence
- A domain equation for bisimulation
- CPO models for a class of GSOS languages
- Axiomatizing weak simulation semantics over BCCSP
- A fully abstract denotational model for observational precongruence
This page was built for publication: A term model for synchronous processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3969860)
