Pages that link to "Item:Q3766826"
From MaRDI portal
The following pages link to Algebraic laws for nondeterminism and concurrency (Q3766826):
Displayed 50 items.
- Adequacy-preserving transformations of COSY path programs (Q1185020) (← links)
- Observational structures and their logic (Q1190494) (← links)
- Finitary logics for some CCS observational bisimulations (Q1198052) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- Complete sets of axioms for finite basic LOTOS behavioural equivalences (Q1199556) (← links)
- A complete axiomatisation for observational congruence of finite-state behaviours (Q1263984) (← links)
- Modal languages and bounded fragments of predicate logic (Q1267082) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- A behavioural theory of first-order CML (Q1285654) (← links)
- A complete modal proof system for HAL: the Herbrand agent language (Q1311969) (← links)
- An efficiency preorder for processes (Q1323358) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Model checking for action-based logics (Q1326587) (← links)
- Assisting requirement formalization by means of natural language translation (Q1329090) (← links)
- A theory of processes with localities (Q1329198) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- Simple proof techniques for property preservation via simulation (Q1350106) (← links)
- On the operational semantics of nondeterminism and divergence (Q1350504) (← links)
- A \(\pi\)-calculus with explicit substitutions (Q1350998) (← links)
- An algebraic characterization of observational equivalence (Q1351804) (← links)
- Semantics for finite delay (Q1392281) (← links)
- Bisimulation congruence of \(\chi\)-calculus (Q1398380) (← links)
- An alternative formulation of operational conservativity with binding terms. (Q1400151) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Observational ultraproducts of polynomial coalgebras. (Q1408860) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Domain theory for concurrency (Q1434357) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Analysis of equivalence relations of event structures with continuous time (Q1592080) (← links)
- Impossible futures and determinism (Q1607117) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Weak and strong fairness in CCS (Q1822489) (← links)
- Bisimulation of automata (Q1822987) (← links)
- An algebraic characterization of transition system equivalences (Q1822989) (← links)
- Toward an infinitary logic of domains: Abramsky logic for transition systems (Q1854320) (← links)
- Inductive synthesis of recursive processes from logical properties (Q1854392) (← links)
- Corrigendum: ``A domain equation for bisimulation'' by S. Abramsky (Q1854414) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS (Q1878715) (← links)
- A spatial logic for concurrency. II (Q1881257) (← links)
- Tau laws for pi calculus (Q1884877) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Applicability of fair simulation (Q1886036) (← links)
- A spatial logic for concurrency. I (Q1887152) (← links)
- Logic of transition systems (Q1895974) (← links)
- Models of nondeterministic regular expressions (Q1970200) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)