Verification and comparison of transition systems

DOI10.1007/3-540-56610-4_60zbMATH Open1497.68325OpenAlexW1531571467MaRDI QIDQ5044730FDOQ5044730

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

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

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)

Cites Work

• Title not available (Why is that?)
• Parallel program schemata
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A calculus of communicating systems
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Communicating sequential processes
• “Sometimes” and “not never” revisited
• Formal verification of parallel programs
• Notes on finite asynchronous automata
• Deciding full branching time logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• A linear algorithm to solve fixed-point equations on transition systems
• On Ianov's Program Schemata
• Title not available (Why is that?)
• A distributed operational semantics of CCS based on condition/event systems
• Title not available (Why is that?)
• An algebraic and algorithmic method for analysing transition systems
• An algebraic characterization of transition system equivalences
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• Equivalence checking 40 years after: a review of bisimulation tools
• From event-oriented models to transition systems
• Quantales, finite observations and strong bisimulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)