scientific article; zbMATH DE number 1479628

MaRDI QIDQ4490742zbMATH OpenFDO

Authors Wan Fokkink

Publication date 20 July 2000

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• Transition system specifications with negative premises
• scientific article; zbMATH DE number 176757
• Structured operational semantics and bisimulation as a congruence
• Language preorder as a precongruence

Cited in

(10)

• Structured operational semantics and bisimulation as a congruence
• A complete equational axiomatization for prefix iteration
• Language preorder as a precongruence
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• A theory of stochastic systems. II: Process algebra
• On well-foundedness and expressiveness of promoted tyft (being promoted makes a difference)
• Transition system specifications with negative premises
• Rooted branching bisimulation as a congruence for probabilistic transition systems
• Duplication of constants in process algebra
• SOS formats and meta-theory: 20 years after

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490742)