On the Axiomatizability of Priority
DOI10.1007/11787006_41zbMATH Open1134.68038OpenAlexW2154303258MaRDI QIDQ3591402FDOQ3591402
Authors: Luca Aceto, Taolue Chen, Anna Ingolfsdottir, Wan Fokkink
Publication date: 11 September 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11787006_41
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lifting non-finite axiomatizability results to extensions of process algebras
- Title not available (Why is that?)
- Priority Arguments and Epsilon Substitutions
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- On the axiomatisability of priority
- On the axiomatizability of priority. II
- Axiomatizing maximal progress and discrete time
- Priority and abstraction in process algebra
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
- On the axiomatisability of priority. III: Priority strikes again
This page was built for publication: On the Axiomatizability of Priority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591402)