The following pages link to (Q4248252):
Displaying 50 items.
- A monotone framework for CCS (Q1749243) (← links)
- Secrecy and group creation (Q1763430) (← links)
- Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
- A coordination approach to mobile components (Q1770368) (← links)
- Locating reaction with 2-categories (Q1770420) (← links)
- A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Process algebra for hybrid systems (Q1781998) (← links)
- Bestow and atomic: concurrent programming using isolation, delegation and grouping (Q1785860) (← links)
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences (Q1794961) (← links)
- Molecular interaction. (Q1853559) (← links)
- On the expressiveness of choice quantification (Q1874242) (← links)
- A theory of bisimulation for a fragment of concurrent ML with local names (Q1882896) (← links)
- Modelling biochemical pathways through enhanced \(\pi\)-calculus (Q1884867) (← links)
- BioAmbients: an abstraction for biological compartments (Q1884869) (← links)
- A spatial logic for concurrency. I (Q1887152) (← links)
- A system for compositional verification of asynchronous objects (Q1951610) (← links)
- Denotational semantics of channel mobility in UTP-CSP (Q1982650) (← links)
- Reversible computation in nature inspired rule-based systems (Q1982978) (← links)
- Modeling ontology evolution via pi-calculus (Q1991883) (← links)
- Realisability of pomsets (Q2011200) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Is there any real substance to the claims for a ``new computationalism''? (Q2011631) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Matching logic explained (Q2035650) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- \( \pi\) with leftovers: a mechanisation in Agda (Q2117018) (← links)
- The combined use of the web ontology language (OWL) and abstract state machines (ASM) for the definition of a specification language for business processes (Q2117607) (← links)
- Nominal unification with letrec and environment-variables (Q2119105) (← links)
- SMT-based generation of symbolic automata (Q2182674) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- The \texttt{link}-calculus for open multiparty interactions (Q2216110) (← links)
- Correct audit logging in concurrent systems (Q2229154) (← links)
- Limited approximate bisimulations and the corresponding rough approximations (Q2237122) (← links)
- A network-conscious \(\pi\)-calculus and its coalgebraic semantics (Q2253186) (← links)
- Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
- Stochastic biological modelling in the presence of multiple compartments (Q2271443) (← links)
- An intermediate language for the stochastic simulation of biological systems (Q2271445) (← links)
- A control flow analysis for Beta-binders with and without static compartments (Q2271446) (← links)
- A calculus of branching processes (Q2286743) (← links)
- A mathematical modelling for workflows (Q2299993) (← links)
- Non decomposable connectives of linear logic (Q2326414) (← links)
- Interactive verification of architectural design patterns in FACTum (Q2335950) (← links)
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus (Q2343135) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- A structural transformation from p-\(\pi\) to MSVL (Q2354315) (← links)
- Continuity controlled hybrid automata (Q2368692) (← links)
- Similarity between preferential models (Q2368981) (← links)
- What is a free name in a process algebra? (Q2379969) (← links)
