scientific article; zbMATH DE number 1064110
From MaRDI portal
Publication:4355677
Recommendations
Cited in
(15)- On the complexity of equivalence of specifications of infinite objects
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP
- An algebra of behavioural types
- Decidability of model checking with the temporal logic EF
- scientific article; zbMATH DE number 2155191 (Why is no real title available?)
- Rewrite systems with constraints
- scientific article; zbMATH DE number 1860681 (Why is no real title available?)
- Equivalence-checking with infinite-state systems: techniques and results
- Process rewrite systems.
- A general approach to comparing infinite-state systems with their finite-state specifications
- Model checking Erlang programs -- abstracting recursive function calls
- Infinite results
- Model checking the full modal mu-calculus for infinite sequential processes
- Pushdown automata, multiset automata, and Petri nets
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
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 Q4355677)
