scientific article

Jan Friso Groote, Frits W. Vaandrager

Publication date: 18 May 1993

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

model checking computation tree logic relational coarsest partition with stuttering

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation, Generating BDDs for symbolic model checking in CCS, Computing Stuttering Simulations, Cones and foci: A mechanical framework for protocol verification, Deciding true concurrency equivalences on safe, finite nets, Parity game reductions, Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications, Complexity of equivalence problems for concurrent systems of finite agents, Timing and causality in process algebra, On the probabilistic bisimulation spectrum with silent moves, A complete axiomatization of weighted branching bisimulation, Translating FSP into LOTOS and networks of automata, Essential transitions to bisimulation equivalences, Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof, Back-and-forth in space: on logics and bisimilarity in closure spaces, Equivalence checking 40 years after: a review of bisimulation tools, Apartness and distinguishing formulas in Hennessy-Milner logic, Team equivalences for finite-state machines with silent moves, Generalizing the Paige-Tarjan algorithm by abstract interpretation, On the Minimisation of Acyclic Models, An efficient simulation algorithm on Kripke structures, Compositionality in state space verification methods, Deciding bisimilarity and similarity for probabilistic processes., Deciding orthogonal bisimulation, Polynomial time decision algorithms for probabilistic automata, Confluence reduction for Markov automata, Computing maximal weak and other bisimulations, Experimenting with process equivalence, On the semantics of polychronous polytimed specifications, An O(m log n) algorithm for branching bisimilarity on labelled transition systems, Causal Semantics for BPP Nets with Silent Moves, Automatic verification of distributed systems: the process algebra approach., Unnamed Item, Investigating single-type structural elements of a component Petri net during component modeling and analysis of a complex system with parallelism, Branching bisimulation for probabilistic systems: characteristics and decidability, Inheritance of behavior, Smaller Abstractions for ∀CTL* without Next, Verification of reactive systems via instantiation of parameterised Boolean equation systems, On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems, Unnamed Item, Inheritance of workflows: An approach to tackling problems related to change, Checking equivalences between concurrent systems of finite agents (Extended abstract), Folk Theorems on the Correspondence between State-Based and Event-Based Systems, Thread algebra for noninterference, Unnamed Item, Branching Bisimulation Games, Game-theoretic simulation checking tool, Branching bisimulation congruence for probabilistic systems, Raiders of the lost equivalence: probabilistic branching bisimilarity, Unnamed Item, A partial order approach to branching time logic model checking., Compositional verification of asynchronous concurrent systems using CADP, Proving finiteness of CCS processes by non-standard semantics