On the complexity of equation solving in process algebra

DOI10.1007/3-540-53982-4_21MaRDI QIDQ2736352zbMATH OpenFDO

Authors Bengt Jonsson, Kim G. Larsen

Publication date 29 August 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53982-4_21

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• Equational reasoning about nondeterministic processes
• Processes, Terms and Cycles: Steps on the Road to Infinity
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• Expressiveness of process algebras
• Communicating Sequential Processes. The First 25 Years
• Solvability of equivalence problems in a system of algorithmic algebras
• Process Algebra
• Undecidable equivalences for basic process algebra
• An incompleteness result in process algebra
• Equivalence of recursive specifications in process algebra

Cited in

(18)

• Modal event-clock specifications for timed component-based design
• Design of reactive algorithms by solving equations over automata
• On the greatest solution of equations in \(\mathrm{CLL}_R\)
• The complexity of reachability in parametric Markov decision processes
• Factorization for component-interaction automata
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
• scientific article; zbMATH DE number 4026813 (Why is no real title available?)
• scientific article; zbMATH DE number 810103 (Why is no real title available?)
• Problem solving using process algebra considered insightful
• Negative Results on Decidability and Small Model Property of Process Equations
• Complexity of Decision Problems for Mixed and Modal Specifications
• On the Complexity of Reachability in Parametric Markov Decision Processes
• Branching time controllers for discrete event systems
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• Robust almost-sure reachability in multi-environment MDPs
• The expressive power of implicit specifications
• On process equivalence = equation solving in CCS
• Equational reasoning about nondeterministic processes

This page was built for publication: On the complexity of equation solving in process algebra

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