Pages that link to "Item:Q1391788"

The following pages link to The algebra of communicating processes with empty process (Q1391788):

Displaying 18 items.

• A process calculus with finitary comprehended terms (Q385508) (← links)
• A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
• The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) (Q549205) (← links)
• Duplication of constants in process algebra (Q864505) (← links)
• Revisiting sequential composition in process calculi (Q890611) (← links)
• On the consistency of Koomen's fair abstraction rule (Q1090103) (← links)
• Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
• Nonaxiomatisability of equivalences over finite state processes (Q1377607) (← links)
• A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
• Decomposition orders -- another generalisation of the fundamental theorem of arithmetic (Q1781996) (← links)
• Axiomatizing GSOS with termination (Q1878716) (← links)
• Rule formats for compositional non-interference properties (Q1878717) (← links)
• Rooted branching bisimulation as a congruence (Q1975965) (← links)
• On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
• Expressiveness modulo bisimilarity of regular expressions with parallel composition (Q2971071) (← links)
• Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination (Q4917024) (← links)
• (Q5021231) (← links)
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity (Q5875352) (← links)