scientific article; zbMATH DE number 2163034
From MaRDI portal
Publication:4673421
zbMath1094.68050MaRDI QIDQ4673421
Publication date: 29 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Complexity of deciding bisimilarity between normed BPA and normed BPP ⋮ Normed BPA vs. Normed BPP Revisited ⋮ Deciding probabilistic bisimilarity over infinite-state probabilistic systems ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ A general approach to comparing infinite-state systems with their finite-state specifications
This page was built for publication:
