Publication:4938637
From MaRDI portal
zbMath0941.68574MaRDI QIDQ4938637
Mark R. Jerrum, Joram Hirschfeld
Publication date: 10 July 2000
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Decidability of Weak Bisimilarity for a Subset of BPA, Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, The regular viewpoint on PA-processes, Partially-commutative context-free processes: expressibility and tractability, Theory of interaction, Unique parallel decomposition in branching and weak bisimulation semantics, Decomposition orders -- another generalisation of the fundamental theorem of arithmetic, Complexity of deciding bisimilarity between normed BPA and normed BPP, A general approach to comparing infinite-state systems with their finite-state specifications, Decidable first-order transition logics for PA-processes, Partially-Commutative Context-Free Processes, Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, Selected Ideas Used for Decidability and Undecidability of Bisimilarity, Normed BPA vs. Normed BPP Revisited