Axiomatizing Team Equivalence for Finite-State Machines

DOI10.1007/978-3-030-31175-9_2MaRDI QIDQ6489012FDOQ6489012

Authors: Roberto Gorrieri 

Publication date: 14 March 2024

Recommendations

• Team equivalences for finite-state machines with silent moves
• Verification of finite-state machines: a distributed approach
• Team bisimilarity, and its associated modal logic, for BPP nets
• Nonaxiomatisability of equivalences over finite state processes
• A study on team bisimulation and H-team bisimulation for BPP nets

Mathematics Subject Classification ID

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

Cited In (1)

• Interleaving vs True Concurrency: Some Instructive Security Examples

This page was built for publication: Axiomatizing Team Equivalence for Finite-State Machines

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