Verification and comparison of transition systems

DOI10.1007/3-540-56610-4_60MaRDI QIDQ5044730zbMATH OpenOpenAlexFDO

Authors André Arnold

Publication date 2 November 2022

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

Full work available at URL https://doi.org/10.1007/3-540-56610-4_60

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)

Recommendations

• scientific article; zbMATH DE number 515733
• scientific article; zbMATH DE number 557977
• Extensional equivalences for transition systems
• scientific article; zbMATH DE number 139604
• An algebraic and algorithmic method for analysing transition systems

Cites work

• scientific article; zbMATH DE number 3140027 (Why is no real title available?)
• scientific article; zbMATH DE number 3856434 (Why is no real title available?)
• scientific article; zbMATH DE number 3926231 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 125888 (Why is no real title available?)
• scientific article; zbMATH DE number 176729 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A calculus of communicating systems
• A distributed operational semantics of CCS based on condition/event systems
• A linear algorithm to solve fixed-point equations on transition systems
• Algebraic laws for nondeterminism and concurrency
• An algebraic and algorithmic method for analysing transition systems
• An algebraic characterization of transition system equivalences
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Communicating sequential processes
• Deciding full branching time logic
• Formal verification of parallel programs
• Notes on finite asynchronous automata
• On Ianov's Program Schemata
• Parallel program schemata
• “Sometimes” and “not never” revisited

Cited in

(8)

• scientific article; zbMATH DE number 139604 (Why is no real title available?)
• Equivalence checking 40 years after: a review of bisimulation tools
• From event-oriented models to transition systems
• Quantales, finite observations and strong bisimulation
• scientific article; zbMATH DE number 515733 (Why is no real title available?)
• scientific article; zbMATH DE number 7449995 (Why is no real title available?)
• Failure-equivalent transformation of transition systems to avoid internal actions
• Studying equivalences of transition systems with algebraic tools

This page was built for publication: Verification and comparison of transition systems

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