Results 241 to 250 of about 1,184,149 (273)

F.3.2 Fünf Leibniz-Institute für Raumforschung (ARL; IRS; IÖR; IfL; ILS-assoziiert)Sabine Baumgart

, 2020
Sabine Baumgart
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Consistently-Detecting Monitors

International Conference on Concurrency Theory, 2017
We study a contextual definition for deterministic monitoring based on consistent detections. It is defined in terms of the observed behaviour of the monitor when instrumented over arbitrary systems.
Adrian Francalanza
semanticscholar   +1 more source

Interaction Graphs: Full Linear Logic

Logic in Computer Science, 2015
Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far.
Thomas Seiller
semanticscholar   +1 more source

Refinement for Signal Flow Graphs

International Conference on Concurrency Theory, 2017
The symmetric monoidal theory of Interacting Hopf Algebras provides a sound and complete axiomatisation for linear relations over a given field. As is the case for ordinary relations, linear relations have a natural order that coincides with inclusion ...
F. Bonchi, Joshua Holland, Dusko Pavlovic, P. Sobocinski   +3 more
semanticscholar   +1 more source

Compositional Weak Metrics for Group Key Update

International Symposium on Mathematical Foundations of Computer Science, 2017
We investigate the compositionality of both weak bisimilarity metric and weak similarity quasimetric semantics with respect to a variety of standard operators, in the context of probabilistic process algebra.
R. Lanotte, Massimo Merro, S. Tini
semanticscholar   +1 more source

Presenting Morphisms of Distributive Laws

Conference on Algebra and Coalgebra in Computer Science, 2015
A format for well-behaved translations between structural operational specifications is derived from a notion of distributive law morphism, previously studied by Power and Watanabe. 1998 ACM Subject Classification F.3.2 Semantics of Programming Languages
Bartek Klin, Beata Nachyla
semanticscholar   +1 more source

Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk)

International Conference on Formal Structures for Computation and Deduction, 2017
In this talk, I’ll describe how rewriting techniques can be successfully employed to built state-ofthe-art automated resource analysis tools which favourably compare to other approaches.
G. Moser
semanticscholar   +1 more source

Modules Over Monads and Their Algebras

Conference on Algebra and Coalgebra in Computer Science, 2015
Modules over monads (or: actions of monads on endofunctors) are structures in which a monad interacts with an endofunctor, composed either on the left or on the right. Although usually not explicitly identified as such, modules appear in many contexts in
Maciej Piróg, Nicolas Wu, J. Gibbons
semanticscholar   +1 more source