Pages that link to "Item:Q3766826"
From MaRDI portal
The following pages link to Algebraic laws for nondeterminism and concurrency (Q3766826):
Displaying 50 items.
- Coinductive predicates and final sequences in a fibration (Q265811) (← links)
- A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases (Q266861) (← links)
- Bunched sequential information (Q266883) (← links)
- A characterization of finitary bisimulation (Q287256) (← links)
- A pseudometric in supervisory control of probabilistic discrete event systems (Q351739) (← links)
- Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Temporal BI: proof system, semantics and translations (Q391122) (← links)
- An algebra of behavioural types (Q418153) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- Approximating Markov processes through filtration (Q442296) (← links)
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- Lattice-valued simulations for quantitative transition systems (Q473367) (← links)
- A modal characterization of alternating approximate bisimilarity (Q479808) (← links)
- Rough approximations based on bisimulations (Q505252) (← links)
- Maximally permissive controlled system synthesis for non-determinism and modal logic (Q513185) (← links)
- On bisimulations for description logics (Q527171) (← links)
- Differential privacy in probabilistic systems (Q529047) (← links)
- Model-checking games for fixpoint logics with partial order models (Q532389) (← links)
- Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm (Q534301) (← links)
- SOS rule formats for zero and unit elements (Q549170) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Refusal testing (Q580961) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- A state/event-based model-checking approach for the analysis of abstract system properties (Q617925) (← links)
- On intuitionistic modal and tense logics and their classical companion logics: topological semantics and bisimulations (Q636275) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← 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)
- Logical characterizations of simulation and bisimulation for fuzzy transition systems (Q679804) (← 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)
- Dual choice and iteration in an abstract algebra of action (Q694489) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Behavioural and abstractor specifications revisited (Q724932) (← links)
- Is hyper-extensionality preservable under deletions of graph elements? (Q737091) (← links)
- Correctness of recursive parallel nondeterministic flow programs (Q789165) (← links)
