An algebraic and algorithmic method for analysing transition systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3856434 (Why is no real title available?)
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- Results on the propositional \(\mu\)-calculus
Cited in
(16)- A deductive approach towards reasoning about algebraic transition systems
- Injective envelope and parallel decomposition of a transition system
- scientific article; zbMATH DE number 4033050 (Why is no real title available?)
- Nivat's processes and their synchronization
- scientific article; zbMATH DE number 2087444 (Why is no real title available?)
- scientific article; zbMATH DE number 139604 (Why is no real title available?)
- An algebraic characterization of transition system equivalences
- scientific article; zbMATH DE number 3876597 (Why is no real title available?)
- Analysis of the structure of attributed transition systems without hidden transitions
- An approximation algorithm for box abstraction of transition systems on real state spaces
- Static analysis of IMC
- A linear algorithm to solve fixed-point equations on transition systems
- Algebraic approach to the analysis of automaton systems of interconnected graphs with simple links
- An even faster solver for general systems of equations
- scientific article; zbMATH DE number 2000405 (Why is no real title available?)
- Verification and comparison of transition systems
This page was built for publication: An algebraic and algorithmic method for analysing transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822237)
