Processes with local and global liveness requirements

DOI10.1016/J.JLAP.2008.08.003zbMATH Open1169.68032OpenAlexW2030862582MaRDI QIDQ1007234FDOQ1007234

Authors Hélia Guerra, José Félix Costa 

Publication date 20 March 2009

Published in The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlap.2008.08.003

zbMATH Keywords

process algebraquiescenceconservative extensionoperational semanticslivenessinequational proof system

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Processes with infinite liveness requirements
• Progress assumption in concurrent systems
• From liveness to promptness
• From Liveness to Promptness
• On the refinement of liveness properties of distributed systems

Cites work

• scientific article; zbMATH DE number 3888893 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 107999 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1860682 (Why is no real title available?)
• A brief history of process algebra
• A general conservative extension theorem in process algebras with inequalities
• Nets, Terms and Formulas
• Process Algebra
• Processes with infinite liveness requirements
• Progress assumption in concurrent systems
• Proofs of Networks of Processes
• Proving Liveness Properties of Concurrent Programs
• Specification-oriented semantics for communicating processes
• TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING
• The origins of structural operational semantics
• Trace-oriented models of concurrency

Cited in

(3)

• Safe Reasoning with Logic LTS
• Processes with infinite liveness requirements
• Safe reasoning with logic LTS

This page was built for publication: Processes with local and global liveness requirements

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