Axiomatizing prefix iteration with silent steps
From MaRDI portal
Publication:1923086
DOI10.1006/INCO.1996.0047zbMATH Open0855.68030OpenAlexW2039616607MaRDI QIDQ1923086FDOQ1923086
Authors: Luca Aceto, Anna Ingolfsdottir, Rob van Glabbeek, Wan Fokkink 
Publication date: 25 November 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/07c82fae545c9468efc741102a8b7650471233c0
Recommendations
- A complete equational axiomatization for prefix iteration
- scientific article; zbMATH DE number 1189291
- scientific article; zbMATH DE number 1113857
- On the complete axiomatization for prefix iteration modulo observation congruence
- Axiomatizing flat iteration
- scientific article; zbMATH DE number 883892
- scientific article; zbMATH DE number 4197440
- scientific article; zbMATH DE number 3847364
- Simplified Axiom Schemes for Implication and Iterated Implication
Cited In (20)
- Title not available (Why is that?)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations.
- A complete equational axiomatization for MPA with string iteration
- Termination modulo equations by abstract commutation with an application to iteration
- A generalization of ACP using Belnap's logic
- Axiomatizing flat iteration
- Non-regular iterators in process algebra
- Ordered SOS process languages for branching and eager bisimulations
- On the complete axiomatization for prefix iteration modulo observation congruence
- Mechanising a type-safe model of multithreaded Java with a verified compiler
- An equational axiomatization for multi-exit iteration
- Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
- Nonaxiomatisability of equivalences over finite state processes
- Coupled similarity: the first 32 years
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Models of nondeterministic regular expressions
- A Finite Axiomatization of Nondeterministic Regular Expressions
- Title not available (Why is that?)
- Axiomatizations for the perpetual loop in process algebra
This page was built for publication: Axiomatizing prefix iteration with silent steps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923086)
