An algebraic and algorithmic method for analysing transition systems

DOI10.1016/0304-3975(86)90034-4MaRDI QIDQ1822237zbMATH OpenOpenAlexFDO

Authors Anne Dicky

Publication date 1986

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(86)90034-4

zbMATH Keywords

concurrent processeseffectively computable functionsexpressive powermu-calculuspower algebrastemporal logicstransition systems

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of operating systems (68N25) Abstract data types; algebraic specification (68Q65)

Review text

To describe significant properties of concurrent processes a formal algebra is defined whose terms are interpreted, in transition systems, as effectively computable functions of power algebras of sets of states and transitions. We study the expressive power of this formal system and compare it with temporal logics.

Recommendations

• scientific article; zbMATH DE number 139604
• Algebraic laws for nondeterminism and concurrency
• An algebraic characterization of transition system equivalences
• scientific article; zbMATH DE number 4064457
• Process algebra and model checking

Cites work

• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• scientific article; zbMATH DE number 3856434 (Why is no real title available?)
• Results on the propositional \(\mu\)-calculus

Cited in

(16)

• A linear algorithm to solve fixed-point equations on transition systems
• Nivat's processes and their synchronization
• A deductive approach towards reasoning about algebraic transition systems
• Injective envelope and parallel decomposition of a transition system
• An algebraic characterization of transition system equivalences
• An approximation algorithm for box abstraction of transition systems on real state spaces
• Algebraic approach to the analysis of automaton systems of interconnected graphs with simple links
• scientific article; zbMATH DE number 3876597 (Why is no real title available?)
• scientific article; zbMATH DE number 4033050 (Why is no real title available?)
• scientific article; zbMATH DE number 139604 (Why is no real title available?)
• scientific article; zbMATH DE number 2000405 (Why is no real title available?)
• Static analysis of IMC
• scientific article; zbMATH DE number 2087444 (Why is no real title available?)
• An even faster solver for general systems of equations
• Verification and comparison of transition systems
• Analysis of the structure of attributed transition systems without hidden transitions

This page was built for publication: An algebraic and algorithmic method for analysing transition systems

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