A coinductive equational characterisation of trace inclusion for regular processes

DOI10.1007/978-3-319-63121-9_22MaRDI QIDQ5217313zbMATH OpenOpenAlexFDO

Authors Matthew Hennessy

Publication date 24 February 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-63121-9_22

Mathematics Subject Classification ID

Logic in computer science (03B70) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Algebra and Coalgebra in Computer Science
• Regular expression containment, coinductive axiomatization and computational interpretation
• Proving language inclusion and equivalence by coinduction
• A coalgebraic approach to process equivalence and a coinduction principle for traces
• Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences

Cited in

(4)

• Equational axioms for regular sets
• Regular expression containment, coinductive axiomatization and computational interpretation
• Algebra and Coalgebra in Computer Science
• An equational characterisation of the must testing pre-order for regular processes

This page was built for publication: A coinductive equational characterisation of trace inclusion for regular processes

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