Connection between logical and algebraic approaches to concurrent systems
From MaRDI portal
Recommendations
Cites work
- A calculus of durations
- A domain equation for bisimulation
- A lattice-theoretical fixpoint theorem and its applications
- A logic for the description of non-deterministic programs and their properties
- A modal characterization of observational congruence on finite terms of CCS
- A survey of verification techniques for parallel programs
- Algebra of communicating processes with abstraction
- Characteristic formulae for processes with divergence
- scientific article; zbMATH DE number 3901996 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- Observation equivalence as a testing equivalence
- Results on the propositional \(\mu\)-calculus
- Termination, deadlock, and divergence
- Three Partition Refinement Algorithms
- Towards the hierarchical verification of reactive systems
This page was built for publication: Connection between logical and algebraic approaches to concurrent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060196)