Parameterized verification of monotone information systems
From MaRDI portal
Publication:1798673
coverabilityinformation systemsmodel checkingparameterized verificationprocess algebrawell-quasi-orderingwell-structured transition systems
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Recommendations
- MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
- Monotonic abstraction in parameterized verification
- Forcing monotonicity in parameterized verification: from multisets to words
- Constrained monotonic abstraction: a CEGAR for parameterized verification
- Tools and Algorithms for the Construction and Analysis of Systems
- Decidability of parameterized verification
- scientific article; zbMATH DE number 1538039
- Hierarchical reasoning for the verification of parametric systems
Cites work
- A general framework for well-structured graph transformation systems
- A theory of structural stationarity in the \(\pi\)-calculus
- All for the price of few (parameterized verification through view abstraction)
- Communicating sequential processes
- Graph minors XXIII. Nash-Williams' immersion conjecture
- scientific article; zbMATH DE number 1614699 (Why is no real title available?)
- scientific article; zbMATH DE number 4030997 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- On the reachability problem for 5-dimensional vector addition systems
- Ordering by Divisibility in Abstract Algebras
- Parameterized verification of ad hoc networks
- Process algebra for synchronous communication
- Statecharts: a visual formalism for complex systems
- Subgraphs and well‐quasi‐ordering
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Verification, Model Checking, and Abstract Interpretation
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Well-structured transition systems everywhere!
Cited in
(3)
This page was built for publication: Parameterized verification of monotone information systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1798673)
