Processes with local and global liveness requirements
DOI10.1016/J.JLAP.2008.08.003zbMATH Open1169.68032OpenAlexW2030862582MaRDI QIDQ1007234FDOQ1007234
José Félix Costa, Hélia Guerra
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
Recommendations
process algebraquiescenceconservative extensionoperational semanticslivenessinequational proof system
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Process Algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Specification-oriented semantics for communicating processes
- Progress assumption in concurrent systems
- The origins of structural operational semantics
- Trace-oriented models of concurrency
- TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING
- Processes with infinite liveness requirements
- Proofs of Networks of Processes
- Title not available (Why is that?)
- Nets, Terms and Formulas
- A brief history of process algebra
- Proving Liveness Properties of Concurrent Programs
- A general conservative extension theorem in process algebras with inequalities
- Title not available (Why is that?)
Cited In (3)
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)
