Pages that link to "Item:Q789894"
From MaRDI portal
The following pages link to Algèbre de processus et synchronisation (Q789894):
Displaying 39 items.
- A non-SOS operational semantics for a process algebra (Q293405) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- On Meije and SCCS: Infinite sum operators vs. non-guarded definitions (Q789888) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Higher-level synchronising devices in Meije-SCCS (Q1079949) (← links)
- Algebraic calculi of processes and net expressions (Q1084852) (← links)
- A distributed operational semantics of CCS based on condition/event systems (Q1110338) (← links)
- Partial ordering models for concurrency can be defined operationally (Q1111013) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
- Fairness, distances and degrees (Q1193862) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- An algebra for process creation (Q1203719) (← links)
- Enriched categorical semantics for distributed calculi (Q1208210) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- A complete modal proof system for HAL: the Herbrand agent language (Q1311969) (← links)
- Process algebra with guards: Combining hoare logic with process algebra (Q1329197) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- Process algebra with propositional signals (Q1391792) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- A functional model for describing and reasoning about time behaviour of computing systems (Q2265792) (← links)
- On constructibility and unconstructibility of LTS operators from other LTS operators (Q2340256) (← links)
- Computable processes and bisimulation equivalence (Q2365394) (← links)
- A synchronous \(\pi\)-calculus (Q2381508) (← links)
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) (Q2638769) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- Broadcast Psi-calculi with an Application to Wireless Protocols (Q3095234) (← links)
- (Q3385651) (← links)
- An algebraic framework for developing and maintaining real-time systems (Q5096395) (← links)
- Proved trees (Q5204353) (← links)
