Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Observation equivalence as a testing equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turning SOS rules into equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizing prefix iteration with silent steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real time process algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete time process algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4727412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process algebra with timing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural operational semantics for weak bisimulations / 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: Rooted branching bisimulation as a congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition system specifications with negative premises / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured operational semantics and bisimulation as a congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A process algebra for timed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal definition of time in LOTOS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing equivalences for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebra of timed processes, ATP: Theory and application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refusal testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A timed model for communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An operational semantics for timed CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-level synchronising devices in Meije-SCCS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite axiom systems for testing preorder and De Simone process languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered SOS process languages for branching and eager bisimulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation and divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733394 / rank
 
Normal rank

Latest revision as of 19:42, 6 June 2024

scientific article
Language Label Description Also known as
English
Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
scientific article

    Statements

    Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (English)
    0 references
    0 references
    0 references
    8 September 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers