The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Reasoning about knowledge
Branching time and partial order in temporal logics
Time and logic
A v-Calculus with Local Views for Systems of Sequential Agents
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Local Knowledge Assertions in a Changing World
Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge
A Trace Consistent Subset of PTL
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Model-Checking of causality properties
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
An Expressive Extension of TLC
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
LTL Is Expressively Complete for Mazurkiewicz Traces
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Reasoning about Message Passing in Finite State Environments
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reasoning about Layered Message Passing Systems
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Composing Specifications for Coordination
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Safety and liveness properties for real traces and a direct translation from LTL to monoids
Formal and natural computing
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Difficult Configurations—On the Complexity of LTrL
Formal Methods in System Design
From local to global temporal logics over Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
Generalization of some properties of relations in the context of functional temporal×modal logic
International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
Historical and computational aspects of paraconsistency in view of the logic foundation of databases
Proceedings of the 2nd international conference on Semantics in databases
Automata for Epistemic Temporal Logic with Synchronous Communication
Journal of Logic, Language and Information
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
Mathematical models of object-based distributed systems
Formal modeling
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Reasoning about layered message passing systems
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
We study linear time temporal logics of multiple agents, where the temporal modalities are local. These modalities not only refer to local next-instants and local eventuality, but also global views of agents at any local instant, which are updated due to communication from other agents. Thus agents also reason about the future, present and past of other agents in the system. The models for these logics are simple : runs of networks of synchronizing automata. Problems like gossipping in interconnection networks are naturally described in the logics proposed here. We present solutions to the satisfiability and model checking problems for these logics. Further, since formulas are insensitive to different interleavings of runs, partial order based verification methods become applicable for properties described in these logics.