Filters








23 Hits in 4.3 sec

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces [chapter]

Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2003 Lecture Notes in Computer Science  
In this paper, we show that it is possible to use unfiltered future modalities in conjunction with past constants and still obtain a logic that is expressively complete over traces.  ...  To obtain an expressively complete linear-time temporal logic (LTL) over Mazurkiewicz traces that is computationally tractable, we need to intepret formulas locally, at individual events in a trace, rather  ...  LTL without any past operators is expressively complete over words but this cannot be the case for traces: there exist two first-order inequivalent traces that cannot be distinguished using only future  ... 
doi:10.1007/978-3-540-45138-9_37 fatcat:67e3kyxonnelboo6bxkil3dqya

LTL Is Expressively Complete for Mazurkiewicz Traces

Volker Diekert, Paul Gastin
2002 Journal of computer and system sciences (Print)  
A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (linear temporal logic) is expressively complete with respect to the first order theory.  ...  We solve this problem positively for finite and infinite traces and for the simplest temporal logic, which is based only on next and until modalities.  ...  He proved that a linear temporal logic with both past and future modalities is expressively complete for finite traces but his approach did not cope with infinite traces.  ... 
doi:10.1006/jcss.2001.1817 fatcat:hnr3uxpqyzbvrfnvzzirz74eli

LTL Is Expressively Complete for Mazurkiewicz Traces [chapter]

Volker Diekert, Paul Gastin
2000 Lecture Notes in Computer Science  
A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (linear temporal logic) is expressively complete with respect to the first order theory.  ...  We solve this problem positively for finite and infinite traces and for the simplest temporal logic, which is based only on next and until modalities.  ...  He proved that a linear temporal logic with both past and future modalities is expressively complete for finite traces but his approach did not cope with infinite traces.  ... 
doi:10.1007/3-540-45022-x_18 fatcat:j3dr5b54vvbg3ljyxd2f3bpwve

Distributed Versions of Linear Time Temporal Logic: A Trace Perspective

P. S. Thiagarajan, Jesper G. Henriksen
1998 BRICS Report Series  
A system is said to satisfy a specification expressed as an LTL formula in case every computation of the system is a model of the formula.  ...  A basic feature of LTL is that its formulas are interpreted over sequences.  ...  In [34] the authors present proof rules for the logic ISTL with a trace semantics together with a relative expressive completeness result.  ... 
doi:10.7146/brics.v5i8.19280 fatcat:qfikxqgll5dc3bwqbd4qyyimuy

Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets [chapter]

Volker Diekert, Paul Gastin
2001 Lecture Notes in Computer Science  
Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in the word case.  ...  But now the difficult problem is to obtain expressive completeness results with respect to first order logic.  ...  In [27] it was shown that the basic (global) linear temporal logic with future tense operators and with past tense constants is expressively complete with respect to the first order theory of finite  ... 
doi:10.1007/3-540-45653-8_4 fatcat:lpznamftszfdbizotea5kwm34y

Local temporal logic is expressively complete for cograph dependence alphabets

Volker Diekert, Paul Gastin
2004 Information and Computation  
Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in the word case.  ...  But now the difficult problem is to obtain expressive completeness results with respect to first order logic.  ...  In [27] it was shown that the basic (global) linear temporal logic with future tense operators and with past tense constants is expressively complete with respect to the first order theory of finite  ... 
doi:10.1016/j.ic.2004.08.001 fatcat:w6dxltnqjjdifltipdwvdfdhn4

Pure future local temporal logics are expressively complete for Mazurkiewicz traces

Volker Diekert, Paul Gastin
2006 Information and Computation  
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively complete.  ...  This means every first-order definable language of Mazurkiewicz traces can be defined in a pure future local temporal logic.  ...  Corollary 27 Let L ⊆ R 1 be a language of real traces having a unique minimal vertex. The following assertions are equivalent: (1) The language L is expressible in FO Σ (<). Acknowledgement.  ... 
doi:10.1016/j.ic.2006.07.002 fatcat:lebsg4ijfjcudg2gw2i5mlbqfa

Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces [chapter]

Volker Diekert, Paul Gastin
2004 Lecture Notes in Computer Science  
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively complete.  ...  This means every first-order definable language of Mazurkiewicz traces can be defined in a pure future local temporal logic.  ...  Corollary 27 Let L ⊆ R 1 be a language of real traces having a unique minimal vertex. The following assertions are equivalent: (1) The language L is expressible in FO Σ (<). Acknowledgement.  ... 
doi:10.1007/978-3-540-24698-5_27 fatcat:sesyyx3mfjbtvgxrw7yjscxan4

Towards Partial Order Reductions for Strategic Ability

