95,525 Hits in 3.6 sec

Coalgebraic Quantum Computation

Frank Roumen
2014 Electronic Proceedings in Theoretical Computer Science  
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains.  ...  We will present a coalgebraic representation of systems occuring in the field of quantum computation, using convex sets of density matrices as state spaces.  ...  In theoretical computer science, finite automata provide a mechanical way to describe languages. An alphabet is a finite set, whose elements we call letters or symbols.  ... 
doi:10.4204/eptcs.158.3 fatcat:46xlfoiqwjef7l7gs7rqjpwm7i

Qualitative Tree Languages

Olivier Serre
2012 Electronic Proceedings in Theoretical Computer Science  
In this qualitative setting, a tree is accepted by the automaton if there exists a run over this tree in which almost every branch is accepting.  ...  We study finite automata running over infinite binary trees and we relax the notion of accepting run by allowing a negligible set (in the sense of measure theory) of non-accepting branches.  ...  Then the computation proceeds in parallel from both sons, and so on.  ... 
doi:10.4204/eptcs.103.7 fatcat:rlivuxf4pbaf7fu7iwjs4agfdq

A proof-theoretic view on scheduling in concurrency

Emmanuel Beffara
2014 Electronic Proceedings in Theoretical Computer Science  
This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules".  ...  In our logical system, processes and schedulers appear explicitly as proofs in different fragments of the proof language and cut elimination between them does correspond to execution of a concurrent system  ...  order to avoid the slight proof-theoretic complications of the units.  ... 
doi:10.4204/eptcs.164.6 fatcat:5oj2vofdlbeuffzeoe7z3p5uom

Computation with Advice

Vasco Brattka, Arno Pauly
2010 Electronic Proceedings in Theoretical Computer Science  
In the framework of computation with advice, it is possible to define computational complexity for certain concepts of hypercomputation.  ...  Finally, some examples are given which illuminate the interplay of uniform and non-uniform techniques in order to investigate both computability with advice and the Weihrauch lattice.  ...  In addition, for many natural examples of functions f , f tends to be computable with Z-advice in either both senses or in neither.  ... 
doi:10.4204/eptcs.24.9 fatcat:mwrhzqgswza3dk72sedfebw5by

Proceedings of the Workshop on Continuations

Olivier Danvy, Ugo de'Liguoro
2016 Electronic Proceedings in Theoretical Computer Science  
To appear in EPTCS. Preface The Workshop on Continuations, WoC 2015, was held in London in April 2015.  ...  WoC 2015 offered a forum for the presentation and discussion of continuation-based constructs in programming languages, whether in the style of Curry (terms first, types later) or in the style of Church  ... 
doi:10.4204/eptcs.212.0 fatcat:w2fvuivzazby3gdxx3d4ipxpna

Computational Processes and Incompleteness

Klaus Sutner
2009 Electronic Proceedings in Theoretical Computer Science  
It is shown that in the context of standard finite injury priority arguments one cannot establish the existence of an intermediate computational process.  ...  We introduce a formal definition of Wolfram's notion of computational process based on cellular automata, a physics-like model of computation.  ...  This type of completeness is hidden in the standard recursion theoretic argument but becomes visible when we recast the argument as a computational process.  ... 
doi:10.4204/eptcs.1.22 fatcat:kynfeesiufgufpxouisra57ryi

Finiteness and Computation in Toposes

Edward Hermann Haeusler
2016 Electronic Proceedings in Theoretical Computer Science  
In this article, we assume that computation is based on finiteness rather than natural numbers and discuss Turing machines computable morphisms defined on top of the sole notion finiteness.  ...  properties on the computation arise, e.g., infinitely long programs, finite computations containing infinitely long ones, infinitely branching computations.  ...  We are thankful to Peter Arndt, whose seminars pointed out to me the many facets of finiteness provided by topos-theoretic models.  ... 
doi:10.4204/eptcs.204.6 fatcat:7xc3n4grgbfnhjaam7v7ozcevi

Negotiation Games

Philipp Hoffmann
2015 Electronic Proceedings in Theoretical Computer Science  
Then we show that for sound and deterministic or even weakly deterministic negotiations the problems can be solved in PTIME.  ...  We have only considered 2-player games, since in our settings the behavior of the third player (the Scheduler) is either irrelevant, or is controlled by one of the other two players.  ...  (a) and (b): The attractor computation and the strategies used in the proof of Theorem 5.2 are independent of the choices of Scheduler; the strategies are memoryless.  ... 
doi:10.4204/eptcs.193.3 fatcat:xud35qluhzcejed5enddhnfrva

