scientific article

zbMath0575.68042MaRDI QIDQ3694687

Amir Pnueli

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treesequivalences

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (41)

A semantic characterization for faults in replicated systems ⋮ Refinement-oriented probability for CSP ⋮ Automatizing parametric reasoning on distributed concurrent systems ⋮ Designing equivalent semantic models for process creation ⋮ Bounded model checking of ETL cooperating with finite and looping automata connectives ⋮ The complexity of reasoning about knowledge and time. I: Lower bounds ⋮ Characterizing finite Kripke structures in propositional temporal logic ⋮ Concurrency and atomicity ⋮ Terminal metric spaces of finitely branching and image finite linear processes ⋮ A functorial semantics for observed concurrency ⋮ A state/event-based model-checking approach for the analysis of abstract system properties ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Branching vs. Linear Time: Semantical Perspective ⋮ Latticed Simulation Relations and Games ⋮ Pointfree expression and calculation: From quantification to temporal logic ⋮ A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories ⋮ A refinement calculus for specifications in Hennessy-Milner logic with recursion ⋮ Proof systems for satisfiability in Hennessy-Milner logic with recursion ⋮ Algebraic specification of concurrent systems ⋮ Bisimulation through probabilistic testing ⋮ Compositionality and bisimulation: A negative result ⋮ Translations between modal logics of reactive systems ⋮ Petri net semantics of priority systems ⋮ A compositional protocol verification using relativized bisimulation ⋮ Experimenting with process equivalence ⋮ Graphical versus logical specifications ⋮ Transition system specifications with negative premises ⋮ The expressive power of implicit specifications ⋮ Structured operational semantics and bisimulation as a congruence ⋮ Fair simulation ⋮ Algebraic characterizations of trace and decorated trace equivalences over tree-like structures ⋮ Modal logics for communicating systems ⋮ From Philosophical to Industrial Logics ⋮ Refusal testing ⋮ From Monadic Logic to PSL ⋮ A linear-time-branching-time spectrum for behavioral specification theories ⋮ LOTOS extended with probabilistic behaviours ⋮ Encoding safety in \(\mathrm{CLL}_R\) ⋮ Fair simulation ⋮ Priorities in process algebras ⋮ Automated formal analysis and verification: an overview

This page was built for publication: