Pages that link to "Item:Q1067408"

The following pages link to Algebra of communicating processes with abstraction (Q1067408):

Displaying 49 items.

• Composing models (Q2901220) (← links)
• Connection between logical and algebraic approaches to concurrent systems (Q3060196) (← links)
• Reactive Turing Machines (Q3088297) (← links)
• Process Algebra and Model Checking (Q3176390) (← links)
• A ground-complete axiomatisation of finite-state processes in a generic process algebra (Q3545273) (← links)
• A Framework for Automatically Checking Anonymity with μCRL (Q3608464) (← links)
• Modeling Routing Protocols in Adhoc Networks (Q3628490) (← links)
• Fair expressions and regular languages over lists (Q4348238) (← links)
• Network algebra for asynchronous dataflow^∗ (Q4375420) (← links)
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674) (← links)
• The Two-Phase Commitment Protocol in an Extended π-Calculus (Q4917025) (← links)
• Rewrite Systems with Constraints (Q4917083) (← links)
• (Q5009706) (← links)
• A technique for specifying and refining TCSP processes by using guards and liveness conditions (Q5044746) (← links)
• Testability of a communicating system through an environment (Q5044760) (← links)
• Property preserving abstractions under parallel composition (Q5044770) (← links)
• An algorithm for distributive unification (Q5055867) (← links)
• Discrete time process algebra with abstraction (Q5055876) (← links)
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
• Convenient category of processes and simulations I: Modulo strong bisimilarity (Q5057463) (← links)
• Graph-grammar semantics of a higher-order programming language for distributed systems (Q5096275) (← links)
• πI: A symmetric calculus based on internal mobility (Q5096730) (← links)
• Generating diagnostic information for behavioral preorders (Q5137006) (← links)
• Modularity and Implementation of Mathematical Operational Semantics (Q5166622) (← links)
• Hard Life with Weak Binders (Q5170666) (← links)
• Interleaving Strategies (Q5200118) (← links)
• A Generic Process Algebra (Q5262952) (← links)
• A Family of Resource-Bound Real-Time Process Algebras (Q5262969) (← links)
• Algebraic Specification of Communication Protocols (Q5302140) (← links)
• Equivalence relations for modular performance evaluation in dtsPBC (Q5740349) (← links)
• Model checking usage policies (Q5740636) (← links)
• Termination, deadlock and divergence (Q5887521) (← links)
• Axiomatising real-timed processes (Q5890048) (← links)
• Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5892174) (← links)
• Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
• Decidability of model checking with the temporal logic EF (Q5941100) (← links)
• Non-regular iterators in process algebra (Q5958616) (← links)
• Basic process algebra with deadlocking states (Q5958771) (← links)
• Infinite results (Q6104374) (← links)
• On relating concurrency and nondeterminism (Q6116582) (← links)
• On continuous time agents (Q6116583) (← links)
• Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)
• Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction (Q6163879) (← links)
• Assume-guarantee reasoning for additive hybrid behaviour (Q6535836) (← links)
• Decidability results in automata and process theory (Q6560390) (← links)
• Performance preserving equivalence for stochastic process algebra dtsdPBC (Q6587404) (← links)
• Store locally, prove globally (Q6605367) (← links)
• A case in point: verification and testing of a EULYNX interface (Q6610254) (← links)