Wojciech Jamroga, Wojciech Penczek, Teofil Sidoruk, Piotr Dembiński, Antoni Mazurkiewicz
2020 The Journal of Artificial Intelligence Research  
We propose a general semantics for strategic abilities of agents in asynchronous systems, with and without perfect information.  ...  More importantly, we develop a methodology for partial order reduction in verification of agents with imperfect information.  ...  Acknowledgements We thank the anonymous reviewers for insightful comments.  ... 
doi:10.1613/jair.1.11936 fatcat:mkg3nsmh45fuhfabxid4jcqmba

Temporal logics for concurrent recursive programs: Satisfiability and model checking

Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
2014 Journal of Applied Logic  
We develop a general framework for the design of temporal logics for concurrent recursive programs. A program execution is modeled as a partial order with multiple nesting relations.  ...  This captures, in a unifying framework, a wide range of logics defined for ranked and unranked trees, nested words, and Mazurkiewicz traces that have been studied separately.  ...  A first model for concurrent recursive programs with partial-order semantics was considered in [5] . Executions of their concurrent VPA equip Mazurkiewicz traces with multiple nesting relations.  ... 
doi:10.1016/j.jal.2014.05.001 fatcat:2asz5h2ybvajxa6riyzmrnp5ze

Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking [chapter]

Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
2011 Lecture Notes in Computer Science  
We develop a general framework for the design of temporal logics for concurrent recursive programs. A program execution is modeled as a partial order with multiple nesting relations.  ...  This captures, in a unifying framework, a wide range of logics defined for ranked and unranked trees, nested words, and Mazurkiewicz traces that have been studied separately.  ...  A first model for concurrent recursive programs with partial-order semantics was considered in [5] . Executions of their concurrent VPA equip Mazurkiewicz traces with multiple nesting relations.  ... 
doi:10.1007/978-3-642-22993-0_15 fatcat:taess7krsjbnznqf2rnnbdtkb4

A Temporal Trace Language for Formal Modelling and Analysis of Agent Systems [chapter]

A. Sharpanskykh, J. Treur
2010 Specification and Verification of Multi-agent Systems  
This chapter presents the hybrid Temporal Trace Language (TTL) for formal specification and analysis of dynamic properties of multi-agent systems.  ...  TTL has a high expressivity and normal forms that enable automated analysis. Software environments for performing verification of TTL specifications have been developed.  ...  not bi-directional, i.e., it is not always possible to translate TTL expressions into LTL expressions due to the limited expressive power of LTL.  ... 
doi:10.1007/978-1-4419-6984-2_11 fatcat:bmxubbqbwjabbo7dy6oxzxhweq

Verification of Hierarchical Artifact Systems

Alin Deutsch, Yuliang Li, Victor Vianu
2016 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '16  
The proof is non-trivial, building on completeness results for propositional temporal logics on Mazurkiewicz traces [27, 28] (more details are provided in Appendix B.4 of [25] ).  ...  Moreover, HLTL-FO enjoys a pleasing completeness property: it expresses, in a reasonable sense, all interleaving-invariant LTL-FO properties of HAS's.  ...  One typical way to defeat the policy would be for a user to first pay for the flight, then reserve the hotel with the discount price, but next cancel the flight without penalty.  ... 
doi:10.1145/2902251.2902275 dblp:conf/pods/DeutschLV16 fatcat:ulfwgni6tje4hllarthlq3qpfi

Testing Distributed Systems Through Symbolic Model Checking [chapter]

Gabriel Kalyon, Thierry Massart, Cédric Meuter, Laurent Van Begin
2007 Lecture Notes in Computer Science  
We show that in practice this data structure is well adapted for Ctl model checking of traces.  ...  This work can be time consuming; we therefore provide an efficient symbolic Ctl model-checking algorithm for traces.  ...  For Mazurkiewicz traces, local [21, 22] and global [23, 24, 25] trace logics have been defined.  ... 
doi:10.1007/978-3-540-73196-2_17 fatcat:qbdrqn4o3vgvjj6magtyka77sq

TEMPORAL LOGICS FOR DISTRIBUTED SYSTEMS-PARADIGMS AND ALGORITHMS

Edmund Editors, Ursula Clarke, Peter Goltz, Wojciech Niebert, Penczek
unpublished
Acknowledgements Many thanks to the Dagstuhl team and to Thomas Firley for their help and the preparation and organisation of the seminar.  ...  On behalf of all the participants, we would also like to thank the staff of Schloß Dagstuhl for providing an excellent environment. Edmund M. Clarke Ursula Goltz Peter Niebert Wojciech Penczek  ...  An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces Paul Gastin LIAFA, Université Paris 7 Mazurkiewicz traces are a widely accepted model of concurrent systems.  ... 
fatcat:pzni6rqgzfbvvhmuigmyx735ne
« Previous Showing results 1 — 15 out of 23 results