Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
A model and temporal proof system for networks of processes
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Software Development: A Rigorous Approach
Software Development: A Rigorous Approach
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Testing Equivalence for Processes
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Automatic Verification of Asynchronous Circuits
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
A Semantics and Proof System for Communicating Processes
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Proceedings of the Conference on Logic of Programs
Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Now you may compose temporal logic specifications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Full abstraction of a real-time denotational semantics for an OCCAM-like language
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fairness in parallel programs: the transformational approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
A simple approach to specifying concurrent systems
Communications of the ACM
A predicate transformer approach to semantics of parallel programs
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Predicates are predicate transformers: a unified compositional theory for concurrency
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A propositional modal logic of time intervals
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling temporal primitives: back to basics
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Agent-oriented software engineering: the state of the art
First international workshop, AOSE 2000 on Agent-oriented software engineering
External attribution of intentional notions to explain and predict agent behaviour
Proceedings of the fifth international conference on Autonomous agents
Theoretical Computer Science
Finite variability interpretation of monadic logic of order
Theoretical Computer Science
Multi-Dimensional Modal Logic as a Framework for Spatio-Temporal Reasoning
Applied Intelligence
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
The complexity of the temporal logic with "until" over general linear time
Journal of Computer and System Sciences
Theoretical Computer Science
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
A unifying semantics for time and events
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Temporal Development Methods for Agent-Based
Autonomous Agents and Multi-Agent Systems
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Specifying deadlines with continuous time using deontic and temporal logic
International Journal of Electronic Commerce - Special issue: Formal aspects of digital commerce
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Temporal logics with incommensurable distances are undecidable
Information and Computation
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Impartial Anticipation in Runtime-Verification
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Information and Computation
Temporal logic motion planning for dynamic robots
Automatica (Journal of IFAC)
Bounded Model Checking for All Regular Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
A conceptual model of fuzzy temporal databases: algebra
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Hierarchical synthesis of hybrid controllers from temporal logic specifications
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Complexity of metric temporal logics with counting and the Pnueli modalities
Theoretical Computer Science
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
A proof system for the linear time μ-calculus
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Expressiveness of metric modalities for continuous time
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Regular linear temporal logic with past
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
An expressive temporal logic for real time
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
ProMAS'05 Proceedings of the Third international conference on Programming Multi-Agent Systems
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Axiomatizations Of Interval Logics
Fundamenta Informaticae
Completeness And Soundness Of Axiomatizations For Temporal Logics Without Next
Fundamenta Informaticae
Linear time logics around PSL: complexity, expressiveness, and a little bit of succinctness
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.02 |
In this paper we advance the radical notion that a computational model based on the reals provides a more abstract description of concurrent and reactive systems, than the conventional integers based behavioral model of execution sequences. The real model is studied in the setting of temporal logic, and we illustrate its advantages by providing a fully abstract temporal semantics for a simple concurrent language, and an example of verification of a concurrent program within the real temporal logic defined here. It is shown that, by imposing the crucial condition of finite variability, we achieve a balanced formalism that is insensitive to finite stuttering, but can recognize infinite stuttering, a distinction which is essential for obtaining a fully abstract semantics of non-terminating processes. Among other advantages, going into real-based semantics obviates the need for the controversial representation of concurrency by interleaving, and most of the associated fairness constraints.