Language preorder as a precongruence
From MaRDI portal
Publication:1575654
DOI10.1016/S0304-3975(98)00267-9zbMath0944.68101MaRDI QIDQ1575654
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural operational semantics for weak bisimulations
- Transition system specifications with negative premises
- A calculus of communicating systems
- Structured operational semantics and bisimulation as a congruence
- A completeness theorem for Kleene algebras and the algebra of regular events
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- Process algebra for synchronous communication
- Process Algebra
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
- The meaning of negative premises in transition system specifications
- Two Complete Axiom Systems for the Algebra of Regular Events
- On the Forms of the Predicates in the Theory of Constructive Ordinals
This page was built for publication: Language preorder as a precongruence
