- Communicating automata Dietrich Kuske Anca Muscholl Mon 10 September 2018
- Analysing Neurobiological Models Using Communicating Automata Li Su Rodolfo Gomez Howard Bowman Thu 08 January 2015
- On the progress of communication between two finite state machines M.G. Gouda E.G. Manning Y.T. Yu Thu 06 March 2014
- Multiparty Session Types Meet Communicating Automata Pierre-Malo Deniélou Nobuko Yoshida Mon 03 March 2014
- Hardware Specification with Temporal Logic: An Example G.V. Bochmann Sat 28 December 2013
- Decidable Topologies for Communicating Automata with FIFO and Bag Channels Lorenzo Clemente Frédéric Herbreteau Gregoire Sutre Thu 19 December 2013
- Reachability of Communicating Timed Processes Lorenzo Clemente Frédéric Herbreteau Amelie Stainer Grégoire Sutre Tue 26 February 2013
- Types as models: model checking message-passing programs Sagar Chaki Sriram K. Rajamani Jakob Rehof Sun 24 February 2013
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm S. Akshay Benedikt Bollig Paul Gastin Fri 22 February 2013
- An introduction to event structures Glynn Winskel Thu 21 February 2013
- Forward analysis of depth-bounded processes Thomas Wies Damien Zufferey Thomas A. Henzinger Tue 18 December 2012
- Parallel program schemata Richard M. Karp Raymond E. Miller Fri 26 October 2012
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing Richard Karp Raymond Miller Fri 26 October 2012
- Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs Bernard Boigelot Patrice Godefroid Tue 23 October 2012
- Deadlock detection in communicating finite state machines by even reachability analysis Wuxu Peng Thu 11 October 2012
- Unboundedness detection for a class of communicating finite-state machines Yao-Tin Yu Mohamed G. Gouda Thu 11 October 2012
- On Deadlock Detection in Systems of Communicating Finite State Machines Mohamed Gouda Eitan Gurari Ten-Hwang Lai Louis Rosier Thu 11 October 2012
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations Ahmed Bouajjani Peter Habermehl Mon 08 October 2012
- Verification of programs with half-duplex communication Gérard Cécé Alain Finkel Mon 08 October 2012
- Testing for unboundedness of fifo channels Thierry Jéron Claude Jard Mon 08 October 2012
- A survey on the decidability questions for classes of fifo nets A. Finkel L. Rosier Mon 08 October 2012
- Reachability Analysis of Communicating Pushdown Systems Alexander Heußner Jérôme Leroux Anca Muscholl Grégoire Sutre Wed 03 October 2012
- Communicating Visibly Pushdown Processes Stefan D. Bruda Tawhid Bin Waez Sat 07 July 2012
- Finite state description of communication protocols Gregor V. Bochmann Wed 04 July 2012
- Verification in loosely synchronous queue-connected discrete timed automata Oscar H. Ibarra Zhe Dang Pierluigi San Pietro Wed 04 July 2012
- Analysis of a class of communicating finite state machines Wuxu Peng S. Purushothaman Wed 04 July 2012
- Protocol Description and Analysis Based on a State Transition Model with Channel Expressions Jan K. Pachl Wed 04 July 2012
- Well-abstracted transition systems: application to FIFO automata Alain Finkel S. Purushothaman Iyer Grégoire Sutre Fri 08 June 2012
- A Scalable Incomplete Test for Message Buffer Overflow in Promela Models Stefan Leue Richard Mayr Wei Wei Sat 02 June 2012
- A Scalable Incomplete Test for the Boundedness of UML RT Models Stefan Leue Richard Mayr Wei Wei Sat 02 June 2012
- Matching scenarios with timing constraints Prakash Chandrasekaran Madhavan Mukund Fri 01 June 2012
- Message-passing automata are expressively equivalent to EMSO logic Benedikt Bollig Martin Leucker Mon 28 May 2012
- Message-Passing Automata Are Expressively Equivalent to EMSO Logic Benedikt Bollig Martin Leucker Mon 28 May 2012
- Asynchronously Communicating Visibly Pushdown Systems Domagoj Babic Zvonimir Rakamaric Thu 24 May 2012
- Context-Bounded Analysis of Concurrent Queue Systems Salvatore La Torre P. Madhusudan Gennaro Parlato Thu 24 May 2012
- Bounded MSC communication Markus Lohrey Anca Muscholl Thu 24 May 2012
- Reachability problems for communicating finite state machines Jan Pachl Wed 23 May 2012
- On Communicating Finite-State Machines Daniel Brand Pitro Zafiropulo Wed 09 May 2012
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata Blaise Genest Dietrich Kuske Anca Muscholl Thu 03 May 2012
- On Communicating Automata with Bounded Channels Blaise Genest Dietrich Kuske Anca Muscholl Thu 03 May 2012
- Reachability analysis of communicating pushdown systems Alexander Heußner Jérôme Leroux Anca Muscholl Grégoire Sutre Thu 03 May 2012
- A theory of regular MSC languages Jesper G. Henriksen Madhavan Mukund K. Narayan Kumar Milind Sohoni P. S. Thiagarajan Thu 03 May 2012
- Analysis of Communicating Automata Anca Muscholl Wed 21 March 2012
- Mixing Lossy and Perfect Fifo Channels Pierre Chambart Philippe Schnoebelen Tue 20 March 2012
- Infinite Structures in Timed Systems Pavel Krcal Mon 05 March 2012
- Communicating timed automata: the more synchronous, the more difficult to verify Pavel Krcal Wang Yi Mon 05 March 2012
Library Size: 13G (46 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
