A Complete Finite Prefix for Process Algebra

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-48683-6_18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Complete Equational Axiomatization for Prefix Iteration With Silent Steps

BRICS Report Series
1995English

A Sound and Complete Abstraction for Reasoning About Parallel Prefix Sums

2014English

Process Algebra for Performance Evaluation

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2002English

A Process Algebra With Distributed Priorities

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1998English

Process Algebra Modelling Styles for Biomolecular Processes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

The Standard Form of a Representation-Finite Algebra

Bulletin de la Societe Mathematique de France
Mathematics
1983English

Discrete Time Process Algebra

Formal Aspects of Computing
Theoretical Computer ScienceSoftware
1996English

Non Interleaving Process Algebra

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

The Multiplicity Problem for Indecomposable Decompositions of Modules Over a Finite-Dimensional Algebra. Algorithms and a Computer Algebra Approach

Colloquium Mathematicum
Mathematics
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy