scientific article; zbMATH DE number 1064110
From MaRDI portal
Publication:4355677
zbMath0887.68035MaRDI QIDQ4355677
Publication date: 20 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
An algebra of behavioural types ⋮ Complexity of Weak Bisimilarity and Regularity for BPA and BPP ⋮ Rewrite Systems with Constraints ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Decidability of model checking with the temporal logic EF ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time ⋮ Model Checking Erlang Programs – Abstracting Recursive Function Calls ⋮ Model checking the full modal mu-calculus for infinite sequential processes ⋮ Process rewrite systems.
This page was built for publication:
