Effective decomposability of sequential behaviours

DOI10.1016/S0304-3975(98)00201-1zbMath0944.68065WikidataQ127174024 ScholiaQ127174024MaRDI QIDQ1575536

Antonín Kučera

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

parallelizationconcurrencyinfinite-state systemsbisimilarity

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Deciding bisimulation-like equivalences with finite-state processes ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unique decomposition of processes
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• Decidability of bisimulation equivalence for process generating context-free languages
• Process Algebra
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes

This page was built for publication: Effective decomposability of sequential behaviours