The following pages link to W. J. Fokkink (Q513184):
Displaying 50 items.
- (Q287055) (redirect page) (← links)
- Unification for infinite sets of equations between finite terms (Q287056) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- Maximally permissive controlled system synthesis for non-determinism and modal logic (Q513185) (← links)
- Verification of mobile ad hoc networks: an algebraic approach (Q549194) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- An analytical model of information dissemination for a gossip-based protocol (Q838492) (← links)
- Cones and foci: A mechanical framework for protocol verification (Q853730) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- Model checking a cache coherence protocol of a Java DSM implementation (Q864512) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- Ready to preorder: the case of weak process semantics (Q975539) (← links)
- Computing with actions and communications (Q998092) (← links)
- A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- A complete equational axiomatization for prefix iteration (Q1342264) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Structural operational semantics and bounded nondeterminism (Q1424357) (← links)
- (Q1575653) (redirect page) (← links)
- Language preorder as a precongruence (Q1575654) (← links)
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (Q1680509) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules (Q1917088) (← links)
- Axiomatizing prefix iteration with silent steps (Q1923086) (← links)
- Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
- Rooted branching bisimulation as a congruence (Q1975965) (← links)
- Detecting useless transitions in pushdown automata (Q2042722) (← links)
- Compositional coordinator synthesis of extended finite automata (Q2058570) (← links)
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations (Q2182663) (← links)
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
- Model checking mobile ad hoc networks (Q2363813) (← links)
- Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
- Modelling distributed systems. (Q2382306) (← links)
- An effective axiomatization for real time ACP (Q2508332) (← links)
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal (Q2568979) (← links)
- Verification of a sliding window protocol in \(\mu\) CRL and PVS (Q2576590) (← links)
- Which two-sorted algebras of Booleans and naturals have a finite basis? (Q2577704) (← links)
- Algebra of timed frames (Q2710790) (← links)
- (Q2754192) (← links)
- (Q2760240) (← links)
- (Q2760242) (← links)
- (Q2762495) (← links)
- (Q2848414) (← links)
- (Q2851076) (← links)
- (Q2852097) (← links)
- (Q2865941) (← links)
- Modal logic and the approximation induction principle (Q2883116) (← links)
- Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics (Q2912692) (← links)
