A unified approach for studying the properties of transition systems

DOI10.1016/0304-3975(82)90067-6zbMath0478.68056OpenAlexW1971321632WikidataQ126438920 ScholiaQ126438920MaRDI QIDQ1161289

Joseph Sifakis

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90067-6

zbMATH Keywords

concurrent systemsinvariantsreachabilitysystems verificationfixed points of continuous predicate transformers

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)

Related Items (4)

A linear algorithm to solve fixed-point equations on transition systems ⋮ SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR ⋮ Symbolic computation in automated program reasoning ⋮ Modal logics for communicating systems

Cites Work

• Correctness of parallel programs: The Church-Rosser approach
• On reduction of asynchronous systems
• Formal derivation of strongly correct concurrent programs
• A lattice-theoretical fixpoint theorem and its applications
• On folk theorems
• Synthesis of Resource Invariants for Concurrent Programs
• Self-stabilizing systems in spite of distributed control
• Guarded commands, nondeterminacy and formal derivation of programs
• Formal verification of parallel programs
• Some Properties of Predicate Transformers
• Programming as a Discipline of Mathematical Nature
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A unified approach for studying the properties of transition systems