Proving properties of dynamic process networks
From MaRDI portal
Publication:1383156
DOI10.1006/inco.1997.2680zbMath0892.68034MaRDI QIDQ1383156
Publication date: 2 April 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/51691df44a4a06820fe79719e7782182e3d5bf40
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
On global induction mechanisms in aμ-calculus with explicit approximations, A Note on Negative Tagging for Least Fixed-Point Formulae, Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- A generalization of Owicki-Gries's Hoare logic for a concurrent while language
- An automata theoretic decision procedure for the propositional mu- calculus
- Tableau-based model checking in the propositional mu-calculus
- A note on model checking the modal \(\nu\)-calculus
- Local model checking in the modal mu-calculus
- Local model checking for infinite state spaces
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- Decidability of model checking for infinite-state concurrent systems
- Compositionality Through an Operational Semantics of Contexts
- Reasoning about higher-order processes
