Refinements for open automata

DOI10.1007/978-3-031-47115-5_2MaRDI QIDQ6550592

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

Publication date: 5 June 2024

zbMATH Keywords

simulationcompositionlabelled transition systems

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symbolic bisimulations
• Process simulation and refinement
• Stepwise refinement of parallel algorithms
• A calculus of communicating systems
• Behavioural semantics for asynchronous components
• Subtyping for session types in the pi calculus
• Compositional equivalences based on open pNets
• A Theory for the Composition of Concurrent Processes
• Introduction to Bisimulation and Coinduction
• How to Verify and Exploit a Refinement of Component-Based Systems
• The B-Book
• Verification: Theory and Practice

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)