Decentralized LTL Enforcement

Florian Gallay, Yliès Falcone
2021 Electronic Proceedings in Theoretical Computer Science  
Although this guarantees an optimal correction, it forces the system to synchronize and is more costly, computation and communication wise.  ...  In the first one, the enforcers explore all possible local modifications to find the best global correction.  ...  If apr(tcl) = / 0 in the received tcl, jump to step 5. 2: Evaluation: Compute apr(tcl), the set of atomic propositions that have not been evaluated yet.  ... 
doi:10.4204/eptcs.346.9 fatcat:xa4vq75fqjht3e2qohn4oppwyi

Types for Security Protocols

Riccardo Focardi, Matteo Maffei
2009 Electronic Proceedings in Theoretical Computer Science  
We revise existing type-based analyses of security protocols by devising a core type system for secrecy, integrity and authentication in the setting of spicalculus processes.  ...  Our exercise of considering all of them in a uniform framework is interesting under different perspectives: (i) it provides a general overview of how type theory can be applied to reason on security protocols  ...  Notice that, whenever the opponent computes d, he can also send it on a unrestricted (public) channel.  ... 
doi:10.4204/eptcs.7.0.1 fatcat:264k3d7c5jcnzegpldgetmljgq

Stateless HOL

Freek Wiedijk
2011 Electronic Proceedings in Theoretical Computer Science  
We present a version of the HOL Light system that supports undoing definitions in such a way that this does not compromise the soundness of the logic.  ...  In our system the code that keeps track of the constants that have been defined thus far has been moved out of the kernel. This means that the kernel now is purely functional.  ...  Thanks to Pierre Corbineau for interesting discussions on state in the HOL Light kernel.  ... 
doi:10.4204/eptcs.53.4 fatcat:rs6vaosj7rbudotuunad3e2poa

Parameterized verification of probabilistic networks

Nathalie Bertrand
2015 Electronic Proceedings in Theoretical Computer Science  
Finally, we show NP-completeness for the natural optimisation 25 problem associated with the cutoff. 26 2012 ACM Subject Classification Theory of computation → Verification by model checking 27 Keywords  ...  Surprisingly, no lower nor upper bounds on the 18 minimal number of nodes, or the minimal length of covering execution in reconfigurable networks, 19 appear in the literature. 20 In this paper we show  ...  Moreover, configurations 484 and updates of configurations by given transitions can be represented in and computed in 485 a compact way.  ... 
doi:10.4204/eptcs.193.0.2 fatcat:tetpyd3mnzbcdn4apypnry4t44


Krisztina Fruzsa, Roman Kuznets, Ulrich Schmid
2021 Electronic Proceedings in Theoretical Computer Science  
agents in order to FIRE.  ...  It involves eventual common hope (a modality related to belief), which we show to be attained already by achieving eventual mutual hope in the case of FRR.  ...  fault-tolerant distributed systems where computing nodes (agents 1 ) can crash.  ... 
doi:10.4204/eptcs.335.13 fatcat:xvi3zf3sgjan7i26buzgqkvqve

Reactive Safety

Rüdiger Ehlers, Bernd Finkbeiner
2011 Electronic Proceedings in Theoretical Computer Science  
In this paper, we revisit the notion of safety for reactive systems, i.e., for systems whose behavior is characterized by the interplay of uncontrolled environment inputs and controlled system outputs.  ...  In the next sections we will develop the necessary automata-theoretic machinery to answer this question. We will return to the example in Section 5.3.  ...  To obtain the tight word automaton, we simply compute W (A ′ ).  ... 
doi:10.4204/eptcs.54.13 fatcat:gkjvukokl5c6fngfk4n2kmzwla

The TTC 2013 Flowgraphs Case

Tassilo Horn
2013 Electronic Proceedings in Theoretical Computer Science  
One task deals with typical model-to-model transformation problem, there's a model-to-text problem, there are two in-place transformation problems, and finally there's a task dealing with validation of  ...  There is no correspondence in Java, but it's a synthetic element added in favour of task 2.  ...  In case of a label, the first flow instruction in the labled statement is the control flow successor. In case of loops and if-statements, the successor is their test expression.  ... 
doi:10.4204/eptcs.135.1 fatcat:cahf4nejdrab3j45aj2nck3eue
« Previous Showing results 1 — 15 out of 95,525 results