Computation tree

A computation tree is a representation for the computation steps of a non-deterministic Turing machine on a specified input. A computation tree is a…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

Finite 1-safe Petri nets, also called \emph{net systems}, are natural models of asynchronous concurrency. The event structure of…

2017

A number of formal methods exist for capturing stimulus-response requirements in a declarative form. Someone yet needs to…

2016

. We deﬁne memory-eﬃcient certiﬁcates for µ -calculus model checking problems based on the well-known correspondence of…

2014

Two architectures for modulo 2 n +1 adders are introduced in this paper. The first one is built around a sparse carry computation…

2014

The contribution of this paper is threefold: first, it defines a framework for modelling component-based systems, as well as a…

2011

The Tutte polynomial introduced by W. Tutte in [9] is a well known bivariate polynomial graph invariant that carries information…

2008

5 We show that ...

2007

We discuss the problem of comparing the behavioural equivalence of partially observable systems with observations. We examine…

1999

. In this paper we consider lower bounds for external-memory computational geometry problems. We (cid:12)nd that it is not quite…

1992

We introduce m-valued locally definable acceptance types, a new model generalizing the idea of alternating machines and their…