Pages that link to "Item:Q1090103"
From MaRDI portal
The following pages link to On the consistency of Koomen's fair abstraction rule (Q1090103):
Displayed 43 items.
- Reactive Turing machines (Q393091) (← links)
- An algebra of behavioural types (Q418153) (← links)
- Unguardedness mostly means many solutions (Q549175) (← links)
- Fixed point equations with parameters in the projective model (Q580971) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Cones and foci: A mechanical framework for protocol verification (Q853730) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Issues in the design of a parallel object-oriented language (Q909434) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- Global renaming operators in concrete process algebra (Q1106660) (← links)
- Processes and formalisms for unbounded choice (Q1193892) (← links)
- A complete axiomatisation for observational congruence of finite-state behaviours (Q1263984) (← links)
- Context-free event domains are recognizable (Q1286370) (← links)
- Recursion induction for real-time processes (Q1329195) (← links)
- The algebra of communicating processes with empty process (Q1391788) (← links)
- Equivalence of recursive specifications in process algebra (Q1607118) (← links)
- Quantum process algebra with priorities (Q1700843) (← links)
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation (Q1785863) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Reconciling real and stochastic time: the need for probabilistic refinement (Q1941867) (← links)
- An axiomatization for quantum processes to unifying quantum and classical computing (Q2010952) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations (Q2182663) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Computable processes and bisimulation equivalence (Q2365394) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- Splitting bisimulations and retrospective conditions (Q2500474) (← links)
- Real time process algebra (Q2640341) (← links)
- Parallel Processes with Implicit Computational Capital (Q2870191) (← links)
- Expressiveness of Process Algebras (Q2870198) (← links)
- Modal logic and the approximation induction principle (Q2883116) (← links)
- Reactive Turing Machines (Q3088297) (← links)
- A Context-Free Process as a Pushdown Automaton (Q3541013) (← links)
- Turing Machines, Transition Systems, and Interaction (Q4917087) (← links)
- Context-free event domains are recognizable (Q5096387) (← links)
- On Specifying Timeouts (Q5262963) (← links)
- Extending Timed Process Algebra with Discrete Stochastic Time (Q5505429) (← links)
- Non-deterministic structures of computation (Q5740658) (← links)
- (Q5856418) (← links)
- Non-regular iterators in process algebra (Q5958616) (← links)
- Axiomatizing flat iteration (Q6044120) (← links)