scientific article; zbMATH DE number 4157896

zbMATH Open0705.68071MaRDI QIDQ3485876FDOQ3485876

Authors: Virgil Emil Căzănescu, Gh. Ştefănescu 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4100594
• scientific article
• Axiomatizing schemes and their behaviors
• scientific article; zbMATH DE number 4187117
• scientific article; zbMATH DE number 3956410

zbMATH Keywords

feedbackflowchart schemessymmetric strict monoidal categorybiflowaxiomatic looping operationflownomial expressions

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (31)

• Title not available (Why is that?)
• Equational properties of fixed point operations in Cartesian categories: an overview
• Equational properties of fixed-point operations in cartesian categories: An overview
• Title not available (Why is that?)
• Dynamic connectors for concurrency
• On flowchart theories. II: The nondeterministic case
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Axiomatizing schemes and their behaviors
• Some quasi-varieties of iteration theories
• Title not available (Why is that?)
• Classes of finite relations as initial abstract data types. I
• The equational logic of fixed points
• The duality between flow charts and circuits
• Title not available (Why is that?)
• Title not available (Why is that?)
• The algebra of stream processing functions
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• A basic algebra of stateless connectors
• Title not available (Why is that?)
• Algebraic semantics of recursive flowchart schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An equational axiomatization of systolic systems
• Algebraic characterization of reducible flowcharts
• A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
• Processes with multiple entries and exits
• Normal forms for algebras of connections.
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485876)