Representations of Stream Processors Using Nested Fixed Points

Representations of Stream Processors Using Nested Fixed Points

We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation on the representations of two continuous functions between streams that yields a representa...

Полное описание

Библиографические подробности
Главные авторы:	Neil Ghani, Peter Hancock, Dirk Pattinson
Формат:	Статья
Язык:	English
Опубликовано:	Logical Methods in Computer Science e.V. 2009-09-01
Серии:	Logical Methods in Computer Science
Предметы:	computer science - data structures and algorithms computer science - logic in computer science e.1 e.2 f.2.1 f.2.2
Online-ссылка:	https://lmcs.episciences.org/713/pdf

Схожие документы

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
по: Lijun Zhang, и др.
Опубликовано: (2008-11-01)

The complexity of global cardinality constraints
по: Andrei A. Bulatov, и др.
Опубликовано: (2010-10-01)

Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
по: Lars Kuhtz, и др.
Опубликовано: (2012-10-01)

Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
по: Libor Barto, и др.
Опубликовано: (2012-02-01)

The complexity of linear-time temporal logic over the class of ordinals
по: Stephane Demri, и др.
Опубликовано: (2010-12-01)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
по: Dušan Knop, и др.
Опубликовано: (2019-12-01)

Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
по: Paola Bruscoli, и др.
Опубликовано: (2016-05-01)

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
по: Ahmed Bouajjani, и др.
Опубликовано: (2009-04-01)

Formalizing Randomized Matching Algorithms
по: Dai Tri Man Le, и др.
Опубликовано: (2012-08-01)

Visibly Tree Automata with Memory and Constraints
по: Hubert Comon-Lundh, и др.
Опубликовано: (2008-06-01)

Polynomial Size Analysis of First-Order Shapely Functions
по: Olha Shkaravska, и др.
Опубликовано: (2009-05-01)

Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
по: Vincent Atassi, и др.
Опубликовано: (2007-11-01)

Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
по: Jan Krajíček
Опубликовано: (2012-08-01)

Width and size of regular resolution proofs
по: Alasdair Urquhart
Опубликовано: (2012-06-01)

Bootstrapping Inductive and Coinductive Types in HasCASL
по: Lutz Schröder
Опубликовано: (2008-12-01)

Improved Algorithms for Parity and Streett objectives
по: Krishnendu Chatterjee, и др.
Опубликовано: (2017-09-01)

Well-definedness of Streams by Transformation and Termination
по: Hans H Zantema
Опубликовано: (2010-09-01)

Nested Hoare Triples and Frame Rules for Higher-order Store
по: Jan Schwinghammer, и др.
Опубликовано: (2011-09-01)

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
по: Takahito Aoto, и др.
Опубликовано: (2012-03-01)

Weighted Logics for Nested Words and Algebraic Formal Power Series
по: Christian Mathissen
Опубликовано: (2010-02-01)

Generic Modal Cut Elimination Applied to Conditional Logics
по: Dirk Pattinson, и др.
Опубликовано: (2011-03-01)

Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
по: Silvio Ghilardi, и др.
Опубликовано: (2010-12-01)

A Reduced Semantics for Deciding Trace Equivalence
по: David Baelde, и др.
Опубликовано: (2017-06-01)

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
по: Paolo Baldan, и др.
Опубликовано: (2008-10-01)

Guarded Second-Order Logic, Spanning Trees, and Network Flows
по: Achim Blumensath
Опубликовано: (2010-02-01)

Failure Trace Semantics for a Process Algebra with Time-outs
по: Rob van Glabbeek
Опубликовано: (2021-04-01)

Concurrency and Probability: Removing Confusion, Compositionally
по: Roberto Bruni, и др.
Опубликовано: (2019-12-01)

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
по: Samuel R. Buss, и др.
Опубликовано: (2008-12-01)

Psi-calculi: a framework for mobile processes with nominal data and logic
по: Jesper Bengtson, и др.
Опубликовано: (2011-03-01)

Event Structures for Petri nets with Persistence
по: Paolo Baldan, и др.
Опубликовано: (2018-09-01)

Ologisms
по: Ruggero Pagnan
Опубликовано: (2018-08-01)

Efficient Open World Reasoning for Planning
по: Tamara Babaian, и др.
Опубликовано: (2006-09-01)

Tractable Combinations of Temporal CSPs
по: Manuel Bodirsky, и др.
Опубликовано: (2022-05-01)

The Complexity of Combinations of Qualitative Constraint Satisfaction Problems
по: Manuel Bodirsky, и др.
Опубликовано: (2020-02-01)

Complexity classifications for different equivalence and audit problems for Boolean circuits
по: Elmar BÃ¶hler, и др.
Опубликовано: (2012-09-01)

A Strategy for Dynamic Programs: Start over and Muddle through
по: Samir Datta, и др.
Опубликовано: (2019-05-01)

Randomisation and Derandomisation in Descriptive Complexity Theory
по: Kord Eickmeyer, и др.
Опубликовано: (2011-09-01)

A lower bound on web services composition
по: Anca Muscholl, и др.
Опубликовано: (2008-05-01)

Essential Convexity and Complexity of Semi-Algebraic Constraints
по: Manuel Bodirsky, и др.
Опубликовано: (2012-10-01)

Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
по: Makoto Hamana
Опубликовано: (2017-11-01)