scientific article; zbMATH DE number 1113856

MaRDI QIDQ4375630zbMATH OpenFDO

Authors Wan Fokkink

Publication date 10 May 1998

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• Completeness for identity-free Kleene lattices
• On finite model property of the equational theory of Kleene algebras
• A complete equational axiomatization for MPA with string iteration
• A completeness theorem for Kleene algebras and the algebra of regular events
• A complete proof system for 1-free regular expressions modulo bisimilarity

Cited in

(16)

• An equational axiomatization for multi-exit iteration
• Termination modulo equations by abstract commutation with an application to iteration
• Bisimilarity of open terms.
• Equational theories for automata
• Left-handed completeness
• Left-handed completeness
• Axiomatizations for the perpetual loop in process algebra
• A Finite Axiomatization of Nondeterministic Regular Expressions
• Completeness for identity-free Kleene lattices
• A complete proof system for 1-free regular expressions modulo bisimilarity
• Using Hoare logic in a process algebra setting
• *-continuity vs. induction: divide and conquer
• Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
• On the complete axiomatization for prefix iteration modulo observation congruence
• Image reflection on process graphs of 1-free regular expressions modulo bisimilarity
• Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?

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 Q4375630)