The expressiveness of CSP with priority (Q2520703): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Structural operational semantics for weak bisimulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precongruence formats for decorated trace semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation can't be traced / rank
 
Normal rank
Property / cites work
 
Property / cites work: The meaning of negative premises in transition system specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: FDR3 — A Modern Refinement Checker for CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Aspects of Computing – ICTAC 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic and prioritized models of timed CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressiveness of CSP with priority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slow Abstraction via Priority / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of CSP refinement / rank
 
Normal rank

Revision as of 03:15, 13 July 2024

scientific article
Language Label Description Also known as
English
The expressiveness of CSP with priority
scientific article

    Statements

    Identifiers