Towards action-refinement in process algebras
Information and Computation
A process algebra for timed systems
Information and Computation
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Communication and Concurrency
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Continuous Clock Synchronization in Wireless Real-Time Applications
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Time-diffusion synchronization protocol for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Global Clock Synchronization in Sensor Networks
IEEE Transactions on Computers
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Tiny-sync: Tight time synchronization for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Restricted Broadcast Process Theory
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
A Calculus for Mobile Ad-hoc Networks with Static Location Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic barbs and biorthogonality
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Equational reasoning on ad hoc networks
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Depletable channels: dynamics and behaviour
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A calculus for the analysis of wireless network security protocols
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
A process calculus for dynamic networks
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
A calculus of trustworthy ad hoc networks
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Observables for mobile and wireless broadcasting systems
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
A semantic analysis of wireless network security protocols
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Modelling probabilistic wireless networks
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Verification of ad hoc networks with node and communication failures
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
A semantic analysis of key management protocols for wireless sensor networks
Science of Computer Programming
| Hi-index | 0.00 |
We propose a timed process calculus for wireless systems, paying attention in modelling communication collisions. The operational semantics of our calculus is given in terms of a labelled transition system. The calculus enjoys a number of desirable time properties such as (i) time determinism: the passage of time is deterministic; (ii) patience: devices will wait indefinitely until they can communicate; (iii) maximal progress: data transmissions cannot be delayed, they must occur as soon as a possibility for communication arises. The main behavioural equality of our calculus is a timed variant of barbed congruence, a standard branching-time and contextually-defined program equivalence. As an efficient proof method for timed barbed congruence we define a labelled bisimilarity. We then apply our bisimulation proof-technique to prove a number of algebraic properties.