Compositional minimisation of finite state systems using interface specifications
From MaRDI portal
Publication:1816922
DOI10.1007/BF01211911zbMath0860.68067OpenAlexW1987298286MaRDI QIDQ1816922
Bernhard Steffen, Susanne Graf, Gerald Lüttgen
Publication date: 1 December 1996
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01211911
Related Items (15)
Deciding probabilistic automata weak bisimulation: theory and practice ⋮ Exploiting interleaving semantics in symbolic state-space generation ⋮ \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Component-aware input-output conformance ⋮ Decomposing monolithic processes in a process algebra with multi-actions ⋮ Bisimulation relations for weighted automata ⋮ Automatic Synthesis of Assumptions for Compositional Model Checking ⋮ Refined Interfaces for Compositional Verification ⋮ Contracts for BIP: Hierarchical Interaction Models for Compositional Verification ⋮ P-Semiflow Computation with Decision Diagrams ⋮ Compositional minimisation of finite state systems using interface specifications ⋮ AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS ⋮ Using heuristic search for finding deadlocks in concurrent systems ⋮ Compositional verification of asynchronous concurrent systems using CADP
Cites Work
- Property preserving abstractions for the verification of concurrent systems
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Compositional minimisation of finite state systems using interface specifications
- A compositional proof system on a category of labelled transition systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Compositional minimisation of finite state systems using interface specifications
