Refinements for open automata
From MaRDI portal
Publication:6550592
DOI10.1007/978-3-031-47115-5_2MaRDI QIDQ6550592FDOQ6550592
Authors: Rabéa Ameur-Boulifa, Quentin Corradi, Ludovic Henrio, Eric Madelaine
Publication date: 5 June 2024
Recommendations
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A calculus of communicating systems
- The B-Book
- Subtyping for session types in the pi calculus
- Title not available (Why is that?)
- Introduction to bisimulation and coinduction
- Symbolic bisimulations
- Title not available (Why is that?)
- Stepwise refinement of parallel algorithms
- Process simulation and refinement
- A theory for the composition of concurrent processes
- Game models for open systems
- Title not available (Why is that?)
- Behavioural semantics for asynchronous components
- Compositional equivalences based on open pNets
- How to verify and exploit a refinement of component-based systems
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)