On constructibility and unconstructibility of LTS operators from other LTS operators
From MaRDI portal
Publication:2340256
Recommendations
Cites work
- Algèbre de processus et synchronisation
- All linear-time congruences for familiar operators
- Compositional failure-based semantic models for basic LOTOS
- Fair testing
- Higher-level synchronising devices in Meije-SCCS
- scientific article; zbMATH DE number 3926231 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 557977 (Why is no real title available?)
- scientific article; zbMATH DE number 1059329 (Why is no real title available?)
- Musings on encodings and expressiveness
- On cool congruence formats for weak bisimulations
- Structural operational semantics for weak bisimulations
- Structural operational semantics.
- The weakest deadlock-preserving congruence
- Towards a unified approach to encodability and separation results for process calculi
- Understanding concurrent systems
Cited in
(2)
This page was built for publication: On constructibility and unconstructibility of LTS operators from other LTS operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340256)