The following pages link to (Q3857704):
Displaying 50 items.
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- A fixed point approach to parallel discrete event simulation (Q758225) (← links)
- Nivat's processing systems: decision problems related to protection and synchronization (Q761796) (← links)
- Some remarks on non-algebraic adherences (Q786543) (← links)
- Separately continuous algebras (Q790140) (← links)
- Infinitary tree languages recognized by \(\omega\)-automata (Q794179) (← links)
- Infinite arrays and controlled deterministic table 0L array systems (Q797993) (← links)
- Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
- Contractions in comparing concurrency semantics (Q919834) (← links)
- Topology on words (Q1019711) (← links)
- On infinite computations in denotational semantics (Q1051414) (← links)
- Automates boustrophédon et mots infinis (Q1061503) (← links)
- On infinite words obtained by selective substitution grammars (Q1066676) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- The greatest fixed-points and rational omega-tree languages (Q1082091) (← links)
- Infinite streams and finite observations in the semantics of uniform concurrency (Q1091800) (← links)
- On some structural properties of a subclass of \(\infty\)-regular languages (Q1098324) (← links)
- Subword topology (Q1099638) (← links)
- On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
- Applications of compactness in the Smyth powerdomain of streams (Q1107301) (← links)
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency (Q1107303) (← links)
- Designing equivalent semantic models for process creation (Q1107305) (← links)
- A timed model for communicating sequential processes (Q1109561) (← links)
- Semantics of production systems (Q1110314) (← links)
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1114959) (← links)
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1123253) (← links)
- Terminal metric spaces of finitely branching and image finite linear processes (Q1128985) (← links)
- On infinite words obtained by iterating morphisms (Q1168084) (← links)
- A continuous semantics for unbounded nondeterminism (Q1171370) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Four domains for concurrency (Q1179700) (← links)
- Contraction algebras and unification of (infinite) terms (Q1185240) (← links)
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\) (Q1318721) (← links)
- Infinite Lyndon words (Q1322121) (← links)
- Linear time and branching time semantics for recursion with merge (Q1348527) (← links)
- Trees and semantics (Q1391740) (← links)
- Limiting semantics of numerical programs (Q1392276) (← links)
- A short scientific biography of Maurice Nivat (Q1605477) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- Infinite arrays and infinite computations (Q1838321) (← links)
- De Bakker-Zucker processes revisited (Q1887161) (← links)
- Whither semantics? (Q2286732) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- Line Languages (Q3438916) (← links)
- (Q3704795) (← links)
- Continuous monoids and yields of infinite trees (Q3743357) (← links)
- (Q4499206) (← links)
- Generalizing finiteness conditions of labelled transition systems (Q4632441) (← links)
- A hierarchy of domains for real-time distributed computing (Q5887512) (← links)
- Metric semantics for true concurrent real time (Q5940931) (← links)
