Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
An introduction to LOTOS: learning by examples
Computer Networks and ISDN Systems - Formal description technique (FDT) languages for protocols
A toolbox for the verification of LOTOS programs
ICSE '92 Proceedings of the 14th international conference on Software engineering
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Modal and temporal logics for processes
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
On the design of side-stick controllers in fly-by-wire aircraft
ACM SIGAPP Applied Computing Review - Special issue on saftey-critical software
A Validation Environment for LOTOS
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Specifying Properties of Basic LOTOS Processes Using Temporal Logic
Proceedings of the IFIP TC6 Eighth International Conference on Formal Description Techniques VIII
CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
A Modal Logic for Message passing Processes (Extended Abstract)
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Experiences with specification and verification in LOTOS: a report on two case studies
WIFT '95 Proceedings of the 1st Workshop on Industrial-Strength Formal Specification Techniques
Formal Specification and Proof Techniques for Mixed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
| Hi-index | 0.00 |
We present a version of HML [7], adapted to allow description of properties of Full LOTOS [8] specifications using symbolic values and conditions in modal formulae as well as concrete data values. In modifying HML we especially consider the features of LOTOS which distinguish it from other process algebras and discuss how these alter the requirements of the logic, and how this in turn is reflected in the semantics of the logic. Our logic is given in relation to a late symbolic semantics for Full LOTOS, clearly separating the process reasoning from the data reasoning. This work is motivated by our experiences of using LOTOS in several different applications [10, 15], in which we have identified a clear need for temporal reasoning about symbolic, and possibly partial, LOTOS specifications.