Pages that link to "Item:Q3766826"
From MaRDI portal
The following pages link to Algebraic laws for nondeterminism and concurrency (Q3766826):
Displaying 50 items.
- Port automata and the algebra of concurrent porcesses (Q791319) (← 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)
- Synthesising correct concurrent runtime monitors (Q888412) (← links)
- Theory of interaction (Q896903) (← links)
- A calculus and logic of bunched resources and processes (Q906271) (← 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)
- CSP is a retract of CCS (Q960852) (← links)
- Algebra and logic for access control (Q968301) (← links)
- Component simulation-based substitutivity managing QoS and composition issues (Q988175) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- Bialgebraic methods and modal logic in structural operational semantics (Q1012126) (← links)
- Non-deterministic data types: Models and implementations (Q1058286) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- An axiomatic semantics for nested concurrency (Q1077155) (← 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)
- An algebra of concurrent non-deterministic processes (Q1179704) (← links)
- Adequacy-preserving transformations of COSY path programs (Q1185020) (← links)
- Observational structures and their logic (Q1190494) (← links)
- Finitary logics for some CCS observational bisimulations (Q1198052) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- Complete sets of axioms for finite basic LOTOS behavioural equivalences (Q1199556) (← links)
- From algebra to operational semantics (Q1209325) (← links)
- A complete axiomatisation for observational congruence of finite-state behaviours (Q1263984) (← links)
