Deciding LTL over Mazurkiewicz traces
Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
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
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
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
Locally linear time temporal logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Logical Model for Coordination Rule Classes in Collaborative Sessions
WETICE '03 Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Efficient Decentralized Monitoring of Safety in Distributed Systems
Proceedings of the 26th International Conference on Software Engineering
Deciding Global Partial-Order Properties
Formal Methods in System Design
Difficult Configurations—On the Complexity of LTrL
Formal Methods in System Design
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
CONCUR 2005 - Concurrency Theory
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
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Testing Distributed Systems Through Symbolic Model Checking
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Logics and Bisimulation Games for Concurrency, Causality and Conflict
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Enforcing Concurrent Temporal Behaviors
Electronic Notes in Theoretical Computer Science (ENTCS)
Truly Concurrent Logic via In-Between Specification
Electronic Notes in Theoretical Computer Science (ENTCS)
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
Propositional dynamic logic for message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
Information and Computation
Decentralized runtime analysis of multithreaded applications
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Deciding properties of message sequence charts
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
FM'06 Proceedings of the 14th international conference on Formal Methods
Reasoning about layered message passing systems
Computer Languages, Systems and Structures
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Adding Partial Orders to Linear Temporal Logic
Fundamenta Informaticae
Requirements Traceability within Model-Based Testing: Applying Path Fragments and Temporal Logic
International Journal of Embedded and Real-Time Communication Systems
| Hi-index | 0.00 |
A temporal logic for causality (TLC) is introduced. The logic is interpreted over causal structures corre- sponding to partial order executions of programs. For causal structures describing the behavior of a finite fixed set of processes, a TLC-formula can, equivalently, be interpreted over their linearizations. The main result of the paper is a tableau construction that gives a singly-exponential translation from a TLC formula cp to a Streett automaton that accepts the set of linearizations satisfying cp. This allows both checking the validity of TLC formulas and model-checking of program properties. As the logic TLC does not distinguish among different linearizations of the same partial order execution, partial order reduction techniques can be applied to alleviate the state-space explosion problem of model-checking.