Springer Nature OA
open access
Extending a Linear Parallel Bisimulation Algorithm with Multi-way Splitting
Bisimulation checking entails identifying which states in a Labelled Transition System (LTS) are behaviourally equivalent. Such a check allows minimisation of an LTS, as well as comparing two LTSs. The classical sequential algorithm (KS) for bisimulation is due to Kannelakis & Smolka, with time comp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Lazy Arithmetic using Systolic Arrays for Closing the Verification Gap on Embedded Systems#381703
- Transformasi hukum bisnis di ekosistem digital: Studi atas perlindungan data pribadi konsumen#1017836
- Structure and Dynamics in Implementation of Computations#750693
- UCL facsimile system#220629
- 42 U.S.C. § 12879 — Implementation#589784
Record · ID 1360654
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive