Language preorder as a precongruence
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3990852 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 4001464 (Why is no real title available?)
- scientific article; zbMATH DE number 794263 (Why is no real title available?)
- scientific article; zbMATH DE number 3310090 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- A calculus of communicating systems
- A completeness theorem for Kleene algebras and the algebra of regular events
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- Process Algebra
- Process algebra for synchronous communication
- Structural operational semantics for weak bisimulations
- Structured operational semantics and bisimulation as a congruence
- The meaning of negative premises in transition system specifications
- Transition system specifications with negative premises
- Two Complete Axiom Systems for the Algebra of Regular Events
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
Cited in
(8)- Lean and full congruence formats for recursion
- scientific article; zbMATH DE number 1163953 (Why is no real title available?)
- A precongruence format for should testing preorder
- A pre-congruence format for \(XY\)-simulation
- Precongruence formats for decorated trace semantics
- Rooted branching bisimulation as a congruence
- scientific article; zbMATH DE number 1479628 (Why is no real title available?)
- Some properties of precedence languages
This page was built for publication: Language preorder as a precongruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575654)
