Sciweavers

51 search results - page 9 / 11
» Liveness Checking as Safety Checking for Infinite State Spac...
Sort
View
ESOP
2012
Springer
12 years 1 months ago
Multiparty Session Types Meet Communicating Automata
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Pierre-Malo Deniélou, Nobuko Yoshida
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 4 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 4 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
APN
2003
Springer
13 years 11 months ago
CPN Tools for Editing, Simulating, and Analysing Coloured Petri Nets
CPN Tools is a tool for editing, simulating and analysing Coloured Petri Nets. The GUI is based on advanced interaction techniques, such as toolglasses, marking menus, and bi-manua...
Anne V. Ratzer, Lisa Wells, Henry Michael Lassen, ...
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 9 days ago
Greedy but Safe Replanning under Kinodynamic Constraints
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
Kostas E. Bekris, Lydia E. Kavraki