Axiomatizing prefix iteration with silent steps
From MaRDI portal
Publication:1923086
DOI10.1006/inco.1996.0047zbMath0855.68030OpenAlexW2039616607MaRDI QIDQ1923086
Luca Aceto, Anna Ingólfsdóttir, Robert J. van Glabbeek, W. J. 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ A generalization of ACP using Belnap's logic ⋮ An equational axiomatization for multi-exit iteration ⋮ Mechanising a type-safe model of multithreaded Java with a verified compiler ⋮ Axiomatizations for the perpetual loop in process algebra ⋮ Nonaxiomatisability of equivalences over finite state processes ⋮ Coupled similarity: the first 32 years ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ Axiomatizing flat iteration ⋮ Models of nondeterministic regular expressions ⋮ Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ A Finite Axiomatization of Nondeterministic Regular Expressions ⋮ Non-regular iterators in process algebra ⋮ Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. ⋮ A complete equational axiomatization for MPA with string iteration ⋮ Ordered SOS process languages for branching and eager bisimulations
This page was built for publication: Axiomatizing prefix iteration with silent steps
