Processes with local and global liveness requirements

DOI10.1016/J.JLAP.2008.08.003zbMath1169.68032OpenAlexW2030862582MaRDI QIDQ1007234

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

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

livenessoperational semanticsprocess algebraconservative extensionquiescenceinequational 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)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Processes with infinite liveness requirements
• Specification-oriented semantics for communicating processes
• A general conservative extension theorem in process algebras with inequalities
• A brief history of process algebra
• Progress assumption in concurrent systems
• The origins of structural operational semantics
• TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING
• Proofs of Networks of Processes
• Proving Liveness Properties of Concurrent Programs
• Nets, Terms and Formulas
• Process Algebra

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