scientific article; zbMATH DE number 4119603

MaRDI QIDQ4733387zbMATH OpenFDO

Authors Colin Stirling

Publication date 1989

zbMATH Keywords

Calculus of Communicating Systems (CCS)modal logictemporal logictransition systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Theory of operating systems (68N25) Semantics in the theory of computing (68Q55) 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

• Compositionality and bisimulation: A negative result
• Reactive Systems
• A CALCULUS OF TIMED COMMUNICATING SYSTEMS
• Modal logics for communicating systems
• Three logics for branching bisimulation

Cited in

(29)

• A logic for the specification and proof of regular controllable processes of CCS
• Duality for modal \(\mu\)-logics
• Local model checking in the modal mu-calculus
• Compositionality and bisimulation: A negative result
• Local model checking for infinite state spaces
• Observational structures and their logic
• R-generability, and definability in branching time logics
• Finitary logics for some CCS observational bisimulations
• The formalization and analysis of a communications protocol
• A causal semantics for CCS via rewriting logic
• Model checking properties on reduced trace systems
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Selective mu-calculus and formula-based equivalence of transition systems
• scientific article; zbMATH DE number 3930336 (Why is no real title available?)
• Three logics for branching bisimulation
• Comparing some Intuitions of 'Process Calculus' and 'Program Logic'
• Decidability of a partial order based temporal logic
• Free shuffle algebras in language varieties extended abstract
• Formal verification of concurrent systems via directed model checking
• Model checking in the modal -calculus and generic solutions
• Free shuffle algebras in language varieties
• Undecidability of bisimilarity for Petri nets and some related problems
• Trapping mutual exclusion in the box calculus
• A CCS-based investigation of deadlock in a multi-process electronic mail system
• Abstract reduction in directed model checking CCS processes
• Reduced models for efficient CCS verification
• \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes
• Incremental model checking of delta-oriented software product lines
• Automated analysis of mutual exclusion algorithms using CCS

This page was built for publication:

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