Efficient Graph-Based Algorithms For Model Checking In The Modal Mu-Calculus

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Model Checking Real-Time Systems

  2018cited by this paper
• RESULTS ON THE PROPOSITIONAL’p-CALCULUS

  2001cited by this paper
• Theories of Programming Languages: Communicating Sequential Processes

  1998cited by this paper
• An Efficient Algorithm for Minimizing Real-Time Transition Systems

  1997cited by this paper
• Eecient Local Model-checking for Fragments of the Modal -calculus

  1996cited by this paper
• The symbolic model-checking for real-time systems

  1996cited by this paper
• Bounded Incremental Computation

  1996cited by this paper
• UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems

  1996cited by this paper
• CTR: A Calculus of Timed Refinement

  1995cited by this paper
• Local Model Checking for Real-Time Systems (Extended Abstract)

  1995cited by this paper
• From Timed Automata to Logic - and Back

  1995cited by this paper
• The Concurrency Factory - Practical Tools for Specification, Stimulation, Verification, and Implementation of Concurrent Systems

  1994cited by this paper
• Efficient Computation of Nested Fix-Points, with Applications to Model Checking

  1994cited by this paper
• Multiprocessor system architectures : a technical survey of multiprocessor, multithreaded systems using SPARC, multilevel bus architectures and Solaris (SunOS)

  1994cited by this paper
• A Theory of Timed Automata

  1994cited by this paper
• An Improved Algorithm for the Evaluation of Fixpoint Expressions

  1994cited by this paper
• Incremental Model Checking in the Modal Mu-Calculus

  1994cited by this paper
• On Model-Checking for Fragments of µ-Calculus

  1993cited by this paper
• Timed Modal Specification - Theory and Tools

  1993cited by this paper
• Automatic Veriication of Nite-state Concurrent Systems Using Temporal-logic Speciications. Acm

  1993cited by this paper
• A linear-time model-checking algorithm for the alternation-free modal mu-calculus

  1993cited by this paper
• Minimization of Timed Transition Systems

  1992cited by this paper
• A Linear Algorithm for Solving Fixed-Point Equations on Transition Systems

  1992cited by this paper
• Faster Model Checking for the Modal Mu-Calculus

  1992cited by this paper
• Model Checking and Boolean Graphs

  1992cited by this paper
• Decidability of Bisimulation Equivalences for Parallel Timer Processes

  1992cited by this paper
• Behavioural Abstraction in TCCS

  1992cited by this paper
• Logics and Models of Real Time: A Survey

  1991cited by this paper
• Real-Time: Theory in Practice

  1991cited by this paper
• An Overview and Synthesis on Timed Process Algebras

  1991cited by this paper
• Local Model Checking in the Modal mu-Calculus

  1991cited by this paper
• Deciding Properties of Regular Real Time Processes

  1991cited by this paper
• An Introduction to Modal and Temporal Logics for CCS

  1991cited by this paper
• Calculus of Communicating Systems

  1991cited by this paper
• A calculus of real time systems

  1991cited by this paper
• Incremental evaluation of computational circuits

  1990cited by this paper
• ATP: an Algebra for Timed Processes

  1990cited by this paper
• Process algebra

  1990cited by this paper
• Explicit clock temporal logic

  1990cited by this paper
• A Temporal Calculus of Communicating Systems

  1990cited by this paper
• Real-time logics: complexity and expressiveness

  1990cited by this paper
• Temporal Logic of Real-time Systems

  1990cited by this paper
• Timing Assumptions and Verification of Finite-State Concurrent Systems

  1989cited by this paper
• Symbolic model checking: 1020 states and beyond

  1989cited by this paper
• An Incremental Version of Iterative Data Flow Analysis

  1989cited by this paper
• Verification of Synchronous Sequential Machines Based on Symbolic Execution

  1989cited by this paper
• Communication and concurrency

  1989cited by this paper
• A really temporal logic

  1989cited by this paper
• Conditions for incremental iteration: Examples and counterexamples

  1988cited by this paper
• A fast mutual exclusion algorithm

  1987cited by this paper
• Temporal Logic of Programs

  1987cited by this paper
• Hierarchical correctness proofs for distributed algorithms

  1987cited by this paper
• A Timed Model for Communicating Sequential Processes

  1986cited by this paper
• A proposal for standard ML

  1984cited by this paper
• CCS expressions, finite state processes, and three problems of equivalence

  1983cited by this paper
• Propositional Dynamic Logic of Regular Programs

  1979cited by this paper
• private communication

  1969cited by this paper

• Revisiting sequential composition in process calculi

  2015cites this paper
• Formal Guarantees for Localized Bug Fixes

  2013cites this paper
• Parametric model-checking in PMCGiosu

  2007cites this paper
• Integrating Formal Verification into the Embedded Software Development Process

  2004cites this paper
• Formal modelling and analysis of broadcasting embedded control systems

  2001cites this paper
• XTG-an engineering approach to modelling and analysis of real-time systems

  1998cites this paper
• Partial-Order Reduction in the Weak Modal Mu-Calculus

  1997cites this paper
• The Concurrency Factory: A Development Environment for Concurrent Systems

  1996cites this paper
• The Concurrency Factory Software Development Environment

  1996cites this paper