The following pages link to (Q4727412):
Displaying 50 items.
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- QoS negotiation in service composition (Q615894) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Algorithms for task allocation in ants. (A study of temporal polyethism: Theory) (Q688415) (← links)
- Priorities in process algebras (Q802881) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- On the expressibility of priority (Q975534) (← links)
- Semantics and expressiveness of ordered SOS (Q1012119) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- The compression structure of a process (Q1044743) (← links)
- On the computational power of BlenX (Q1044845) (← links)
- On the consistency of Koomen's fair abstraction rule (Q1090103) (← links)
- An incompleteness result in process algebra (Q1113665) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems (Q1271643) (← links)
- A process algebra with distributed priorities (Q1276244) (← links)
- Real space process algebra (Q1329194) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- Processes with probabilities, priority and time (Q1343865) (← links)
- A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
- The algebra of communicating processes with empty process (Q1391788) (← links)
- Notes on the methodology of CCS and CSP (Q1391789) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Process algebra with language matching (Q1391794) (← links)
- Language preorder as a precongruence (Q1575654) (← links)
- Rule formats for distributivity (Q1758150) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Priority as extremal probability (Q1816921) (← links)
- An algebraic framework for urgency (Q1854390) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- Axiomatizing GSOS with termination (Q1878716) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Rooted branching bisimulation as a congruence (Q1975965) (← links)
- A modular framework for verifying versatile distributed systems (Q2011199) (← links)
- On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
- Priority and abstraction in process algebra (Q2381506) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- CCS with priority guards (Q2474050) (← links)
- Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
- Event structures for interrupt process algebras (Q2847408) (← links)
- Expressing priorities and external probabilities in process algebra via mixed open/closed systems (Q2864370) (← links)
