scientific article; zbMATH DE number 1392309

zbMath0945.68523MaRDI QIDQ4936148

Kedar S. Namjoshi, E. Allen Emerson

Publication date: 25 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (28)

Compositional analysis for verification of parameterized systems ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Parameterized model checking of rendezvous systems ⋮ Population protocols with unreliable communication ⋮ Well-structured languages ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ Parameterized verification of time-sensitive models of ad hoc network protocols ⋮ Well-abstracted transition systems: Application to FIFO automata. ⋮ Monotonic Abstraction for Programs with Dynamic Memory Heaps ⋮ Unnamed Item ⋮ Protocols with constant local storage and unreliable communication ⋮ Expressive Power of Broadcast Consensus Protocols ⋮ Running time analysis of broadcast consensus protocols ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ An Assertional Language for the Verification of Systems Parametric in Several Dimensions ⋮ On the \(\omega\)-language expressive power of extended Petri nets ⋮ State space analysis of Petri nets with relation-algebraic methods ⋮ Unnamed Item ⋮ Forward analysis for WSTS, part I: completions ⋮ Monotonic Abstraction in Parameterized Verification ⋮ Unnamed Item ⋮ Approximated parameterized verification of infinite-state processes with global conditions ⋮ Monotonic Abstraction in Action ⋮ Unnamed Item ⋮ Expand, enlarge and check: new algorithms for the coverability problem of WSTS ⋮ Narrowing and Rewriting Logic: from Foundations to Applications ⋮ Parameterised verification for multi-agent systems

This page was built for publication: