Pages that link to "Item:Q1050111"

The following pages link to Calculi for synchrony and asynchrony (Q1050111):

Displaying 40 items.

• Compositional Reasoning for Multi-modal Logics (Q3455830) (← links)
• A Notion of Glue Expressiveness for Component-Based Systems (Q3541041) (← links)
• $\mathcal{CL}$ : An Action-Based Logic for Reasoning about Contracts (Q3638294) (← links)
• Algebra and logic for resource-based systems modelling (Q3643362) (← links)
• Fairness and regularity for SCCS processes (Q3816967) (← links)
• Formal specification and analysis of production systems (Q4415996) (← links)
• Broadcast Calculus Interpreted in CCS upto Bisimulation (Q4917085) (← links)
• A fully parallel calculus of synchronizing processes (Q5044776) (← links)
• Deciding bisimulation equivalences for a class of non-finite-state programs (Q5096175) (← links)
• An efficiency preorder for processes (Q5096216) (← links)
• A final coalgebra theorem (Q5096269) (← links)
• An algebraic framework for developing and maintaining real-time systems (Q5096395) (← links)
• A Calculus of Countable Broadcasting Systems (Q5096402) (← links)
• Counting the Cost in the Picalculus (Extended Abstract) (Q5166616) (← links)
• On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS (Q5170663) (← links)
• Behavioural abstraction in TCCS (Q5204347) (← links)
• Asynchronous communication of Petri Nets and the refinement of transitions (Q5204351) (← links)
• LANGUAGES FOR REACTIVE SPECIFICATIONS: SYNCHRONY VS ASYNCHRONY (Q5249041) (← links)
• A Theory Agenda for Component-Based Design (Q5256362) (← links)
• An Observational Theory for Mobile Ad Hoc Networks (Q5262943) (← links)
• Enhanced coalgebraic bisimulation (Q5361143) (← links)
• Abstraction of Clocks in Synchronous Data-Flow Systems (Q5502727) (← links)
• Non-deterministic structures of computation (Q5740658) (← links)
• On recursive operations over logic LTS (Q5740660) (← links)
• (Q5875399) (← links)
• A hierarchy of domains for real-time distributed computing (Q5887512) (← links)
• Termination, deadlock and divergence (Q5887521) (← links)
• The expressive power of delay operators in SCCS (Q5895328) (← links)
• A fully abstract denotational model for observational precongruence (Q5940916) (← links)
• A fully abstract denotational semantics for the calculus of higher-order communicating systems (Q5940933) (← links)
• Explicit substitutions for \(\pi\)-congruences (Q5958613) (← links)
• Non-regular iterators in process algebra (Q5958616) (← links)
• The expressive power of delay operators in SCCS (Q5966211) (← links)
• On continuous time agents (Q6116583) (← links)
• Abstraction Modulo Stability for Reverse Engineering (Q6487326) (← links)
• A fully abstract denotational model for observational precongruence (Q6560177) (← links)
• Specification structures and propositions-as-types for concurrency (Q6560388) (← links)
• Modal and temporal logics for processes (Q6560391) (← links)
• Monoidal streams for dataflow programming (Q6649486) (← links)
• Decomposing monolithic processes in a process algebra with multi-actions (Q6649542) (← links)