The following pages link to (Q4248252):
Displaying 50 items.
- Biological transactions for quantitative models (Q2864196) (← links)
- A simple calculus for proteins and cells (Q2864202) (← links)
- Encoding catalytic P systems in {\(\pi\)}\@ (Q2864204) (← links)
- A chart semantics for the pi-calculus (Q2864369) (← links)
- Matching systems for concurrent calculi (Q2864374) (← links)
- Secured information flow for asynchronous sequential processes (Q2864389) (← links)
- Interaction in time and space (Q2864506) (← links)
- Active evaluation contexts for reaction semantics (Q2866316) (← links)
- Coordination models Orc and Reo compared (Q2866319) (← links)
- Prototyping concurrent systems with agents and artifacts: framework and core calculus (Q2866321) (← links)
- Automated synthesis of enforcing mechanisms for security properties in a timed setting (Q2866731) (← links)
- Probabilistic \(\pi\)-calculus and event structures (Q2870289) (← links)
- A static analysis for beta-binders (Q2870298) (← links)
- A spatial extension to the \(\pi\) calculus (Q2870304) (← links)
- Signal transduction pathways as concurrent reactive systems: a modeling and simulation approach using LSCs and the Play-Engine (Q2870306) (← links)
- Efficient stochastic simulation of biological systems with multiple variable volumes (Q2870307) (← links)
- A well-behaved LTS for the pi-calculus (abstract) (Q2871826) (← links)
- On projecting processes into session types (Q2883119) (← links)
- Coalgebraic Symbolic Semantics (Q2888486) (← links)
- \(\pi\)-calculi (Q2906943) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- Weak Bisimulation as a Congruence in MSOS (Q2945724) (← links)
- A General Theory of Barbs, Contexts, and Labels (Q2946747) (← links)
- Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions (Q2955779) (← links)
- Information flow safety in multiparty sessions (Q2971077) (← links)
- A New Roadmap for Linking Theories of Programming (Q2971173) (← links)
- Linked data privacy (Q2973246) (← links)
- Comparative Analysis of Statistical Model Checking Tools (Q2975907) (← links)
- Topological Construction of Parameterized Bisimulation Limit (Q2994479) (← links)
- A Formal Environment Model for Multi-Agent Systems (Q2999310) (← links)
- A Testing Theory for a Higher-Order Cryptographic Language (Q3000588) (← links)
- Types for Role-Based Access Control of Dynamic Web Data (Q3003511) (← links)
- A Petri Net Interpretation of Open Reconfigurable Systems (Q3011889) (← links)
- FSP and FLTL framework for specification and verification of middle-agents (Q3016270) (← links)
- On GS-Monoidal Theories for Graphs with Nesting (Q3059707) (← links)
- <font>P</font> SYSTEMS AND TOPOLOGY: SOME SUGGESTIONS FOR RESEARCH (Q3076611) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- Cryptographic Verification by Typing for a Sample Protocol Implementation (Q3092172) (← links)
- PiStache: Implementing π-Calculus in Scala (Q3098054) (← links)
- Modeling for Verification (Q3176361) (← links)
- The Applied Pi Calculus (Q3177888) (← links)
- Robin Milner's Work on Concurrency (Q3178242) (← links)
- Static Trace-Based Deadlock Analysis for Synchronous Mini-Go (Q3179284) (← links)
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
- Mobile Processes and Termination (Q3184750) (← links)
- Rigid Families for the Reversible $$\pi $$ -Calculus (Q3186581) (← links)
- PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS (Q3224882) (← links)
- Employing Costs in Multiagent Systems with Timed Migration and Timed Communication (Q3297779) (← links)
- (Q3384912) (← links)
- (Q3385647) (← links)
