Amanote Research

Amanote Research

    RegisterSign In

On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-1996-281212
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
Date

January 1, 1996

Authors
B.A. Trakhtenbrot
Publisher

IOS Press


Related search

On the Completeness of Compositional Reasoning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Simple Completeness Proofs for Some Spatial Logics of the Real Line

2013English

Compositional Reachability in Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Synthesis of Circular Compositional Program Proofs via Abduction

International Journal on Software Tools for Technology Transfer
Information SystemsSoftware
2015English

Foucalt's Concept of the Relationships Between Power and Knowledge

Bastina
2019English

Petri Nets Compositional Modeling and Verification of Flexible Manufacturing Systems

2011English

The Power of Distributed Verifiers in Interactive Proofs

2020English

Relationships Between Duality of Scientists and Social Structure of Knowledge on Nuclear Power Problem

TRENDS IN THE SCIENCES
2014English

The Relationships Between Explosive Power for Arms and Legs and Some Biokinematic Variables for Team Handball Players

Al-Rafidain Journal For Sport Sciences
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy