CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113zbMATH Open1097.68577OpenAlexW2499482941MaRDI QIDQ5311486FDOQ5311486

Authors: Antonin Kučera, Philippe Schnoebelen 

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100113

Recommendations

• A general approach to comparing infinite-state systems with their finite-state specifications
• Automated Technology for Verification and Analysis
• Equivalence-checking with infinite-state systems: techniques and results
• An automata-theoretic approach to infinite-state systems
• On finite representations of infinite-state behaviours

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Generalization strategies for the verification of infinite state systems
• A general approach to comparing infinite-state systems with their finite-state specifications

This page was built for publication: CONCUR 2004 - Concurrency Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311486)