Pages that link to "Item:Q1050111"
From MaRDI portal
The following pages link to Calculi for synchrony and asynchrony (Q1050111):
Displayed 50 items.
- Modal logics for communicating systems (Q578896) (← links)
- An intensional characterization of the largest bisimulation (Q580963) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- Structure of concurrency (Q685384) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Bisimulation and action refinement (Q685407) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Algorithms for task allocation in ants. (A study of temporal polyethism: Theory) (Q688415) (← links)
- Non-well-founded sets modeled as ideal fixed points (Q757360) (← links)
- On Meije and SCCS: Infinite sum operators vs. non-guarded definitions (Q789888) (← links)
- Algèbre de processus et synchronisation (Q789894) (← links)
- A fair calculus of communicating systems (Q793508) (← links)
- Parametric channels via label expressions in CCS (Q795500) (← links)
- A logical characterization of observation equivalence (Q802306) (← links)
- Priorities in process algebras (Q802881) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- A calculus and logic of resources and processes (Q855007) (← links)
- Fair testing (Q865623) (← links)
- A refinement calculus for specifications in Hennessy-Milner logic with recursion (Q911261) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) (Q914365) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- Interpreting one concurrent calculus in another (Q915484) (← links)
- Derivation of efficient parallel programs: An example from genetic sequence analysis (Q916411) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- Petri nets are monoids (Q922720) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- An observational theory for mobile ad hoc networks (full version) (Q1012124) (← links)
- A completed hierarchy of true concurrent equivalences (Q1029093) (← links)
- Axiomatising finite delay operators (Q1055190) (← links)
- Models of programs and processes (Q1056219) (← links)
- A proof-theoretic characterization of observational equivalence (Q1060006) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence) (Q1061481) (← links)
- A formal semantics for concurrent systems with a priority relation (Q1074338) (← links)
- Higher-level synchronising devices in Meije-SCCS (Q1079949) (← links)
- Algebraic calculi of processes and net expressions (Q1084852) (← links)
- About fair asynchrony (Q1085603) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- Bisimulations and abstraction homomorphisms (Q1089791) (← links)
- Modeling concurrency with partial orders (Q1091134) (← links)
- Petri nets, algebras, morphisms, and compositionality (Q1091145) (← links)
- Infinite streams and finite observations in the semantics of uniform concurrency (Q1091800) (← links)
- The semantics and complexity of parallel programs for vector computations. I: A case study using Ada (Q1110310) (← links)
- A distributed operational semantics of CCS based on condition/event systems (Q1110338) (← links)