Approaching the coverability problem continuously

DOI10.1007/978-3-662-49674-9_28zbMath1420.68144arXiv1510.05724OpenAlexW2222821827MaRDI QIDQ2272922

Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad

Publication date: 17 September 2019

Full work available at URL: https://arxiv.org/abs/1510.05724

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Structural Invariants for the Verification of Systems with Parameterized Architectures ⋮ Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Context-free commutative grammars with integer counters and resets ⋮ Linear equations for unordered data vectors in $[D^k\to{}Z^d$] ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Occam's razor applied to the Petri net coverability problem ⋮ Computing parameterized invariants of parameterized Petri nets

This page was built for publication: Approaching the coverability problem continuously