POEM

swMATH3469MaRDI QIDQ16001FDOQ16001

Author name not available (Why is that?)

Described by source

• The Implementation of Mazurkiewicz Traces in POEM

Cited In (7)

• Zone-based verification of timed automata: extrapolations, simulations and what next?
• Unfoldings: A partial-order approach to model checking.
• Using non-convex approximations for efficient analysis of timed automata
• Exploiting step semantics for efficient bounded model checking of asynchronous systems
• Stronger Reduction Criteria for Local First Search
• A Nice labelling for tree-like event structures of degree 3
• SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata

This page was built for software: POEM