Pages that link to "Item:Q1148667"
From MaRDI portal
The following pages link to A calculus of communicating systems (Q1148667):
Displayed 50 items.
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Prespecification in data refinement (Q578901) (← links)
- Refusal testing (Q580961) (← links)
- An intensional characterization of the largest bisimulation (Q580963) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- Fixed point equations with parameters in the projective model (Q580971) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Confluence for process verification (Q672042) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
- Late and early semantics coincide for testing (Q673146) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- Translations between modal logics of reactive systems (Q674003) (← links)
- Structure of concurrency (Q685384) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Modal logics for mobile processes (Q685408) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Refinement of actions in event structures and causal trees (Q688717) (← links)
- Communicating processes with value-passing and assignments (Q688827) (← links)
- Category theory for operational semantics (Q703525) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Bisimulation and divergence (Q750163) (← links)
- An operational semantics for paragon: A design notation for parallel architectures (Q756433) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- Recursive process definitions with the state operator (Q758198) (← links)
- Receptive process theory (Q758200) (← links)
- A weakest precondition semantics for communicating processes (Q789174) (← links)
- Algèbre de processus et synchronisation (Q789894) (← links)
- Port automata and the algebra of concurrent porcesses (Q791319) (← links)
- A fair calculus of communicating systems (Q793508) (← links)
- Parametric channels via label expressions in CCS (Q795500) (← links)
- A linear-history semantics for languages for distributed programming (Q796298) (← links)
- A theory of bipolar synchronization scheme (Q799113) (← links)
- A logical characterization of observation equivalence (Q802306) (← links)
- Priorities in process algebras (Q802881) (← links)
- On guarded recursion (Q805246) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- Process algebra and constraint programming for modeling interactions in MAS (Q814899) (← links)
- A basic algebra of stateless connectors (Q860881) (← links)
- Duplication of constants in process algebra (Q864505) (← links)
- Fair testing (Q865623) (← links)
- Generating the syntactic and semantics graphs for a Markovian process algebra (Q879408) (← links)
- A criterion for atomicity revisited (Q884994) (← links)
- Combining data type and recursive process specifications using projection algebras (Q910188) (← links)
- Towards a theory of (self) applicative communicating processes: A short note (Q910234) (← links)
- A refinement calculus for specifications in Hennessy-Milner logic with recursion (Q911261) (← links)