Approximately satisfied properties of systems and simple language homomorphisms
References (10)
- et al.
Defining liveness
Inform. Process. Lett.
(1985) Verification and behaviour abstraction — Towards a tractable verification technique for large distributed systems
J. Systems Software
(1996)- et al.
The existence of refinement mappings
General Topology
(1955)
There are more references available in the full text version of this article.
Cited by (16)
A power-set construction for reducing Büchi automata to non-determinism degree two
2007, Information Processing LettersAbstract interpretation of trace semantics for concurrent calculi
1999, Information Processing LettersApplication of formal verification and behaviour abstraction to the service interaction problem in intelligent networks
1998, Journal of Systems and SoftwareTowards the construction of an abstract state-space from a partial-order representation of the concrete one
1998, Electronic Notes in Theoretical Computer ScienceSecurity requirements for uniformly parameterised cooperations
2012, Proceedings - 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2012Security properties of self-similar uniformly parameterised systems of cooperations
2011, Proceedings - 19th International Euromicro Conference on Parallel, Distributed, and Network-Based Processing, PDP 2011
- 1
On leave to Institut für Informatik, Universität Zürich, Switzerland. Ulrich Nitsche was supported by a DAAD-fellowship HSP II/AUFE.
Copyright © 1996 Published by Elsevier B.V.