Filters








5,744 Hits in 5.7 sec

On independence-friendly fixpoint logics

J. C. Bradfield
2004 Philosophia Scientiæ  
Abstract: We introduce a fixpoint extension of Hintikka and Sandu's IF (independence-friendly) logic. We obtain some results on its complexity and expressive power.  ...  We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi.  ...  At this point, we should note that Tulenheimo in his doctoral dissertation [Tulenheimo 2004] has also defined and studied 'independence-friendly modal logic'.  ... 
doi:10.4000/philosophiascientiae.568 fatcat:vuezjblzpbcadbu6ktxxiq75l4

Page 5484 of Mathematical Reviews Vol. , Issue 2003g [page]

2003 Mathematical Reviews  
Ryszard Janicki (3-MMAS-C; Hamilton, ON) 2003¢:68092 68Q85 03B45 68Q60 Bradfield, Julian C. (4-EDIN-FCI; Edinburgh) ; Fréschle, Sibylle B. (4-EDIN-FCI; Edinburgh Independence-friendly modal logic and true  ...  “In this paper, we first interpret Henkin modal logics in a setting without locality (at least, without explicit locality), and then relate them to some of the natural true concurrent notions in the literature  ... 

A Logic for True Concurrency [article]

Paolo Baldan, Silvia Crafa
2014 arXiv   pre-print
We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies.  ...  The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be identified which correspond to other true concurrent behavioural equivalences in the literature  ...  We are grateful to Luca Aceto, Sibylle Fröschle and to the anonymous reviewers for their detailed comments and inspiring suggestions which helped us in improving the the paper.  ... 
arXiv:1110.4094v2 fatcat:rilpfihsbbdvpkdnlq4iceoi7q

Logics and Games for True Concurrency [article]

Julian Gutierrez
2010 arXiv   pre-print
Since these mu-calculi and logic games generalise well-known fixpoint logics and game-theoretic decision procedures for concurrent systems with interleaving semantics, the results herein give some of the  ...  Such dualities are used to define new mu-calculi and logic games for the analysis of concurrent systems with partial order semantics.  ...  More precisely, in [5] different properties of a number of fixpoint modal logics based on Hintikka and Sandu's 'Independence-Friendly' (IF) logic are discussed, and in [6] the bisimulation equivalence  ... 
arXiv:1011.1172v1 fatcat:jmahyvyacffzheloesvuwy25xq

A Logic for True Concurrency

Paolo Baldan, Silvia Crafa
2014 Journal of the ACM  
In this respect, it is reminiscent of the modal analogue of independence-friendly modal logic as considered in Bradfield and Fröschle [2002]. The logic contains two main operators.  ...  We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies.  ...  Similarities exist also with the fixpoint extension of independence-friendly modal logic in Bradfield and Kreutzer [2005] .  ... 
doi:10.1145/2629638 fatcat:mdivxmnbpzhvdpkw7dbjkx576i

A Logic for True Concurrency [chapter]

Paolo Baldan, Silvia Crafa
2010 Lecture Notes in Computer Science  
In this respect, it is reminiscent of the modal analogue of independence-friendly modal logic as considered in Bradfield and Fröschle [2002]. The logic contains two main operators.  ...  We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies.  ...  Similarities exist also with the fixpoint extension of independence-friendly modal logic in Bradfield and Kreutzer [2005] .  ... 
doi:10.1007/978-3-642-15375-4_11 fatcat:ddvja3zkyrapdmmydicegpfyye

Exceptions handling within GLARE clinical guideline framework

Giorgio Leonardi, Alessio Bottrighi, Gabriele Galliani, Paolo Terenziani, Antonio Messina, Francesco Della Corte
2012 AMIA Annual Symposium Proceedings  
Computerized clinical guidelines (CIGs) are widely adopted in order to assist practitioner and patient decision making.  ...  A proper and immediate treatment of such exception is necessary, but most current software systems coping with CIGs do not support it.  ...  Exceptions are triggered when the associated propositions become true, independently from the status of execution of the actions in the CIG.  ... 
pmid:23304323 pmcid:PMC3540504 fatcat:ylchjltojjg5jb5yeydkkv7dvy

Modelling simultaneous games in dynamic logic

Johan van Benthem, Sujata Ghosh, Fenrong Liu
2008 Synthese  
We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.  ...  We make a proposal for formalizing simultaneous games at the abstraction level of player's powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic.  ...  the original author(s) and source are credited.  ... 
doi:10.1007/s11229-008-9390-y fatcat:rynxzmyyibhntdsrzix4wbycpu

Some Games Logic Plays [chapter]

Ahti-Veikko Pietarinen
2005 Logic, Thought and Action  
The other compartment that I will be discussing here is the family of IF ('independence-friendly') logics, suggested by Hintikka, 1996 .  ...  I will call this sense actional concurrency. The semantic games for IF logic are in this sense concurrent; they involve independent actions.  ... 
doi:10.1007/1-4020-3167-x_18 dblp:series/leus/Pietarinen05 fatcat:522eangwmrertf4edx6bquomta

The Complexity of Independence-Friendly Fixpoint Logic [chapter]

Julian Bradfield, Stephan Kreutzer
2005 Lecture Notes in Computer Science  
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu's independence-friendly logic.  ...  We show that this logic captures ExpTime; and by embedding PFP, we show that its combined complexity is ExpSpace-hard, and moreover the logic includes second order logic (on finite structures).  ...  Acknowledgements Part of this work was done while the second author was a postdoctoral fellow in Edinburgh supported by the EU Research and Training Network GAMES (Games and Automata for Synthesis and  ... 
doi:10.1007/11538363_25 fatcat:n7ezlxjlknhbznyeqytnhlkw6m

TAPAs: A Tool for the Analysis of Process Algebras [chapter]

Francesco Calzolai, Rocco De Nicola, Michele Loreti, Francesco Tiezzi
2008 Lecture Notes in Computer Science  
TAPAs is a tool that can be used to support the use of process algebras to specify and analyze concurrent systems.  ...  Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties.  ...  We would like to thank Fabio Collini, Massimiliano Gori, Stefano Guerrini and Guzman Tierno for having contributed with their master theses to begin the development of key parts of the software at the  ... 
doi:10.1007/978-3-540-89287-8_4 fatcat:rjozyivhgvgvjj4uosqgwu7m5m

Game theoretical semantics for some non-classical logics

Can Başkent
2016 Journal of Applied Non-Classical Logics  
For this purpose, we consider Priest's Logic of Paradox, Dunn's First-Degree Entailment, Routleys' Relevant Logics, McCall's Connexive Logic and Belnap's four-valued logic.  ...  We also present a game theoretical characterisation of a translation between Logic of Paradox/Kleene's K3 and S5.  ...  The paper is an extended version of Başkent (2015) with full proofs and many additional results extending it to a broader class of logical systems.  ... 
doi:10.1080/11663081.2016.1225488 fatcat:r7ilqozehfae5cgg53t4hjbq4m

Game Theoretical Semantics for Paraconsistent Logics [chapter]

Can Başkent
2015 Lecture Notes in Computer Science  
An epistemic, first-order extension of GTS, called "Independence-Friendly" logic, was suggested by Hintikka and Sandu relating GTS to Henkin quantifiers [8, 11] .  ...  However, Hintikka himself, perhaps with the exception of independence-friendly logic, is not very clear on GTS and intuitionism, especially when it comes to negation [25] .  ...  Let ϕ be true in M . If ϕ is a propositional letter p which is true in M , then Heloise wins the game by definition, hence has a winning strategy. Let ϕ = ¬ψ. Then, ψ is false.  ... 
doi:10.1007/978-3-662-48561-3_2 fatcat:oatlur5qgjaxrivikpqybq6gva

Verifying hardware components with JACK [chapter]

R. Nicola, A. Fantechi, S. Gnesi, S. Larosa, G. Ristori
1995 Lecture Notes in Computer Science  
JACK (the acronym for Just Another Concurrency Kit) is a workbench integrating a set of verification tools for concurrent system specifications, supported by a graphical interface offering facilities to  ...  The environment offers several functionalities to support the design, analysis and verification of systems specified using process algebras.  ...  Yankelevich, the AiTech team and ~the Ansaldo Trasporti team for their contribution to the development and the experimentation of the JACK environment.  ... 
doi:10.1007/3-540-60385-9_15 fatcat:ofk6csfbmreehjo7gg6mv2mqui

On-the-fly model checking for extended action-based probabilistic operators

Radu Mateescu, José Ignacio Requeno
2018 International Journal on Software Tools for Technology Transfer (STTT)  
The quantitative analysis of concurrent systems requires expressive and user-friendly property languages combining temporal, data handling, and quantitative aspects.  ...  We implemented the method in the EVALUATOR model checker of the CADP toolbox and experimented it on realistic PTSs modeling concurrent systems.  ...  We are grateful to the anonymous referees for their constructive criticism and their valuable suggestions for improving the  ... 
doi:10.1007/s10009-018-0499-0 fatcat:f7cqukhb6rhtvmfh4jrbh4wmw4
« Previous Showing results 1 — 15 out of 5,744 results