scientific article; zbMATH DE number 1400049
From MaRDI portal
Publication:4939602
zbMath0978.03015MaRDI QIDQ4939602
Jean-François Raskin, Pierre-Yves Schobbens
Publication date: 20 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Temporal logic (03B44)
Related Items (12)
Event Clock Automata: From Theory to Practice ⋮ Model Checking Real-Time Systems ⋮ A brief account of runtime verification ⋮ SMT-based satisfiability of first-order LTL with event freezing functions and metric operators ⋮ Spatial and timing properties in highway traffic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On regions and zones for event-clock automata ⋮ Time-triggered runtime verification ⋮ Enzymatic competition: Modeling and verification with timed hybrid Petri nets ⋮ Complexity issues for timeline-based planning over dense time under future and minimal semantics ⋮ Context-free timed formalisms: robust automata and linear temporal logics
This page was built for publication:
