scientific article; zbMATH DE number 3986626
From MaRDI portal
Publication:3750113
Recommendations
Cited in
(30)- A logic for the specification and proof of regular controllable processes of CCS
- Bisimulations and abstraction homomorphisms
- Deadlock and fairness in morphisms of transition systems
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- A state-based approach to communicating processes
- Concurrent transition systems
- Concurrency and atomicity
- Towards a foundation for semantics in complete metric spaces
- A note on the characterization of weak bisimulation congruence in CCS
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- A complete axiomatisation for observational congruence of finite-state behaviours
- Process calculus based upon evaluation to committed form
- Nonexpressibility of fairness and signaling
- Architectural CCS
- On CCS with parametric relabelling
- On the concurrent computational content of intermediate logics
- Concurrent calculus (CC) and its properties
- A domain equation for bisimulation
- scientific article; zbMATH DE number 1638667 (Why is no real title available?)
- Fairness and regularity for SCCS processes
- scientific article; zbMATH DE number 30325 (Why is no real title available?)
- scientific article; zbMATH DE number 176155 (Why is no real title available?)
- scientific article; zbMATH DE number 3995044 (Why is no real title available?)
- A calculus of countable broadcasting systems
- Making the unobservable, unobservable
- Causal Unfoldings
- Process calculus based upon evaluation to committed form
- Parametric channels via label expressions in CCS
- Combining data type and recursive process specifications using projection algebras
- Algebraic specification of concurrent systems
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 Q3750113)
