Priority and abstraction in process algebra

DOI10.1016/J.IC.2007.05.001MaRDI QIDQ2381506zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 September 2007

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2007.05.001

zbMATH Keywords

full abstractionaxiomatizationprioritybisimulationProcess algebraobservation congruence

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Priorities in process algebras
• Priority in process algebra.
• A process algebra with distributed priorities
• A process algebra with distributed priorities
• Priority as extremal probability

Cites work

• scientific article; zbMATH DE number 1670867 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176757 (Why is no real title available?)
• scientific article; zbMATH DE number 1304995 (Why is no real title available?)
• scientific article; zbMATH DE number 2077123 (Why is no real title available?)
• scientific article; zbMATH DE number 4001464 (Why is no real title available?)
• scientific article; zbMATH DE number 1863171 (Why is no real title available?)
• scientific article; zbMATH DE number 794263 (Why is no real title available?)
• scientific article; zbMATH DE number 915855 (Why is no real title available?)
• A complete axiomatisation for observational congruence of finite-state behaviours
• A process algebra with distributed priorities
• A resource-based prioritized bisimulation for real-time systems
• Algebra and Coalgebra in Computer Science
• Algebraic laws for nondeterminism and concurrency
• An algebraic theory of multiple clocks
• Bisimulation on speed: Worst-case efficiency
• Branching time and abstraction in bisimulation semantics
• CCS expressions, finite state processes, and three problems of equivalence
• CCS with priority choice
• Handbook of process algebra
• On the Axiomatizability of Priority
• Preferential choice and coordination conditions
• Priorities in process algebras
• Priority in process algebra.
• Testing equivalences for processes
• Three Partition Refinement Algorithms

Cited in

(20)

• Algebraic program semantics for supercomputing
• Under-approximation of reachability in multivalued asynchronous networks
• On Observing Dynamic Prioritised Actions in SOC
• On the axiomatizability of priority. II
• An expressiveness study of priority in process calculi
• Slow abstraction via priority
• Expressing priorities and external probabilities in process algebra via mixed open/closed systems
• Compositional non-blockingness verification of finite automata with prioritised events
• scientific article; zbMATH DE number 915855 (Why is no real title available?)
• A process algebra with distributed priorities
• Sufficient conditions for reachability in automata networks with priorities
• A denotational semantics for Handel-C
• Priority in process algebra.
• Simulation preorder over simple process algebras
• Axiomatizing maximal progress and discrete time
• scientific article; zbMATH DE number 177854 (Why is no real title available?)
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• Behavioural abstraction in TCCS
• Quantum process algebra with priorities
• A process algebra with distributed priorities

This page was built for publication: Priority and abstraction in process algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381506)