Deciding Bisimulation-Like Equivalences with Finite-State Processes

JANČAR, Petr, Antonín KUČERA and Mayr RICHARD. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Technical Report TUM. Germany: Technical University Munich, 1998, vol. 1998, TUM-I9805, p. 1-24.

Basic information

• Original name: Deciding Bisimulation-Like Equivalences with Finite-State Processes
• Authors: JANČAR, Petr, Antonín KUČERA and Mayr RICHARD.
• Edition: Technical Report TUM, Germany, Technical University Munich, 1998.

Other information

• Original language: English
• Type of outcome: Article in a journal
• Field of Study: 20206 Computer hardware and architecture
• Country of publisher: Germany
• Confidentiality degree: is not subject to a state or trade secret
• RIV identification code: RIV/00216224:14330/98:00001759
• Organization unit: Faculty of Informatics
• UT WoS: 000082774400018
• Keywords in English: process algebras; bisimilarity; finite-state systems
• Tags: bisimilarity, finite-state systems, process algebras

Links

• GA201/97/0456, research and development project: Name: Meze algoritmické verifikovatelnosti nekonečně stavových systémů

Investor: Czech Science Foundation, Algorithmic Verification Boundaries for Infinite-State Systems

• GA201/98/P046, research and development project: Name: Rozhodnutelné problémy v algebrách procesů

Investor: Czech Science Foundation, (Un)decidable Problems in Process Algebras

• MSM 143300001, plan (intention): Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů

Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing