Pages that link to "Item:Q3765233"
From MaRDI portal
The following pages link to A Theory of Communicating Sequential Processes (Q3765233):
Displayed 50 items.
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Refusal testing (Q580961) (← links)
- The pursuit of deadlock freedom (Q580970) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- A theory of processes with durational actions (Q674005) (← links)
- On the nature of events: another perspective in concurrency (Q674197) (← links)
- A stubborn attack on state explosion (Q685106) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Communicating processes with value-passing and assignments (Q688827) (← links)
- A note on the notation of recursion in process algebras (Q751295) (← links)
- Refinement, conformance and inheritance (Q751843) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- A linear-history semantics for languages for distributed programming (Q796298) (← links)
- Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
- Process algebra and constraint programming for modeling interactions in MAS (Q814899) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Duplication of constants in process algebra (Q864505) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Fair testing (Q865623) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- Process simulation and refinement (Q911322) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- A design method for embedded software systems (Q921962) (← links)
- Relational structures model of concurrency (Q934912) (← links)
- Calculi for synchrony and asynchrony (Q1050111) (← links)
- A more complete model of communicating processes (Q1050768) (← links)
- A complete inference system for a class of regular behaviours (Q1057072) (← links)
- On the suitability of trace semantics for modular proofs of communicating processes (Q1060004) (← links)
- A proof-theoretic characterization of observational equivalence (Q1060006) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence) (Q1061481) (← links)
- A logic for the specification and proof of regular controllable processes of CCS (Q1080653) (← links)
- About fair asynchrony (Q1085603) (← links)
- Denotational semantics of communicating sequential programs (Q1088402) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- Concurrent histories: a basis for observing distributed systems (Q1089787) (← links)
- Specification and top-down design of distributed systems (Q1089790) (← links)
- Infinite streams and finite observations in the semantics of uniform concurrency (Q1091800) (← links)
- Specification and verification of database dynamics (Q1092680) (← links)
- Communication in concurrent dynamic logic (Q1095653) (← links)
- On the analysis of cooperation and antagonism in networks of communicating processes (Q1098279) (← links)
- Verification of a class of self-timed computational networks (Q1102099) (← links)
- Trace, failure and testing equivalences for communicating processes (Q1104076) (← links)
- Global renaming operators in concrete process algebra (Q1106660) (← links)
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency (Q1107303) (← links)
- A timed model for communicating sequential processes (Q1109561) (← links)
- Partial ordering models for concurrency can be defined operationally (Q1111013) (← links)