A complete axiomatization of finite-state ACSR processes
From MaRDI portal
Publication:1376418
DOI10.1006/INCO.1997.2657zbMATH Open0885.68064OpenAlexW2029952030MaRDI QIDQ1376418FDOQ1376418
Patrice Brémond-Grégoire, Jin Young Choi, Insup Lee
Publication date: 2 February 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1997.2657
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculi for synchrony and asynchrony
- Priorities in process algebras
- Algebra of communicating processes with abstraction
- A calculus of communicating systems
- The algebra of timed processes, ATP: Theory and application
- Real time process algebra
- Title not available (Why is that?)
- A complete inference system for a class of regular behaviours
- Title not available (Why is that?)
- A complete axiomatisation for observational congruence of finite-state behaviours
- A brief history of Timed CSP
- Discrete time process algebra
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
- A resource-based prioritized bisimulation for real-time systems
Cited In (6)
- A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems
- Hiding resources that can fail: An axiomatic perspective
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
- Title not available (Why is that?)
- WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
- Resources in process algebra
This page was built for publication: A complete axiomatization of finite-state ACSR processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376418)