Time abstracted bisimulation: Implicit specifications and decidability
From MaRDI portal
Recommendations
Cites work
- CCS expressions, finite state processes, and three problems of equivalence
- scientific article; zbMATH DE number 3956423 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177824 (Why is no real title available?)
- Three Partition Refinement Algorithms
Cited in
(6)- Time-abstracted bisimulation: Implicit specifications and decidability
- scientific article; zbMATH DE number 1061012 (Why is no real title available?)
- A modal characterization of alternating approximate bisimilarity
- On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
- CONCUR 2005 – Concurrency Theory
- Cycle encoding-based parameter synthesis for timed automata safety
This page was built for publication: Time abstracted bisimulation: Implicit specifications and decidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890046)