Pages that link to "Item:Q4302821"
From MaRDI portal
The following pages link to Termination, deadlock, and divergence (Q4302821):
Displayed 34 items.
- A characterization of finitary bisimulation (Q287256) (← links)
- Specifying termination in CSP (Q407510) (← links)
- Refinement of actions in event structures and causal trees (Q688717) (← links)
- Duplication of constants in process algebra (Q864505) (← links)
- Theory of interaction (Q896903) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- Semantics and expressiveness of ordered SOS (Q1012119) (← links)
- A CSP model with flexible parallel termination semantics (Q1037248) (← links)
- A semantic theory for value-passing processes based on the late approach (Q1398368) (← links)
- Predicate liftings and functor presentations in coalgebraic expression languages (Q1798785) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Axiomatizing GSOS with termination (Q1878716) (← links)
- Concurrent testing of processes (Q1902297) (← links)
- On hierarchically developing reactive systems (Q1959436) (← links)
- Counting nondeterministic computations (Q2055958) (← links)
- When are prime formulae characteristic? (Q2422016) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- Axiomatising divergence (Q2581532) (← links)
- Structural Operational Semantics with First-Order Logic (Q2810690) (← links)
- A Congruence Rule Format with Universal Quantification (Q2871833) (← links)
- Characteristic formulae for fixed-point semantics: a general framework (Q2883115) (← links)
- Equational Theories of Abnormal Termination Based on Kleene Algebra (Q2988362) (← links)
- Connection between logical and algebraic approaches to concurrent systems (Q3060196) (← links)
- Axiomatizing Weak Ready Simulation Semantics over BCCSP (Q3105742) (← links)
- Contracts for Mobile Processes (Q3184675) (← links)
- Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination (Q4917024) (← links)
- (Q5014795) (← links)
- A completeness theorem for nondeterministic Kleene algebras (Q5096912) (← links)
- Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)
- Non-deterministic structures of computation (Q5740658) (← links)
- Fair subtyping for multi-party session types (Q5741567) (← links)
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity (Q5875352) (← links)
- A fully abstract denotational model for observational precongruence (Q5940916) (← links)