Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
From MaRDI portal
Publication:1870865
DOI10.1016/S0167-6423(02)00094-1zbMath1026.68098OpenAlexW2026591657MaRDI QIDQ1870865
Radu Mateescu, Mihaela Sighireanu
Publication date: 14 May 2003
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6423(02)00094-1
verificationmodel-checkingtemporal logicspecificationmu-calculusBoolean equation systemlabeled transition systemdiagnostic
Related Items (18)
Model checking a cache coherence protocol of a Java DSM implementation ⋮ Embedding of biological regulatory networks and property preservation ⋮ Translating FSP into LOTOS and networks of automata ⋮ Modeling and efficient verification of wireless ad hoc networks ⋮ Analysis of a distributed system for lifting trucks. ⋮ Model Checking Contracts – A Case Study ⋮ Sequential and distributed on-the-fly computation of weak tau-confluence ⋮ Extended beam search for non-exhaustive state space analysis ⋮ Computation Tree Regular Logic for Genetic Regulatory Networks ⋮ CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes ⋮ Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous ⋮ CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks ⋮ Verification of mobile ad hoc networks: an algebraic approach ⋮ A Formal Language for Electronic Contracts ⋮ Transactional Reduction of Component Compositions ⋮ Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal ⋮ Evaluation of cyber security and modelling of risk propagation with Petri nets ⋮ Compositional verification of asynchronous concurrent systems using CADP
Uses Software
This page was built for publication: Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
