Pages that link to "Item:Q3766826"
From MaRDI portal
The following pages link to Algebraic laws for nondeterminism and concurrency (Q3766826):
Displayed 50 items.
- Modal logics for communicating systems (Q578896) (← links)
- Refusal testing (Q580961) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Modelling causality via action dependencies in branching time semantics (Q671596) (← links)
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours (Q672231) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- Studying equivalences of transition systems with algebraic tools (Q673968) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- Translations between modal logics of reactive systems (Q674003) (← links)
- A brief history of Timed CSP (Q674191) (← links)
- Graphical versus logical specifications (Q685358) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Bisimulation and action refinement (Q685407) (← links)
- Modal logics for mobile processes (Q685408) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Refinement of actions in event structures and causal trees (Q688717) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- A logical characterization of observation equivalence (Q802306) (← links)
- Priorities in process algebras (Q802881) (← links)
- Equivalence notions and model minimization in Markov decision processes (Q814474) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Combining data type and recursive process specifications using projection algebras (Q910188) (← links)
- A refinement calculus for specifications in Hennessy-Milner logic with recursion (Q911261) (← links)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- A rewriting strategy to verify observational congruence (Q915472) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Specification of communicating processes: temporal logic versus refusals-based refinement (Q931435) (← links)
- On minimal coalgebras (Q934670) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- Non-deterministic data types: Models and implementations (Q1058286) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- A logic for the specification and proof of regular controllable processes of CCS (Q1080653) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- Bisimulations and abstraction homomorphisms (Q1089791) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- Type theory and concurrency (Q1124322) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- A fixpoint approach to finite delay and fairness (Q1129259) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Bisimulation through probabilistic testing (Q1175940) (← links)
- The equivalence in the DCP model (Q1177152) (← links)
- Partial specifications and compositional verification (Q1177172) (← links)
- Local model checking in the modal mu-calculus (Q1177939) (← links)