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