An equational characterisation of the must testing pre-order for regular processes

DOI10.1007/978-3-030-21485-2_3MaRDI QIDQ6199100zbMATH OpenOpenAlexFDO

Authors Matthew G. Hennessy

Publication date 23 February 2024

Published in Models, Languages, and Tools for Concurrent and Distributed Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-21485-2_3

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Characterising Testing Preorders for Finite Probabilistic Processes
• Testing equivalences for processes
• A coinductive equational characterisation of trace inclusion for regular processes
• Processes as formal power series: a coinductive approach to denotational semantics
• Proof systems for infinite behaviours

This page was built for publication: An equational characterisation of the must testing pre-order for regular processes

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