Priorities in process algebras
From MaRDI portal
Publication:802881
DOI10.1016/0890-5401(90)90059-QzbMath0726.68053MaRDI QIDQ802881
Rance Cleaveland, Matthew C. B. Hennessy
Publication date: 1990
Published in: Information and Computation (Search for Journal in Brave)
concurrent systemsoperational semanticsprocess algebrasobservational equivalencebehavioral equivalencelabeled transition systemcalculus of communicating systems
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Sound reasoning in \textit{tock}-CSP ⋮ Under-approximation of reachability in multivalued asynchronous networks ⋮ Priority and abstraction in process algebra ⋮ A complete axiomatization of finite-state ACSR processes ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ Unnamed Item ⋮ A process algebra of communicating shared resources with dense time and priorities ⋮ QoS negotiation in service composition ⋮ Sufficient conditions for reachability in automata networks with priorities ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Distributability of mobile ambients ⋮ Probabilistic and prioritized models of timed CSP ⋮ Causality for mobile processes ⋮ A process algebra with distributed priorities ⋮ CCS with priority guards ⋮ A denotational semantics for Handel-C ⋮ On the axiomatizability of priority. II ⋮ A modular framework for verifying versatile distributed systems ⋮ Compositional priority specification in real-time distributed systems. ⋮ The Expressive Power of Monotonic Parallel Composition ⋮ On the axiomatisability of priority ⋮ Priority as extremal probability ⋮ A process algebra with distributed priorities ⋮ An expressiveness study of priority in process calculi ⋮ Finite axiom systems for testing preorder and De Simone process languages ⋮ On the computational power of BlenX ⋮ An algebraic framework for urgency ⋮ Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Uses Software
Cites Work
- CCS expressions, finite state processes, and three problems of equivalence
- Calculi for synchrony and asynchrony
- Statecharts: a visual formalism for complex systems
- A calculus of communicating systems
- Testing equivalences for processes
- Process algebra for synchronous communication
- Algebraic laws for nondeterminism and concurrency
- Three Partition Refinement Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
