Sciweavers

656 search results - page 49 / 132
» A Formalization of Transition P Systems
Sort
View
FM
2009
Springer
98views Formal Methods» more  FM 2009»
15 years 7 months ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
ISSTA
1998
ACM
15 years 4 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...
CONCUR
2007
Springer
15 years 6 months ago
Coalgebraic Models for Reactive Systems
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Filippo Bonchi, Ugo Montanari
132
Voted
CAV
1997
Springer
202views Hardware» more  CAV 1997»
15 years 4 months ago
HYTECH: A Model Checker for Hybrid Systems
A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hybrid systems, which combines, i...
Thomas A. Henzinger, Pei-Hsin Ho, Howard Wong-Toi
129
Voted
TYPES
1993
Springer
15 years 4 months ago
Proof-Checking a Data Link Protocol
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
Leen Helmink, M. P. A. Sellink, Frits W. Vaandrage...