Modal and temporal logics for processes
From MaRDI portal
Cites work
- A calculus of communicating systems
- A calculus of mobile processes. II
- A subexponential randomized algorithm for the simple stochastic game problem
- Algebraic laws for nondeterminism and concurrency
- Algèbre de processus et synchronisation
- An automata theoretic decision procedure for the propositional mu- calculus
- Automated analysis of mutual exclusion algorithms using CCS
- Bisimulation and divergence
- Calculi for synchrony and asynchrony
- Can message buffers be axiomatized in linear temporal logic?
- CCS expressions, finite state processes, and three problems of equivalence
- Characterizing finite Kripke structures in propositional temporal logic
- Finite representations of CCS and TCSP programs by automata and Petri nets
- Higher-level synchronising devices in Meije-SCCS
- scientific article; zbMATH DE number 4035115 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3688686 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 3714896 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 52748 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 177815 (Why is no real title available?)
- scientific article; zbMATH DE number 1028833 (Why is no real title available?)
- scientific article; zbMATH DE number 4119652 (Why is no real title available?)
- scientific article; zbMATH DE number 3349291 (Why is no real title available?)
- scientific article; zbMATH DE number 3413799 (Why is no real title available?)
- Local model checking for infinite state spaces
- Local model checking in the modal mu-calculus
- Modal logics for communicating systems
- Process Algebra
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Results on the propositional \(\mu\)-calculus
- Specifying Concurrent Program Modules
- Temporal logic can be more expressive
- The complexity of stochastic games
- Transition system specifications with negative premises
Cited in
(2)
This page was built for publication: Modal and temporal logics for processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560391)