More Relational Concurrent Refinement: Traces and Partial Relations

DOI10.1016/j.entcs.2008.06.012zbMath1283.68239OpenAlexW1994784021MaRDI QIDQ5403469

John Derrick, Eerke A. Boiten

Publication date: 26 March 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.06.012

zbMATH Keywords

simulationsZdata refinementprocess algebraic refinement preorders

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Relational Concurrent Refinement: Automata ⋮ Modelling Divergence in Relational Concurrent Refinement ⋮ Relational concurrent refinement. III: Traces, partial relations and automata

Uses Software

• LOTOS
• Z

Cites Work

• Prespecification in data refinement
• Incompleteness of relational simulations in the blocking paradigm
• Relational concurrent refinement
• Data refinement and singleton failures refinement are not equivalent
• Relational concurrent refinement. II: Internal operations and outputs
• Extensional equivalences for transition systems
• A singleton failures semantics for communicating sequential processes
• Data Refinement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: More Relational Concurrent Refinement: Traces and Partial Relations