The following pages link to Process Algebra (Q3999164):
Displayed 50 items.
- The expressive power of the shuffle product (Q710739) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- Qualitative reachability in stochastic BPA games (Q719240) (← links)
- Cones and foci: A mechanical framework for protocol verification (Q853730) (← links)
- Duplication of constants in process algebra (Q864505) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Model checking a cache coherence protocol of a Java DSM implementation (Q864512) (← links)
- Fair testing (Q865623) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Theory of interaction (Q896903) (← links)
- A quantitative study of pure parallel processes (Q907263) (← links)
- Parametric synchronizations in mobile nominal calculi (Q935464) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Relating fair testing and accordance for service replaceability (Q974133) (← links)
- A precongruence format for should testing preorder (Q974134) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- An algebra of hybrid systems (Q1001892) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- Processes with local and global liveness requirements (Q1007234) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
- Shuffle on trajectories: Syntactic constraints (Q1128661) (← links)
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule (Q1183608) (← links)
- Petri net semantics of priority systems (Q1190490) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- Operational and denotational semantics for the box algebra (Q1274445) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- A decision algorithm for distributive unification (Q1275018) (← links)
- A behavioural theory of first-order CML (Q1285654) (← links)
- Real space process algebra (Q1329194) (← links)
- Process algebra with guards: Combining hoare logic with process algebra (Q1329197) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- On sequential composition, action prefixes and process prefix (Q1333405) (← links)
- Bisimulation is two-way simulation (Q1342255) (← links)
- Focus points and convergent process operators: A proof strategy for protocol verification (Q1349249) (← links)
- Branching bisimilarity is an equivalence indeed! (Q1350620) (← links)
- Actors, actions, and initiative in normative system specification (Q1353968) (← links)
- Formalizing process algebraic verifications in the calculus of constructions (Q1355748) (← links)
- Full abstraction and recursion (Q1365671) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- The algebra of communicating processes with empty process (Q1391788) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- Process algebra with propositional signals (Q1391792) (← links)
- Process algebra with language matching (Q1391794) (← links)