Specifying real-time properties with metric temporal logic
Real-Time Systems
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Evolving algebras 1993: Lipari guide
Specification and validation methods
The bakery algorithm: yet another specification and verification
Specification and validation methods
An algebraic framework for urgency
Information and Computation
Handbook of Process Algebra
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Metric Semantics for True Concurrent Real Time
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Giotto: A Time-Triggered Language for Embedded Programming
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Toward an Approximation Theory for Computerised Control
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
On Specifying Real-Time Systems in a Causality-Based Setting
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Dynamical Properties of Timed Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Verifying Progress in Timed Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
VDM '91 Proceedings of the 4th International Symposium of VDM Europe on Formal Software Development-Volume 2: Tutorials
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Revisiting Digitization, Robustness, and Decidability for Timed Automata
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
The formal semantics of SDL-2000: status and perspectives
Computer Networks: The International Journal of Computer and Telecommunications Networking - ITU-T system design languages (SDL)
Categories of asynchronous systems
Categories of asynchronous systems
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
A high-level modular definition of the semantics of C#
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Implementation of timed automata: an issue of semantics or modeling?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Real-time model checking is really simple
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
| Hi-index | 0.00 |
State machines are a very general means to express computations in an implementationindependent way. There are ways to extend the abstract state machine (ASM) framework with distribution aspects, but there is no unifying framework for handling time so far. We propose event structures extended with time as a natural framework for representing state machines and their true concurrency model at a semantic level and for discussing associated time models. Constraints on these timed event structures and their traces (runs) are then used for characterising different frameworks for timed computations. This characterisation of timed frameworks is independent of ASM and allows to compare time models of different modelling formalisms. Finally, we propose some specific extensions of ASM for the expressions of time constraints in accordance with the event-based semantic framework and show the applicability of the obtained framework on an example with a standard time model and a set of consistency properties for timed computations.