A complete axiomatization of finite-state ACSR processes

DOI10.1006/inco.1997.2657zbMath0885.68064OpenAlexW2029952030MaRDI QIDQ1376418

Patrice Brémond-Grégoire, Insup Lee, Jin Young Choi

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

zbMATH Keywords

real-time systemsreal-time process algebra

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (4)

Resources in process algebra ⋮ A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems ⋮ WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model ⋮ Hiding resources that can fail: An axiomatic perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A brief history of Timed CSP
• Priorities in process algebras
• Calculi for synchrony and asynchrony
• A complete inference system for a class of regular behaviours
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• A complete axiomatisation for observational congruence of finite-state behaviours
• A resource-based prioritized bisimulation for real-time systems
• The algebra of timed processes, ATP: Theory and application
• Discrete time process algebra
• Real time process algebra
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator

This page was built for publication: A complete axiomatization of finite-state ACSR processes