scientific article; zbMATH DE number 3986626
From MaRDI portal
Publication:3750113
zbMATH Open0609.68020MaRDI QIDQ3750113FDOQ3750113
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Theory of operating systems (68N25)
Cited In (23)
- On the concurrent computational content of intermediate logics
- Towards a foundation for semantics in complete metric spaces
- Bisimulations and abstraction homomorphisms
- Concurrency and atomicity
- A complete axiomatisation for observational congruence of finite-state behaviours
- Deadlock and fairness in morphisms of transition systems
- Process calculus based upon evaluation to committed form
- A state-based approach to communicating processes
- A note on the characterization of weak bisimulation congruence in CCS
- Fairness and regularity for SCCS processes
- Title not available (Why is that?)
- Causal Unfoldings
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- Algebraic specification of concurrent systems
- A logic for the specification and proof of regular controllable processes of CCS
- A domain equation for bisimulation
- Nonexpressibility of fairness and signaling
- Parametric channels via label expressions in CCS
- Concurrent transition systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Combining data type and recursive process specifications using projection algebras
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)
