Computable processes and bisimulation equivalence

DOI10.1007/BF01213493MaRDI QIDQ2365394zbMATH OpenFDO

Authors Alban Ponse

Publication date 1996

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01213493

zbMATH Keywords

finite branchingtransition system

Mathematics Subject Classification ID

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

Recommendations

• Decision procedures and graph reductions for bisimulation equivalences part 1
• scientific article; zbMATH DE number 2102770
• Processes as terms: non-well-founded models for bisimulation
• scientific article; zbMATH DE number 3898224
• scientific article; zbMATH DE number 4119652

Cites work

• ACP '95, international workshop on Algebra of communicating processes. Eindhoven, Netherlands, May 17--18, 1995
• Algebra of communicating processes with abstraction
• Algebraic Specification of Communication Protocols
• Algèbre de processus et synchronisation
• Calculi for synchrony and asynchrony
• CONCUR '94: concurrency theory. 5th International Conference, Uppsala, Sweden, August 22--25, 1994. Proceedings
• Higher-level synchronising devices in Meije-SCCS
• scientific article; zbMATH DE number 3880670 (Why is no real title available?)
• scientific article; zbMATH DE number 4157900 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 683363 (Why is no real title available?)
• scientific article; zbMATH DE number 10088 (Why is no real title available?)
• scientific article; zbMATH DE number 2102747 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Laws of programming
• On the consistency of Koomen's fair abstraction rule
• Process Algebra
• Process algebra for synchronous communication
• Real time process algebra
• Structured operational semantics and bisimulation as a congruence

Cited in

(15)

• Two finite specifications of a queue
• Strong bisimilarity of simple process algebras: Complexity lower bounds
• A complexity analysis of bisimilarity for value-passing processes
• Decidability of bisimilarity for one-counter processes.
• On the expressiveness of choice quantification
• Register-machine based processes
• Process Bisimulation Via a Graphical Encoding
• scientific article; zbMATH DE number 4035115 (Why is no real title available?)
• Bisimulation equivalence is decidable for one-counter processes
• scientific article; zbMATH DE number 4119652 (Why is no real title available?)
• Convenient category of processes and simulations I: Modulo strong bisimilarity
• Linearization in parallel pCRL
• Non-regular iterators in process algebra
• Deciding bisimulation and trace equivalences for systems with many identical processes
• Bisimulation for higher-order process calculi

This page was built for publication: Computable processes and bisimulation equivalence

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