Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
теория категорий
Связанные издания:
Abstract Interpretation of Proofs: Classical Propositional Calculus
Algorithms - ESA 2015: Proc./23rd Annual European Symposium, Patras, Greece, September 2015
A Logic Characteristic for Timed Extensions of Partial Oeder Based Equivalences
Bisimulation for General Stochastic Systems
Categorical Abstract Data Type (CADT)
Categories and Types in Logic, Language, and Phisics: Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday
Category Theory applied to Computation and Control: Proc./First International Symposium, Amherst, MA,USA, February 1974
Causal trees and timed causal trees categorically
Computation, Logic, Games, and Quantum Foundations: The Many Facets of Samson Abramsky: Essays Dedicated to Samson Abramsky on the Occasion of His 60th Birthday
Graph Transformations and Model-Driven Engineering: Essays Dedicated to Manfred Nagl on the Occasion of His 65th Birthday
Graph Transformation, Specificationas, and Nets: In Memory of Hartmut Ehrig
Logic and Grammar: Essays Dedicated to Alain Lecome on the Occasion of His 60th Birthday
Logic and Its Applications: Proc./4th Indian Conference, ICLA 2011, Delhi, India, January 2011
Open maps and weak trace equivalence for timed event structures
Real-Time Stable Event Structures and Marked Scott Domains: An Adjunction
Relational and Algebraic Methods in Computer Science: Proc./19th International Conference, RAMiCS 2021, Marseille, France, November 2021
Semantics and Algebraic Specification: Essays Dedicated to Peter D.Mosses on the Occasion of his 60th Birthday
Theoretical Aspects of Computing - ICTAC 2010: Proc./7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 2010
Theoretical Aspects of Computing - ICTAC 2015: Proc./12th International Colloquium, Cali, Colombia, October 2015
The timed barbed bisimulation is decidable for timed transition systems with invariants
Timed Transition Systems with Independence and Marked Scott Domains: An Adjunction
Монады для формализации процедуры сопоставления с образцом
О категоричных теориях
Открытые морфизмы и временная тестовая эквивалентность для временных автоматных моделей
О трансформациях нечетких графов, задаваемых FD-грамматиками
Теоретико-катерогная характеризация развертки временных сетей Петри
Трансформационный подход к разработке программных архитектур на основе нечетких графовых моделей