Pages that link to "Item:Q3765233"
From MaRDI portal
The following pages link to A Theory of Communicating Sequential Processes (Q3765233):
Displaying 50 items.
- Kleene's three-valued logic and process algebra (Q293327) (← links)
- Developments in concurrent Kleene algebra (Q299202) (← links)
- Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
- Structural operational semantics for stochastic and weighted transition systems (Q383372) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- An algebraic theory of interface automata (Q402131) (← links)
- Specifying termination in CSP (Q407510) (← links)
- Trace- and failure-based semantics for responsiveness (Q478516) (← links)
- Reversible session-based pi-calculus (Q492908) (← links)
- An algebraic theory for web service contracts (Q493534) (← links)
- Unguardedness mostly means many solutions (Q549175) (← links)
- On cool congruence formats for weak bisimulations (Q549196) (← links)
- Safe reasoning with logic LTS (Q549200) (← links)
- 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)
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← 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)
- Specification completion for IOCO (Q763529) (← links)
- Port automata and the algebra of concurrent porcesses (Q791319) (← 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)
- Revisiting sequential composition in process calculi (Q890611) (← 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)
- CSP is a retract of CCS (Q960852) (← links)
- Combinatorics of labelling in higher-dimensional automata (Q960860) (← links)
- Relating fair testing and accordance for service replaceability (Q974133) (← links)
- Ready to preorder: the case of weak process semantics (Q975539) (← links)
- Ready simulation for concurrency: it's logical! (Q988555) (← links)
