Decidable verification for reducible timed automata specified in a first order logic with time
Theoretical Computer Science
Formal description and analysis of a distributed location service for mobile ad hoc networks
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
What's the Name of the Game? Formal Specification of Artificial Intelligence Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal description of a distributed location service for mobile ad hoc networks
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Consistent integration for sequential abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
SDL time extensions from a semantic point of view
SAM'02 Proceedings of the 3rd international conference on Telecommunications and beyond: the broader applicability of SDL and MSC
Persistent queries in the behavioral theory of algorithms
ACM Transactions on Computational Logic (TOCL)
Yuri, logic, and computer science
Fields of logic and computation
Verification in predicate logic with time: algorithmic questions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
SDL-2000: a language with a formal semantics
ROOM'00 Proceedings of the 2000 international conference on Rigorous Object-Oriented Methods
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Executable formal specifications of complex distributed systems with CoreASM
Science of Computer Programming
| Hi-index | 0.00 |