„trace logic“

Suchergebnisse

1.000+ Treffer

• Stochastic transition systems: bisimulation, logic, and composition
  Gburek, Daniel ; Baier, Christel ; Panangaden, Prakash 2018 Technische Universität Dresden
• Manufacturing a longer chain logically requires manufacturing more than one link; thus is logically manufactured a longer metrological traceability chain…
  Bièvre, Paul De
• Traces of thinking: a stigmergic approach to 4E cognition
  Sims, Ric
• Trace nets and process automata
  Badouel, Eric ; Darondeau, Philippe
• P Systems with Symport/Antiport Rules: The Traces of Objects
  Ionescu, Mihai ; Martín Vide, Carlos ; Păun, Gheorghe
• Logical fragments for Mazurkiewicz traces – expressive power and algebraic characterizations
  Kufleitner, Manfred
• CPD $$_{\textrm{LTLf}}$$ : a linear temporal logic over finite traces guided model checking tool
  Zeng, Xiangqi ; Wang, Meng ; Wang, Miao ; Lu, Xu
• Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking
  Winter, Sarah ; Zimmermann, Martin
• PDDL to DFA: A Symbolic Transformation for Effective Reasoning
  De Giacomo, Giuseppe ; Di Stasio, Antonio ; Parretti, Gianmarco 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Refinement in Z and Object-Z – Foundations and Advanced Applications
  Derrick, John ; Boiten, Eerke 2014 Springer London
• Searching for a Critical Metaphysics: Kantian Traces in Bradley’s Philosophy
  Cavalli, Giulio M.
• Traces in probability space – William Demopoulos. On theories: logical empiricism and the methodology of modern physics, edited by Michael Friedman. Cambridge: Harvard University Press, xxiv + 247 pp, $39.95 HB
  Heathcote, Adrian
• Characterizations of Fragments of Temporal Logic over Mazurkiewicz Traces
  Adsul, Bharat ; Gastin, Paul ; Kulkarni, Shantanu 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Expressive Trace Logic for Recursive Programs
  Gurov, Dilian ; Hähnle, Reiner 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Generic Trace Semantics and Graded Monads
  Milius, Stefan ; Pattinson, Dirk ; Schröder, Lutz 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Complete Inference System for Probabilistic Infinite Trace Equivalence
  Cîrstea, Corina ; Moss, Lawrence S. ; Noquez, Victoria ; Schmid, Todd ; Silva, Alexandra ; Sokolova, Ana 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa
  Artale, Alessandro ; Geatti, Luca ; Gigante, Nicola ; Mazzullo, Andrea ; Montanari, Angelo 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages
  Adsul, Bharat ; Gastin, Paul ; Sarkar, Saptarshi ; Weil, Pascal 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces
  Adsul, Bharat ; Gastin, Paul ; Sarkar, Saptarshi ; Weil, Pascal 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Summary-Based Inter-Procedural Analysis via Modular Trace Refinement
  Cassez, Franck ; Müller, Christian ; Burnett, Karla 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik