Failure-equivalent transformation of transition systems to avoid internal actions

DOI10.1016/0020-0190(92)90110-HzbMATH Open0795.68145OpenAlexW2055603670MaRDI QIDQ1209375FDOQ1209375

Authors: Gang Luo, Gregor von Bochmann, Anindya Das, Cheng Wu 

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90110-h

Recommendations

• scientific article; zbMATH DE number 557977
• Equivalence preserving transformations for timed transition models
• Extensional equivalences for transition systems
• Theoretical Aspects of Computing - ICTAC 2004
• Verification and comparison of transition systems

zbMATH Keywords

process algebralabelled transition systemsLOTOSsoftware validationfailure equivalenceinternal actionsdistributed software systems

Mathematics Subject Classification ID

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

Cites Work

• Communicating sequential processes
• A Theory of Communicating Sequential Processes
• Extensional equivalences for transition systems
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Title not available (Why is that?)

Uses Software

• LOTOS

This page was built for publication: Failure-equivalent transformation of transition systems to avoid internal actions

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