Refinements for open automata

DOI10.1007/978-3-031-47115-5_2MaRDI QIDQ6550592zbMATH OpenFDO

Authors Rabéa Ameur-Boulifa, Quentin Corradi, Ludovic Henrio, Eric Madelaine

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47115-5_2

zbMATH Keywords

compositionlabelled transition systemssimulation

Mathematics Subject Classification ID

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

Recommendations

• Compositional equivalences based on open pNets
• Relational concurrent refinement: automata
• Relational concurrent refinement
• Relational concurrent refinement. III: Traces, partial relations and automata
• Unifying concurrent and relational refinement

Cites work

• A calculus of communicating systems
• A theory for the composition of concurrent processes
• Behavioural semantics for asynchronous components
• Compositional equivalences based on open pNets
• Game models for open systems
• How to verify and exploit a refinement of component-based systems
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 1104377 (Why is no real title available?)
• scientific article; zbMATH DE number 1886073 (Why is no real title available?)
• scientific article; zbMATH DE number 2209335 (Why is no real title available?)
• Introduction to bisimulation and coinduction
• Process simulation and refinement
• Stepwise refinement of parallel algorithms
• Subtyping for session types in the pi calculus
• Symbolic bisimulations
• The B-Book

This page was built for publication: Refinements for open automata

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