A Complete Equational Axiomatization for MPA With String Iteration

Theoretical Computer Science - Netherlands
doi 10.1016/s0304-3975(97)00182-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Complete Equational Axiomatization for Prefix Iteration With Silent Steps

BRICS Report Series
1995English

Iteration-Free PDL With Storing, Recovering and Parallel Composition: A Complete Axiomatization

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2015English

Equational Axiomatization of Algebras With Structure

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

CCS With Hennessy's Merge Has No Finite Equational Axiomatization

BRICS Report Series
2003English

Axiomatization and Computability of a Variant of Iteration-Free PDL With Fork

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

A Ground-Complete Axiomatization of Stateless Bisimilarity Over Linda

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2015English

A Complete Axiomatization of a First-Order Temporal Logic Over Trace Systems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

Can String Theory Survive Complete Falsification?

2012English

A Group Preference Axiomatization With Cardinal Utility

Management Science
Management ScienceManagementOperations ResearchStrategy
1976English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy