scientific article; zbMATH DE number 1638655

zbMATH Open0967.68514MaRDI QIDQ2736352FDOQ2736352

Bengt Jonsson, Kim G. Larsen

Publication date: 29 August 2001

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cited In (15)

• The expressive power of implicit specifications
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• Factorization for Component-Interaction Automata
• The complexity of reachability in parametric Markov decision processes
• Robust almost-sure reachability in multi-environment MDPs
• On the Complexity of Reachability in Parametric Markov Decision Processes
• Modal event-clock specifications for timed component-based design
• Complexity of Decision Problems for Mixed and Modal Specifications
• Title not available (Why is that?)
• Design of reactive algorithms by solving equations over automata
• Equational reasoning about nondeterministic processes
• Title not available (Why is that?)
• Branching time controllers for discrete event systems
• Title not available (Why is that?)
• Negative Results on Decidability and Small Model Property of Process Equations

This page was built for publication:

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