Timewise refinement for communicating processes

DOI10.1016/S0167-6423(96)00016-0zbMATH Open0867.68051OpenAlexW1980157037MaRDI QIDQ676846FDOQ676846

Authors: S. A. Schneider 

Publication date: 7 August 1997

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6423(96)00016-0

Recommendations

• Timewise refinement for communicating processes
• A refinement-based process algebra for timed automata
• Factorizing proofs in timed CSP
• Specification of communicating processes: temporal logic versus refusals-based refinement
• Specification and Proof in Real Time CSP

zbMATH Keywords

timewise refinement

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (16)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A hierarchy of domains for real-time distributed computing
• Factorizing proofs in timed CSP
• Translating between models of concurrency
• Modelling temporal behaviour in complex systems with Timebands
• Fully abstract models and refinements as tools to compare agents in timed coordination languages
• A refinement-based process algebra for timed automata
• A technique for specifying and refining TCSP processes by using guards and liveness conditions
• Efficient Timing of Communication in Multiperiod Agencies
• Specification of communicating processes: temporal logic versus refusals-based refinement
• Title not available (Why is that?)
• Refinements and Abstractions of Signal-Event (Timed) Languages
• Timewise refinement for communicating processes
• Progress-preserving refinements of CTA
• Title not available (Why is that?)

This page was built for publication: Timewise refinement for communicating processes

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