Foundations of Software Science and Computation Structures

From MaRDI portal
Publication:5899090

DOI10.1007/11690634zbMath1180.03021OpenAlexW2504714231MaRDI QIDQ5899090

James Worrell, Joël Ouaknine

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11690634




Related Items (25)

Zeno, Hercules, and the HydraSatisfiability of \(\operatorname{ECTL}^\ast\) with constraintsAdequacy and complete axiomatization for timed modal logicThe decision problem of modal product logics with a diagonal, and faulty counter machinesOn Construction of Safety Signal Automata for $MITL[\:\mathcal{U},\:\mathcal{S}$ Using Temporal Projections] ⋮ Path Checking for MTL and TPTL over Data WordsModel Checking Real-Time SystemsFuture-Looking Logics on Data Words and TreesBounded variability of metric temporal logicOn termination and invariance for faulty channel machinesUnnamed ItemParameterized model checking of weighted networksA temporal logic for micro- and macro-step-based real-time systems: foundations and applicationsModel checking memoryful linear-time logics over one-counter automataOn timed alternating simulation for concurrent timed gamesThe compound interest in relaxing punctualityOn the termination and structural termination problems for counter machines with incrementing errorsThe ω-Regular Post Embedding ProblemUnnamed ItemReactive synthesis from interval temporal logic specificationsComplexity Hierarchies beyond ElementaryModel-checking Timed Temporal LogicsComplexity issues for timeline-based planning over dense time under future and minimal semanticsContext-free timed formalisms: robust automata and linear temporal logicsGeneralized Post embedding problems




This page was built for publication: Foundations of Software Science and Computation Structures