Compositional equivalences based on open pNets

DOI10.1016/j.jlamp.2022.100842MaRDI QIDQ2683032

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

Publication date: 3 February 2023

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.10770

zbMATH Keywords

automatacompositionalitybisimulationsemantics

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• Transition system specifications with negative premises
• Higher-level synchronising devices in Meije-SCCS
• A context dependent equivalence between processes
• Statecharts: a visual formalism for complex systems
• A calculus of communicating systems
• Synchronized behaviours of processes and rational relations
• Structured operational semantics and bisimulation as a congruence
• Bisimulations for a calculus of broadcasting systems
• The meaning of negative premises in transition system specifications. II
• A structural approach to operational semantics
• Behavioural semantics for asynchronous components
• A semantic framework for open processes
• A Theory for the Composition of Concurrent Processes
• Bisimulation by Unification*
• A Complete Symbolic Bisimulation for Full Applied Pi Calculus
• Compositionality Through an Operational Semantics of Contexts
• Bisimulation can't be traced
• Bisimulations on Data Graphs
• Bisimilarity of Diagrams
• Symbolic Bisimulation for Quantum Processes
• CONCUR 2004 - Concurrency Theory
• Open Bisimulation for the Concurrent Constraint Pi-Calculus
• Symbolic Bisimulation for the Applied Pi Calculus
• Symbolic transition graph with assignment