Parameterized verification of monotone information systems
DOI10.1007/s00165-018-0460-8zbMath1398.68334OpenAlexW2883153098MaRDI QIDQ1798673
Raphaël Chane-Yack-Fa, Amel Mammar, Alain Finkel, Marc Frappier
Publication date: 23 October 2018
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-018-0460-8
process algebramodel checkinginformation systemswell-quasi-orderingwell-structured transition systemscoverabilityparameterized verification
Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Graph minors XXIII. Nash-Williams' immersion conjecture
- A theory of structural stationarity in the \(\pi\)-calculus
- Statecharts: a visual formalism for complex systems
- On the reachability problem for 5-dimensional vector addition systems
- All for the Price of Few
- A General Framework for Well-Structured Graph Transformation Systems
- Parameterized Verification of Ad Hoc Networks
- Process algebra for synchronous communication
- Subgraphs and well‐quasi‐ordering
- Communicating sequential processes
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Tools and Algorithms for the Construction and Analysis of Systems
- Ordering by Divisibility in Abstract Algebras
- Verification, Model Checking, and Abstract Interpretation
- Well-structured transition systems everywhere!
This page was built for publication: Parameterized verification of monotone information systems
