The following pages link to (Q3657409):
Displaying 9 items.
- Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q1960528) (← links)
- A logical and graphical framework for reaction systems (Q2034775) (← links)
- A unified rule format for bounded nondeterminism in SOS with terms as labels (Q2403821) (← links)
- Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination (Q4917024) (← links)
- Revisiting Semantics of Interactions for Trace Validity Analysis (Q5039546) (← links)
- Read-write causality (Q5096915) (← links)
- Bounded stacks, bags and queues (Q6044112) (← links)
- Exploiting Modularity of SOS Semantics to Define Quantitative Extensions of Reaction Systems (Q6488369) (← links)