scientific article; zbMATH DE number 1927558

MaRDI QIDQ4484482zbMATH OpenFDO

Authors Marcus Nilsson, Julien d'Orso, Parosh A. Abdulla, Bengt Jonsson

Publication date 12 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2421/24210116.htm

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)

Recommendations

• Regular model checking revisited
• scientific article; zbMATH DE number 1670791
• CONCUR 2004 - Concurrency Theory
• Regular model checking: evolution and perspectives
• Regular model checking using widening techniques
• Computer Aided Verification
• Regular model checking with regular relations
• scientific article; zbMATH DE number 2080188
• Practical Efficient Modular Linear-Time Model-Checking

Cited in

(22)

• Approximated parameterized verification of infinite-state processes with global conditions
• Iterating transducers
• View abstraction for systems with component identities
• Tree regular model checking: a simulation-based approach
• Parameterised verification for multi-agent systems
• Easy instances for model checking
• Automated formal analysis and verification: an overview
• Model checking parameterized systems
• Efficiency of automata in semi-commutation verification techniques
• Practical Efficient Modular Linear-Time Model-Checking
• Automatic Verification of Directory-Based Consistency Protocols
• scientific article; zbMATH DE number 1538041 (Why is no real title available?)
• Monotonic abstraction in parameterized verification
• Handling Parameterized Systems with Non-atomic Global Conditions
• Monotonic Abstraction in Action
• Tools and Algorithms for the Construction and Analysis of Systems
• Algorithmic improvements in regular model checking.
• Simplifying Alternating Automata for Emptiness Testing
• Computing inductive invariants of regular abstraction frameworks
• Antichain with SAT and tries
• Regular model checking upside-down: an invariant-based approach
• Regular model checking for systems with effectively regular reachability relation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484482)