Pages that link to "Item:Q1061481"
From MaRDI portal
The following pages link to Determinacy \(\to\) (observation equivalence \(=\) trace equivalence) (Q1061481):
Displaying 22 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- On the expressive power of behavioral profiles (Q315288) (← links)
- Deciding equivalence-based properties using constraint solving (Q391121) (← links)
- Rule formats for determinism and idempotence (Q433348) (← links)
- Are deterministic descriptions and indeterministic descriptions observationally equivalent? (Q652770) (← links)
- On the observational equivalence of continuous-time deterministic and indeterministic descriptions (Q693104) (← links)
- Trace, failure and testing equivalences for communicating processes (Q1104076) (← links)
- Global renaming operators in concrete process algebra (Q1106660) (← links)
- Stable families of behavioural equivalences (Q1119013) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- Impossible futures and determinism (Q1607117) (← links)
- Conditions of contracts for separating responsibilities in heterogeneous systems (Q1742989) (← links)
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) (Q2638769) (← links)
- Characteristic formulae for timed autoamta (Q2729632) (← links)
- Multiple Viewpoint Contract-Based Specification and Design (Q3602999) (← links)
- Deducing causal relationships in CCS (Q3975937) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- Trace-Relating Compiler Correctness and Secure Compilation (Q5041085) (← links)
- Asynchronous communication of Petri Nets and the refinement of transitions (Q5204351) (← links)
- Confluence Thanks to Extensional Determinism (Q5262976) (← links)
- Fully Abstract and Robust Compilation (Q6488145) (← links)
